./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_15-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_15-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87d55100d8515cc1c8c9aa61ce99443e0eafb474 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 14:41:05,506 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 14:41:05,509 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 14:41:05,536 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 14:41:05,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 14:41:05,538 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 14:41:05,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 14:41:05,540 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 14:41:05,542 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 14:41:05,543 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 14:41:05,543 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 14:41:05,544 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 14:41:05,545 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 14:41:05,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 14:41:05,547 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 14:41:05,548 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 14:41:05,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 14:41:05,549 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 14:41:05,551 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 14:41:05,552 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 14:41:05,554 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 14:41:05,555 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 14:41:05,556 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 14:41:05,556 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 14:41:05,559 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 14:41:05,559 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 14:41:05,560 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 14:41:05,560 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 14:41:05,561 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 14:41:05,562 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 14:41:05,562 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 14:41:05,563 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 14:41:05,563 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 14:41:05,564 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 14:41:05,567 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 14:41:05,567 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 14:41:05,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 14:41:05,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 14:41:05,568 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 14:41:05,569 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 14:41:05,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 14:41:05,573 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 14:41:05,622 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 14:41:05,624 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 14:41:05,625 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 14:41:05,625 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 14:41:05,627 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 14:41:05,627 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 14:41:05,627 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 14:41:05,627 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 14:41:05,627 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 14:41:05,628 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 14:41:05,628 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 14:41:05,628 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 14:41:05,629 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 14:41:05,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 14:41:05,629 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 14:41:05,629 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 14:41:05,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 14:41:05,630 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 14:41:05,630 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 14:41:05,630 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 14:41:05,630 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 14:41:05,630 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 14:41:05,630 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 14:41:05,631 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 14:41:05,631 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 14:41:05,631 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 14:41:05,631 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 14:41:05,631 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 14:41:05,632 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 14:41:05,632 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 14:41:05,632 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 14:41:05,632 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 14:41:05,633 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 14:41:05,634 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 87d55100d8515cc1c8c9aa61ce99443e0eafb474 [2021-08-27 14:41:05,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 14:41:05,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 14:41:05,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 14:41:05,931 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 14:41:05,932 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 14:41:05,933 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-2.c [2021-08-27 14:41:05,988 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd81f6dce/b0fcdc5e3f324b229421f7b3d872bc4f/FLAG887b5fc6c [2021-08-27 14:41:06,336 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 14:41:06,336 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c [2021-08-27 14:41:06,346 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd81f6dce/b0fcdc5e3f324b229421f7b3d872bc4f/FLAG887b5fc6c [2021-08-27 14:41:06,723 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd81f6dce/b0fcdc5e3f324b229421f7b3d872bc4f [2021-08-27 14:41:06,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 14:41:06,736 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 14:41:06,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 14:41:06,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 14:41:06,742 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 14:41:06,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:41:06" (1/1) ... [2021-08-27 14:41:06,745 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34f5d8e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:06, skipping insertion in model container [2021-08-27 14:41:06,745 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:41:06" (1/1) ... [2021-08-27 14:41:06,753 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 14:41:06,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 14:41:06,915 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c[5628,5641] [2021-08-27 14:41:06,917 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 14:41:06,925 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 14:41:06,985 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c[5628,5641] [2021-08-27 14:41:06,986 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 14:41:07,003 INFO L208 MainTranslator]: Completed translation [2021-08-27 14:41:07,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:07 WrapperNode [2021-08-27 14:41:07,004 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 14:41:07,005 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 14:41:07,005 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 14:41:07,012 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 14:41:07,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:07" (1/1) ... [2021-08-27 14:41:07,035 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:07" (1/1) ... [2021-08-27 14:41:07,065 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 14:41:07,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 14:41:07,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 14:41:07,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 14:41:07,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:07" (1/1) ... [2021-08-27 14:41:07,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:07" (1/1) ... [2021-08-27 14:41:07,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:07" (1/1) ... [2021-08-27 14:41:07,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:07" (1/1) ... [2021-08-27 14:41:07,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:07" (1/1) ... [2021-08-27 14:41:07,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:07" (1/1) ... [2021-08-27 14:41:07,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:07" (1/1) ... [2021-08-27 14:41:07,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 14:41:07,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 14:41:07,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 14:41:07,113 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 14:41:07,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:07" (1/1) ... [2021-08-27 14:41:07,123 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:41:07,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:41:07,146 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:41:07,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-27 14:41:07,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 14:41:07,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 14:41:07,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 14:41:07,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 14:41:07,605 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 14:41:07,606 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-08-27 14:41:07,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:41:07 BoogieIcfgContainer [2021-08-27 14:41:07,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 14:41:07,608 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 14:41:07,609 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 14:41:07,611 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 14:41:07,612 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:41:07,612 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 02:41:06" (1/3) ... [2021-08-27 14:41:07,613 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a84f310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 02:41:07, skipping insertion in model container [2021-08-27 14:41:07,613 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:41:07,613 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:41:07" (2/3) ... [2021-08-27 14:41:07,614 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a84f310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 02:41:07, skipping insertion in model container [2021-08-27 14:41:07,614 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:41:07,614 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:41:07" (3/3) ... [2021-08-27 14:41:07,615 INFO L389 chiAutomizerObserver]: Analyzing ICFG test_locks_15-2.c [2021-08-27 14:41:07,649 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 14:41:07,649 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 14:41:07,650 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 14:41:07,650 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 14:41:07,650 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 14:41:07,650 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 14:41:07,650 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 14:41:07,650 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 14:41:07,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 53 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:07,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-08-27 14:41:07,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:07,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:07,682 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:07,682 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:07,682 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 14:41:07,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 53 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:07,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-08-27 14:41:07,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:07,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:07,687 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:07,687 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:07,692 INFO L791 eck$LassoCheckResult]: Stem: 44#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 34#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 21#L225-1true [2021-08-27 14:41:07,698 INFO L793 eck$LassoCheckResult]: Loop: 21#L225-1true assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 33#L58true assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 29#L93true assume 0 != main_~p1~0;main_~lk1~0 := 1; 26#L93-2true assume 0 != main_~p2~0;main_~lk2~0 := 1; 14#L97-1true assume !(0 != main_~p3~0); 17#L101-1true assume 0 != main_~p4~0;main_~lk4~0 := 1; 51#L105-1true assume 0 != main_~p5~0;main_~lk5~0 := 1; 46#L109-1true assume 0 != main_~p6~0;main_~lk6~0 := 1; 13#L113-1true assume 0 != main_~p7~0;main_~lk7~0 := 1; 23#L117-1true assume 0 != main_~p8~0;main_~lk8~0 := 1; 31#L121-1true assume 0 != main_~p9~0;main_~lk9~0 := 1; 18#L125-1true assume 0 != main_~p10~0;main_~lk10~0 := 1; 36#L129-1true assume !(0 != main_~p11~0); 4#L133-1true assume 0 != main_~p12~0;main_~lk12~0 := 1; 7#L137-1true assume 0 != main_~p13~0;main_~lk13~0 := 1; 41#L141-1true assume 0 != main_~p14~0;main_~lk14~0 := 1; 55#L145-1true assume 0 != main_~p15~0;main_~lk15~0 := 1; 49#L149-1true assume !(0 != main_~p1~0); 48#L155-1true assume !(0 != main_~p2~0); 28#L160-1true assume !(0 != main_~p3~0); 12#L165-1true assume !(0 != main_~p4~0); 43#L170-1true assume !(0 != main_~p5~0); 47#L175-1true assume !(0 != main_~p6~0); 19#L180-1true assume !(0 != main_~p7~0); 40#L185-1true assume !(0 != main_~p8~0); 25#L190-1true assume !(0 != main_~p9~0); 42#L195-1true assume !(0 != main_~p10~0); 16#L200-1true assume !(0 != main_~p11~0); 45#L205-1true assume !(0 != main_~p12~0); 24#L210-1true assume !(0 != main_~p13~0); 6#L215-1true assume !(0 != main_~p14~0); 38#L220-1true assume !(0 != main_~p15~0); 21#L225-1true [2021-08-27 14:41:07,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:07,704 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-27 14:41:07,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:07,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265281532] [2021-08-27 14:41:07,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:07,713 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:07,783 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:07,814 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:07,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:07,817 INFO L82 PathProgramCache]: Analyzing trace with hash 2064553094, now seen corresponding path program 1 times [2021-08-27 14:41:07,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:07,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292167596] [2021-08-27 14:41:07,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:07,818 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:41:07,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:41:07,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:41:07,889 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292167596] [2021-08-27 14:41:07,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292167596] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:41:07,890 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:41:07,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:41:07,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654510640] [2021-08-27 14:41:07,895 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:41:07,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:41:07,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:41:07,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:41:07,908 INFO L87 Difference]: Start difference. First operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 53 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:07,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:41:07,940 INFO L93 Difference]: Finished difference Result 105 states and 190 transitions. [2021-08-27 14:41:07,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:41:07,941 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 190 transitions. [2021-08-27 14:41:07,945 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2021-08-27 14:41:07,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 95 states and 153 transitions. [2021-08-27 14:41:07,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2021-08-27 14:41:07,951 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2021-08-27 14:41:07,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 153 transitions. [2021-08-27 14:41:07,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:41:07,952 INFO L681 BuchiCegarLoop]: Abstraction has 95 states and 153 transitions. [2021-08-27 14:41:07,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 153 transitions. [2021-08-27 14:41:07,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-08-27 14:41:07,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.6105263157894736) internal successors, (153), 94 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:07,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 153 transitions. [2021-08-27 14:41:07,979 INFO L704 BuchiCegarLoop]: Abstraction has 95 states and 153 transitions. [2021-08-27 14:41:07,979 INFO L587 BuchiCegarLoop]: Abstraction has 95 states and 153 transitions. [2021-08-27 14:41:07,979 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 14:41:07,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 153 transitions. [2021-08-27 14:41:07,981 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2021-08-27 14:41:07,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:07,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:07,982 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:07,982 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:07,982 INFO L791 eck$LassoCheckResult]: Stem: 215#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 208#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 209#L225-1 [2021-08-27 14:41:07,982 INFO L793 eck$LassoCheckResult]: Loop: 209#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 237#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 236#L93 assume !(0 != main_~p1~0); 235#L93-2 assume 0 != main_~p2~0;main_~lk2~0 := 1; 234#L97-1 assume !(0 != main_~p3~0); 233#L101-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 220#L105-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 216#L109-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 183#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 184#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 199#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 191#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 192#L129-1 assume !(0 != main_~p11~0); 168#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 169#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 173#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 212#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 221#L149-1 assume !(0 != main_~p1~0); 222#L155-1 assume !(0 != main_~p2~0); 261#L160-1 assume !(0 != main_~p3~0); 259#L165-1 assume !(0 != main_~p4~0); 256#L170-1 assume !(0 != main_~p5~0); 255#L175-1 assume !(0 != main_~p6~0); 253#L180-1 assume !(0 != main_~p7~0); 250#L185-1 assume !(0 != main_~p8~0); 249#L190-1 assume !(0 != main_~p9~0); 247#L195-1 assume !(0 != main_~p10~0); 187#L200-1 assume !(0 != main_~p11~0); 188#L205-1 assume !(0 != main_~p12~0); 206#L210-1 assume !(0 != main_~p13~0); 241#L215-1 assume !(0 != main_~p14~0); 239#L220-1 assume !(0 != main_~p15~0); 209#L225-1 [2021-08-27 14:41:07,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:07,983 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-08-27 14:41:07,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:07,983 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809579075] [2021-08-27 14:41:07,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:07,984 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:07,995 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:08,010 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:08,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:08,011 INFO L82 PathProgramCache]: Analyzing trace with hash 2087185348, now seen corresponding path program 1 times [2021-08-27 14:41:08,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:08,011 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915509359] [2021-08-27 14:41:08,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:08,011 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:41:08,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:41:08,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:41:08,043 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915509359] [2021-08-27 14:41:08,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915509359] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:41:08,043 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:41:08,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:41:08,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837493801] [2021-08-27 14:41:08,044 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:41:08,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:41:08,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:41:08,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:41:08,045 INFO L87 Difference]: Start difference. First operand 95 states and 153 transitions. cyclomatic complexity: 60 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:08,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:41:08,062 INFO L93 Difference]: Finished difference Result 186 states and 298 transitions. [2021-08-27 14:41:08,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:41:08,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 298 transitions. [2021-08-27 14:41:08,069 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2021-08-27 14:41:08,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 186 states and 298 transitions. [2021-08-27 14:41:08,093 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2021-08-27 14:41:08,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 186 [2021-08-27 14:41:08,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 298 transitions. [2021-08-27 14:41:08,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:41:08,095 INFO L681 BuchiCegarLoop]: Abstraction has 186 states and 298 transitions. [2021-08-27 14:41:08,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 298 transitions. [2021-08-27 14:41:08,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2021-08-27 14:41:08,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 186 states have (on average 1.6021505376344085) internal successors, (298), 185 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:08,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 298 transitions. [2021-08-27 14:41:08,108 INFO L704 BuchiCegarLoop]: Abstraction has 186 states and 298 transitions. [2021-08-27 14:41:08,108 INFO L587 BuchiCegarLoop]: Abstraction has 186 states and 298 transitions. [2021-08-27 14:41:08,108 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 14:41:08,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 186 states and 298 transitions. [2021-08-27 14:41:08,111 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2021-08-27 14:41:08,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:08,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:08,111 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:08,112 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:08,112 INFO L791 eck$LassoCheckResult]: Stem: 508#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 498#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 499#L225-1 [2021-08-27 14:41:08,112 INFO L793 eck$LassoCheckResult]: Loop: 499#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 554#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 552#L93 assume !(0 != main_~p1~0); 537#L93-2 assume !(0 != main_~p2~0); 538#L97-1 assume !(0 != main_~p3~0); 533#L101-1 assume 0 != main_~p4~0;main_~lk4~0 := 1; 514#L105-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 509#L109-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 470#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 471#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 486#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 478#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 479#L129-1 assume !(0 != main_~p11~0); 455#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 456#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 460#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 515#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 516#L149-1 assume !(0 != main_~p1~0); 540#L155-1 assume !(0 != main_~p2~0); 591#L160-1 assume !(0 != main_~p3~0); 589#L165-1 assume !(0 != main_~p4~0); 586#L170-1 assume !(0 != main_~p5~0); 585#L175-1 assume !(0 != main_~p6~0); 583#L180-1 assume !(0 != main_~p7~0); 580#L185-1 assume !(0 != main_~p8~0); 579#L190-1 assume !(0 != main_~p9~0); 577#L195-1 assume !(0 != main_~p10~0); 575#L200-1 assume !(0 != main_~p11~0); 573#L205-1 assume !(0 != main_~p12~0); 571#L210-1 assume !(0 != main_~p13~0); 569#L215-1 assume !(0 != main_~p14~0); 558#L220-1 assume !(0 != main_~p15~0); 499#L225-1 [2021-08-27 14:41:08,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:08,113 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-08-27 14:41:08,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:08,113 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674547536] [2021-08-27 14:41:08,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:08,113 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:08,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:08,122 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:08,134 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:08,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:08,134 INFO L82 PathProgramCache]: Analyzing trace with hash -821578554, now seen corresponding path program 1 times [2021-08-27 14:41:08,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:08,135 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286776080] [2021-08-27 14:41:08,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:08,135 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:41:08,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:41:08,194 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:41:08,194 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286776080] [2021-08-27 14:41:08,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286776080] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:41:08,194 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:41:08,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:41:08,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770682749] [2021-08-27 14:41:08,196 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:41:08,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:41:08,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:41:08,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:41:08,201 INFO L87 Difference]: Start difference. First operand 186 states and 298 transitions. cyclomatic complexity: 116 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:08,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:41:08,225 INFO L93 Difference]: Finished difference Result 366 states and 582 transitions. [2021-08-27 14:41:08,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:41:08,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 366 states and 582 transitions. [2021-08-27 14:41:08,230 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2021-08-27 14:41:08,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 366 states to 366 states and 582 transitions. [2021-08-27 14:41:08,240 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 366 [2021-08-27 14:41:08,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 366 [2021-08-27 14:41:08,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 366 states and 582 transitions. [2021-08-27 14:41:08,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:41:08,247 INFO L681 BuchiCegarLoop]: Abstraction has 366 states and 582 transitions. [2021-08-27 14:41:08,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states and 582 transitions. [2021-08-27 14:41:08,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2021-08-27 14:41:08,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 366 states have (on average 1.5901639344262295) internal successors, (582), 365 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:08,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 582 transitions. [2021-08-27 14:41:08,273 INFO L704 BuchiCegarLoop]: Abstraction has 366 states and 582 transitions. [2021-08-27 14:41:08,273 INFO L587 BuchiCegarLoop]: Abstraction has 366 states and 582 transitions. [2021-08-27 14:41:08,273 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 14:41:08,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 366 states and 582 transitions. [2021-08-27 14:41:08,275 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2021-08-27 14:41:08,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:08,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:08,276 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:08,276 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:08,276 INFO L791 eck$LassoCheckResult]: Stem: 1067#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1057#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 1058#L225-1 [2021-08-27 14:41:08,276 INFO L793 eck$LassoCheckResult]: Loop: 1058#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 1096#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 1092#L93 assume !(0 != main_~p1~0); 1085#L93-2 assume !(0 != main_~p2~0); 1086#L97-1 assume !(0 != main_~p3~0); 1237#L101-1 assume !(0 != main_~p4~0); 1234#L105-1 assume 0 != main_~p5~0;main_~lk5~0 := 1; 1232#L109-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 1228#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 1224#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 1220#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 1216#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 1212#L129-1 assume !(0 != main_~p11~0); 1208#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 1204#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 1200#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 1196#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 1190#L149-1 assume !(0 != main_~p1~0); 1188#L155-1 assume !(0 != main_~p2~0); 1187#L160-1 assume !(0 != main_~p3~0); 1182#L165-1 assume !(0 != main_~p4~0); 1175#L170-1 assume !(0 != main_~p5~0); 1127#L175-1 assume !(0 != main_~p6~0); 1123#L180-1 assume !(0 != main_~p7~0); 1120#L185-1 assume !(0 != main_~p8~0); 1119#L190-1 assume !(0 != main_~p9~0); 1117#L195-1 assume !(0 != main_~p10~0); 1115#L200-1 assume !(0 != main_~p11~0); 1113#L205-1 assume !(0 != main_~p12~0); 1111#L210-1 assume !(0 != main_~p13~0); 1109#L215-1 assume !(0 != main_~p14~0); 1107#L220-1 assume !(0 != main_~p15~0); 1058#L225-1 [2021-08-27 14:41:08,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:08,277 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-08-27 14:41:08,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:08,277 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025899842] [2021-08-27 14:41:08,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:08,278 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:08,287 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:08,296 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:08,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:08,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1101649480, now seen corresponding path program 1 times [2021-08-27 14:41:08,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:08,297 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471474422] [2021-08-27 14:41:08,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:08,298 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:41:08,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:41:08,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:41:08,322 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471474422] [2021-08-27 14:41:08,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471474422] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:41:08,323 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:41:08,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:41:08,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120948924] [2021-08-27 14:41:08,323 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:41:08,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:41:08,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:41:08,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:41:08,324 INFO L87 Difference]: Start difference. First operand 366 states and 582 transitions. cyclomatic complexity: 224 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:08,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:41:08,338 INFO L93 Difference]: Finished difference Result 722 states and 1138 transitions. [2021-08-27 14:41:08,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:41:08,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 722 states and 1138 transitions. [2021-08-27 14:41:08,343 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2021-08-27 14:41:08,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 722 states to 722 states and 1138 transitions. [2021-08-27 14:41:08,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 722 [2021-08-27 14:41:08,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 722 [2021-08-27 14:41:08,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 722 states and 1138 transitions. [2021-08-27 14:41:08,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:41:08,356 INFO L681 BuchiCegarLoop]: Abstraction has 722 states and 1138 transitions. [2021-08-27 14:41:08,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states and 1138 transitions. [2021-08-27 14:41:08,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2021-08-27 14:41:08,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 722 states have (on average 1.5761772853185596) internal successors, (1138), 721 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:08,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1138 transitions. [2021-08-27 14:41:08,378 INFO L704 BuchiCegarLoop]: Abstraction has 722 states and 1138 transitions. [2021-08-27 14:41:08,378 INFO L587 BuchiCegarLoop]: Abstraction has 722 states and 1138 transitions. [2021-08-27 14:41:08,378 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 14:41:08,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 722 states and 1138 transitions. [2021-08-27 14:41:08,382 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2021-08-27 14:41:08,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:08,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:08,382 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:08,382 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:08,383 INFO L791 eck$LassoCheckResult]: Stem: 2156#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 2149#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 2150#L225-1 [2021-08-27 14:41:08,383 INFO L793 eck$LassoCheckResult]: Loop: 2150#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 2251#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 2247#L93 assume !(0 != main_~p1~0); 2240#L93-2 assume !(0 != main_~p2~0); 2235#L97-1 assume !(0 != main_~p3~0); 2228#L101-1 assume !(0 != main_~p4~0); 2222#L105-1 assume !(0 != main_~p5~0); 2218#L109-1 assume 0 != main_~p6~0;main_~lk6~0 := 1; 2216#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 2214#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 2212#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 2210#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 2207#L129-1 assume !(0 != main_~p11~0); 2208#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 2201#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 2202#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 2194#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 2195#L149-1 assume !(0 != main_~p1~0); 2184#L155-1 assume !(0 != main_~p2~0); 2186#L160-1 assume !(0 != main_~p3~0); 2363#L165-1 assume !(0 != main_~p4~0); 2351#L170-1 assume !(0 != main_~p5~0); 2350#L175-1 assume !(0 != main_~p6~0); 2348#L180-1 assume !(0 != main_~p7~0); 2344#L185-1 assume !(0 != main_~p8~0); 2339#L190-1 assume !(0 != main_~p9~0); 2333#L195-1 assume !(0 != main_~p10~0); 2282#L200-1 assume !(0 != main_~p11~0); 2280#L205-1 assume !(0 != main_~p12~0); 2274#L210-1 assume !(0 != main_~p13~0); 2270#L215-1 assume !(0 != main_~p14~0); 2260#L220-1 assume !(0 != main_~p15~0); 2150#L225-1 [2021-08-27 14:41:08,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:08,383 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-08-27 14:41:08,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:08,384 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068915618] [2021-08-27 14:41:08,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:08,384 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:08,391 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:08,405 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:08,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:08,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1163689094, now seen corresponding path program 1 times [2021-08-27 14:41:08,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:08,406 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395868597] [2021-08-27 14:41:08,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:08,406 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:41:08,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:41:08,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:41:08,456 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395868597] [2021-08-27 14:41:08,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395868597] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:41:08,456 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:41:08,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:41:08,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440455806] [2021-08-27 14:41:08,457 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:41:08,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:41:08,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:41:08,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:41:08,458 INFO L87 Difference]: Start difference. First operand 722 states and 1138 transitions. cyclomatic complexity: 432 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:08,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:41:08,473 INFO L93 Difference]: Finished difference Result 1426 states and 2226 transitions. [2021-08-27 14:41:08,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:41:08,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1426 states and 2226 transitions. [2021-08-27 14:41:08,484 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2021-08-27 14:41:08,492 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1426 states to 1426 states and 2226 transitions. [2021-08-27 14:41:08,492 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1426 [2021-08-27 14:41:08,493 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1426 [2021-08-27 14:41:08,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1426 states and 2226 transitions. [2021-08-27 14:41:08,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:41:08,495 INFO L681 BuchiCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2021-08-27 14:41:08,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states and 2226 transitions. [2021-08-27 14:41:08,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1426. [2021-08-27 14:41:08,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1426 states have (on average 1.5610098176718092) internal successors, (2226), 1425 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:08,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2226 transitions. [2021-08-27 14:41:08,533 INFO L704 BuchiCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2021-08-27 14:41:08,533 INFO L587 BuchiCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2021-08-27 14:41:08,533 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 14:41:08,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1426 states and 2226 transitions. [2021-08-27 14:41:08,541 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2021-08-27 14:41:08,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:08,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:08,542 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:08,542 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:08,543 INFO L791 eck$LassoCheckResult]: Stem: 4313#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 4305#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 4306#L225-1 [2021-08-27 14:41:08,543 INFO L793 eck$LassoCheckResult]: Loop: 4306#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 4520#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 4521#L93 assume !(0 != main_~p1~0); 4734#L93-2 assume !(0 != main_~p2~0); 4733#L97-1 assume !(0 != main_~p3~0); 4731#L101-1 assume !(0 != main_~p4~0); 4728#L105-1 assume !(0 != main_~p5~0); 4724#L109-1 assume !(0 != main_~p6~0); 4722#L113-1 assume 0 != main_~p7~0;main_~lk7~0 := 1; 4720#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 4718#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 4716#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 4714#L129-1 assume !(0 != main_~p11~0); 4712#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 4710#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 4708#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 4706#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 4703#L149-1 assume !(0 != main_~p1~0); 4704#L155-1 assume !(0 != main_~p2~0); 4753#L160-1 assume !(0 != main_~p3~0); 4654#L165-1 assume !(0 != main_~p4~0); 4655#L170-1 assume !(0 != main_~p5~0); 4643#L175-1 assume !(0 != main_~p6~0); 4645#L180-1 assume !(0 != main_~p7~0); 4627#L185-1 assume !(0 != main_~p8~0); 4628#L190-1 assume !(0 != main_~p9~0); 4612#L195-1 assume !(0 != main_~p10~0); 4611#L200-1 assume !(0 != main_~p11~0); 4595#L205-1 assume !(0 != main_~p12~0); 4587#L210-1 assume !(0 != main_~p13~0); 4586#L215-1 assume !(0 != main_~p14~0); 4540#L220-1 assume !(0 != main_~p15~0); 4306#L225-1 [2021-08-27 14:41:08,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:08,544 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-08-27 14:41:08,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:08,544 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724212600] [2021-08-27 14:41:08,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:08,546 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:08,561 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:08,581 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:08,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:08,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1304237704, now seen corresponding path program 1 times [2021-08-27 14:41:08,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:08,586 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780985457] [2021-08-27 14:41:08,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:08,586 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:41:08,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:41:08,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:41:08,633 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780985457] [2021-08-27 14:41:08,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780985457] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:41:08,634 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:41:08,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:41:08,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705690464] [2021-08-27 14:41:08,635 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:41:08,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:41:08,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:41:08,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:41:08,637 INFO L87 Difference]: Start difference. First operand 1426 states and 2226 transitions. cyclomatic complexity: 832 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:08,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:41:08,662 INFO L93 Difference]: Finished difference Result 2818 states and 4354 transitions. [2021-08-27 14:41:08,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:41:08,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2818 states and 4354 transitions. [2021-08-27 14:41:08,693 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2021-08-27 14:41:08,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2818 states to 2818 states and 4354 transitions. [2021-08-27 14:41:08,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2818 [2021-08-27 14:41:08,736 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2818 [2021-08-27 14:41:08,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2818 states and 4354 transitions. [2021-08-27 14:41:08,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:41:08,739 INFO L681 BuchiCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2021-08-27 14:41:08,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states and 4354 transitions. [2021-08-27 14:41:08,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2818. [2021-08-27 14:41:08,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2818 states have (on average 1.5450674237047552) internal successors, (4354), 2817 states have internal predecessors, (4354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:08,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 4354 transitions. [2021-08-27 14:41:08,798 INFO L704 BuchiCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2021-08-27 14:41:08,798 INFO L587 BuchiCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2021-08-27 14:41:08,798 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 14:41:08,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2818 states and 4354 transitions. [2021-08-27 14:41:08,815 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2021-08-27 14:41:08,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:08,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:08,817 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:08,817 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:08,818 INFO L791 eck$LassoCheckResult]: Stem: 8576#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 8562#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 8563#L225-1 [2021-08-27 14:41:08,818 INFO L793 eck$LassoCheckResult]: Loop: 8563#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 8727#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 8725#L93 assume !(0 != main_~p1~0); 8724#L93-2 assume !(0 != main_~p2~0); 8718#L97-1 assume !(0 != main_~p3~0); 8719#L101-1 assume !(0 != main_~p4~0); 8825#L105-1 assume !(0 != main_~p5~0); 8822#L109-1 assume !(0 != main_~p6~0); 8818#L113-1 assume !(0 != main_~p7~0); 8816#L117-1 assume 0 != main_~p8~0;main_~lk8~0 := 1; 8815#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 8812#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 8809#L129-1 assume !(0 != main_~p11~0); 8806#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 8802#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 8798#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 8793#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 8787#L149-1 assume !(0 != main_~p1~0); 8781#L155-1 assume !(0 != main_~p2~0); 8776#L160-1 assume !(0 != main_~p3~0); 8769#L165-1 assume !(0 != main_~p4~0); 8763#L170-1 assume !(0 != main_~p5~0); 8758#L175-1 assume !(0 != main_~p6~0); 8756#L180-1 assume !(0 != main_~p7~0); 8750#L185-1 assume !(0 != main_~p8~0); 8747#L190-1 assume !(0 != main_~p9~0); 8743#L195-1 assume !(0 != main_~p10~0); 8737#L200-1 assume !(0 != main_~p11~0); 8735#L205-1 assume !(0 != main_~p12~0); 8733#L210-1 assume !(0 != main_~p13~0); 8731#L215-1 assume !(0 != main_~p14~0); 8729#L220-1 assume !(0 != main_~p15~0); 8563#L225-1 [2021-08-27 14:41:08,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:08,819 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-08-27 14:41:08,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:08,819 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087412107] [2021-08-27 14:41:08,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:08,820 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:08,832 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:08,840 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:08,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:08,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1170224198, now seen corresponding path program 1 times [2021-08-27 14:41:08,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:08,845 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826691494] [2021-08-27 14:41:08,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:08,846 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:41:08,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:41:08,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:41:08,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826691494] [2021-08-27 14:41:08,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826691494] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:41:08,890 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:41:08,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:41:08,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064970654] [2021-08-27 14:41:08,891 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:41:08,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:41:08,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:41:08,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:41:08,892 INFO L87 Difference]: Start difference. First operand 2818 states and 4354 transitions. cyclomatic complexity: 1600 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:08,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:41:08,927 INFO L93 Difference]: Finished difference Result 5570 states and 8514 transitions. [2021-08-27 14:41:08,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:41:08,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5570 states and 8514 transitions. [2021-08-27 14:41:08,973 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2021-08-27 14:41:09,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5570 states to 5570 states and 8514 transitions. [2021-08-27 14:41:09,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5570 [2021-08-27 14:41:09,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5570 [2021-08-27 14:41:09,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5570 states and 8514 transitions. [2021-08-27 14:41:09,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:41:09,045 INFO L681 BuchiCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2021-08-27 14:41:09,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states and 8514 transitions. [2021-08-27 14:41:09,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 5570. [2021-08-27 14:41:09,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5570 states, 5570 states have (on average 1.5285457809694794) internal successors, (8514), 5569 states have internal predecessors, (8514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:09,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5570 states to 5570 states and 8514 transitions. [2021-08-27 14:41:09,260 INFO L704 BuchiCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2021-08-27 14:41:09,260 INFO L587 BuchiCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2021-08-27 14:41:09,260 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 14:41:09,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5570 states and 8514 transitions. [2021-08-27 14:41:09,286 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2021-08-27 14:41:09,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:09,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:09,288 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:09,288 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:09,288 INFO L791 eck$LassoCheckResult]: Stem: 16963#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 16949#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 16950#L225-1 [2021-08-27 14:41:09,289 INFO L793 eck$LassoCheckResult]: Loop: 16950#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 17206#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 17200#L93 assume !(0 != main_~p1~0); 17196#L93-2 assume !(0 != main_~p2~0); 17193#L97-1 assume !(0 != main_~p3~0); 17187#L101-1 assume !(0 != main_~p4~0); 17181#L105-1 assume !(0 != main_~p5~0); 17177#L109-1 assume !(0 != main_~p6~0); 17172#L113-1 assume !(0 != main_~p7~0); 17166#L117-1 assume !(0 != main_~p8~0); 17167#L121-1 assume 0 != main_~p9~0;main_~lk9~0 := 1; 17154#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 17155#L129-1 assume !(0 != main_~p11~0); 17146#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 17147#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 17138#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 17139#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 17128#L149-1 assume !(0 != main_~p1~0); 17129#L155-1 assume !(0 != main_~p2~0); 17118#L160-1 assume !(0 != main_~p3~0); 17117#L165-1 assume !(0 != main_~p4~0); 17104#L170-1 assume !(0 != main_~p5~0); 17105#L175-1 assume !(0 != main_~p6~0); 17095#L180-1 assume !(0 != main_~p7~0); 17096#L185-1 assume !(0 != main_~p8~0); 17248#L190-1 assume !(0 != main_~p9~0); 17244#L195-1 assume !(0 != main_~p10~0); 17240#L200-1 assume !(0 != main_~p11~0); 17234#L205-1 assume !(0 != main_~p12~0); 17228#L210-1 assume !(0 != main_~p13~0); 17222#L215-1 assume !(0 != main_~p14~0); 17216#L220-1 assume !(0 != main_~p15~0); 16950#L225-1 [2021-08-27 14:41:09,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:09,289 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-08-27 14:41:09,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:09,290 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538833123] [2021-08-27 14:41:09,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:09,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:09,304 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:09,322 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:09,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:09,325 INFO L82 PathProgramCache]: Analyzing trace with hash -635214136, now seen corresponding path program 1 times [2021-08-27 14:41:09,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:09,326 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591542543] [2021-08-27 14:41:09,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:09,326 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:41:09,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:41:09,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:41:09,358 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591542543] [2021-08-27 14:41:09,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591542543] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:41:09,363 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:41:09,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:41:09,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340112983] [2021-08-27 14:41:09,366 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:41:09,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:41:09,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:41:09,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:41:09,368 INFO L87 Difference]: Start difference. First operand 5570 states and 8514 transitions. cyclomatic complexity: 3072 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:09,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:41:09,440 INFO L93 Difference]: Finished difference Result 11010 states and 16642 transitions. [2021-08-27 14:41:09,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:41:09,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11010 states and 16642 transitions. [2021-08-27 14:41:09,508 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2021-08-27 14:41:09,586 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11010 states to 11010 states and 16642 transitions. [2021-08-27 14:41:09,586 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11010 [2021-08-27 14:41:09,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11010 [2021-08-27 14:41:09,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11010 states and 16642 transitions. [2021-08-27 14:41:09,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:41:09,606 INFO L681 BuchiCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2021-08-27 14:41:09,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11010 states and 16642 transitions. [2021-08-27 14:41:09,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11010 to 11010. [2021-08-27 14:41:09,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11010 states, 11010 states have (on average 1.5115349682107175) internal successors, (16642), 11009 states have internal predecessors, (16642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:09,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11010 states to 11010 states and 16642 transitions. [2021-08-27 14:41:09,962 INFO L704 BuchiCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2021-08-27 14:41:09,962 INFO L587 BuchiCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2021-08-27 14:41:09,963 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-27 14:41:09,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11010 states and 16642 transitions. [2021-08-27 14:41:10,058 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2021-08-27 14:41:10,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:10,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:10,060 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:10,060 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:10,060 INFO L791 eck$LassoCheckResult]: Stem: 33547#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 33535#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 33536#L225-1 [2021-08-27 14:41:10,061 INFO L793 eck$LassoCheckResult]: Loop: 33536#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 34190#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 34191#L93 assume !(0 != main_~p1~0); 34313#L93-2 assume !(0 != main_~p2~0); 34311#L97-1 assume !(0 != main_~p3~0); 34307#L101-1 assume !(0 != main_~p4~0); 34304#L105-1 assume !(0 != main_~p5~0); 34302#L109-1 assume !(0 != main_~p6~0); 34298#L113-1 assume !(0 != main_~p7~0); 34294#L117-1 assume !(0 != main_~p8~0); 34290#L121-1 assume !(0 != main_~p9~0); 34288#L125-1 assume 0 != main_~p10~0;main_~lk10~0 := 1; 34286#L129-1 assume !(0 != main_~p11~0); 34284#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 34282#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 34280#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 34278#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 34274#L149-1 assume !(0 != main_~p1~0); 34270#L155-1 assume !(0 != main_~p2~0); 34267#L160-1 assume !(0 != main_~p3~0); 34262#L165-1 assume !(0 != main_~p4~0); 34258#L170-1 assume !(0 != main_~p5~0); 34256#L175-1 assume !(0 != main_~p6~0); 34233#L180-1 assume !(0 != main_~p7~0); 34234#L185-1 assume !(0 != main_~p8~0); 34227#L190-1 assume !(0 != main_~p9~0); 34229#L195-1 assume !(0 != main_~p10~0); 34223#L200-1 assume !(0 != main_~p11~0); 34222#L205-1 assume !(0 != main_~p12~0); 34217#L210-1 assume !(0 != main_~p13~0); 34216#L215-1 assume !(0 != main_~p14~0); 34208#L220-1 assume !(0 != main_~p15~0); 33536#L225-1 [2021-08-27 14:41:10,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:10,062 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-08-27 14:41:10,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:10,063 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115021405] [2021-08-27 14:41:10,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:10,063 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:10,072 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:10,103 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:10,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:10,104 INFO L82 PathProgramCache]: Analyzing trace with hash -416359418, now seen corresponding path program 1 times [2021-08-27 14:41:10,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:10,105 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500955709] [2021-08-27 14:41:10,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:10,105 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:41:10,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:41:10,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:41:10,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500955709] [2021-08-27 14:41:10,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500955709] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:41:10,126 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:41:10,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:41:10,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992020304] [2021-08-27 14:41:10,128 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:41:10,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:41:10,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:41:10,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:41:10,133 INFO L87 Difference]: Start difference. First operand 11010 states and 16642 transitions. cyclomatic complexity: 5888 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:10,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:41:10,226 INFO L93 Difference]: Finished difference Result 21762 states and 32514 transitions. [2021-08-27 14:41:10,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:41:10,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21762 states and 32514 transitions. [2021-08-27 14:41:10,338 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2021-08-27 14:41:10,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21762 states to 21762 states and 32514 transitions. [2021-08-27 14:41:10,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21762 [2021-08-27 14:41:10,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21762 [2021-08-27 14:41:10,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21762 states and 32514 transitions. [2021-08-27 14:41:10,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:41:10,524 INFO L681 BuchiCegarLoop]: Abstraction has 21762 states and 32514 transitions. [2021-08-27 14:41:10,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21762 states and 32514 transitions. [2021-08-27 14:41:10,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21762 to 21762. [2021-08-27 14:41:10,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21762 states, 21762 states have (on average 1.4940722360077199) internal successors, (32514), 21761 states have internal predecessors, (32514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:10,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21762 states to 21762 states and 32514 transitions. [2021-08-27 14:41:10,854 INFO L704 BuchiCegarLoop]: Abstraction has 21762 states and 32514 transitions. [2021-08-27 14:41:10,854 INFO L587 BuchiCegarLoop]: Abstraction has 21762 states and 32514 transitions. [2021-08-27 14:41:10,854 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-27 14:41:10,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21762 states and 32514 transitions. [2021-08-27 14:41:10,934 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2021-08-27 14:41:10,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:10,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:10,935 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:10,935 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:10,936 INFO L791 eck$LassoCheckResult]: Stem: 66322#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 66310#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 66311#L225-1 [2021-08-27 14:41:10,936 INFO L793 eck$LassoCheckResult]: Loop: 66311#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 66629#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 66630#L93 assume !(0 != main_~p1~0); 66617#L93-2 assume !(0 != main_~p2~0); 66619#L97-1 assume !(0 != main_~p3~0); 66606#L101-1 assume !(0 != main_~p4~0); 66608#L105-1 assume !(0 != main_~p5~0); 66710#L109-1 assume !(0 != main_~p6~0); 66708#L113-1 assume !(0 != main_~p7~0); 66705#L117-1 assume !(0 != main_~p8~0); 66702#L121-1 assume !(0 != main_~p9~0); 66700#L125-1 assume !(0 != main_~p10~0); 66699#L129-1 assume !(0 != main_~p11~0); 66698#L133-1 assume 0 != main_~p12~0;main_~lk12~0 := 1; 66697#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 66696#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 66694#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 66691#L149-1 assume !(0 != main_~p1~0); 66688#L155-1 assume !(0 != main_~p2~0); 66686#L160-1 assume !(0 != main_~p3~0); 66530#L165-1 assume !(0 != main_~p4~0); 66531#L170-1 assume !(0 != main_~p5~0); 66516#L175-1 assume !(0 != main_~p6~0); 66517#L180-1 assume !(0 != main_~p7~0); 66683#L185-1 assume !(0 != main_~p8~0); 66671#L190-1 assume !(0 != main_~p9~0); 66673#L195-1 assume !(0 != main_~p10~0); 66661#L200-1 assume !(0 != main_~p11~0); 66660#L205-1 assume !(0 != main_~p12~0); 66651#L210-1 assume !(0 != main_~p13~0); 66650#L215-1 assume !(0 != main_~p14~0); 66639#L220-1 assume !(0 != main_~p15~0); 66311#L225-1 [2021-08-27 14:41:10,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:10,936 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2021-08-27 14:41:10,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:10,937 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471050299] [2021-08-27 14:41:10,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:10,937 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:10,942 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:10,948 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:10,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:10,949 INFO L82 PathProgramCache]: Analyzing trace with hash 6342408, now seen corresponding path program 1 times [2021-08-27 14:41:10,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:10,949 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125710439] [2021-08-27 14:41:10,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:10,949 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:41:10,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:41:10,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:41:10,969 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125710439] [2021-08-27 14:41:10,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125710439] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:41:10,969 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:41:10,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:41:10,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144233965] [2021-08-27 14:41:10,970 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:41:10,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:41:10,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:41:10,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:41:10,971 INFO L87 Difference]: Start difference. First operand 21762 states and 32514 transitions. cyclomatic complexity: 11264 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:11,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:41:11,235 INFO L93 Difference]: Finished difference Result 43010 states and 63490 transitions. [2021-08-27 14:41:11,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:41:11,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43010 states and 63490 transitions. [2021-08-27 14:41:11,513 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2021-08-27 14:41:11,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43010 states to 43010 states and 63490 transitions. [2021-08-27 14:41:11,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43010 [2021-08-27 14:41:11,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43010 [2021-08-27 14:41:11,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43010 states and 63490 transitions. [2021-08-27 14:41:11,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:41:11,763 INFO L681 BuchiCegarLoop]: Abstraction has 43010 states and 63490 transitions. [2021-08-27 14:41:11,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43010 states and 63490 transitions. [2021-08-27 14:41:12,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43010 to 43010. [2021-08-27 14:41:12,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43010 states, 43010 states have (on average 1.4761683329458266) internal successors, (63490), 43009 states have internal predecessors, (63490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:12,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43010 states to 43010 states and 63490 transitions. [2021-08-27 14:41:12,345 INFO L704 BuchiCegarLoop]: Abstraction has 43010 states and 63490 transitions. [2021-08-27 14:41:12,346 INFO L587 BuchiCegarLoop]: Abstraction has 43010 states and 63490 transitions. [2021-08-27 14:41:12,346 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-27 14:41:12,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43010 states and 63490 transitions. [2021-08-27 14:41:12,639 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2021-08-27 14:41:12,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:12,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:12,640 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:12,640 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:12,640 INFO L791 eck$LassoCheckResult]: Stem: 131098#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 131087#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 131088#L225-1 [2021-08-27 14:41:12,640 INFO L793 eck$LassoCheckResult]: Loop: 131088#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 131568#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 131565#L93 assume !(0 != main_~p1~0); 131561#L93-2 assume !(0 != main_~p2~0); 131558#L97-1 assume !(0 != main_~p3~0); 131547#L101-1 assume !(0 != main_~p4~0); 131536#L105-1 assume !(0 != main_~p5~0); 131527#L109-1 assume !(0 != main_~p6~0); 131517#L113-1 assume !(0 != main_~p7~0); 131511#L117-1 assume !(0 != main_~p8~0); 131505#L121-1 assume !(0 != main_~p9~0); 131498#L125-1 assume !(0 != main_~p10~0); 131493#L129-1 assume !(0 != main_~p11~0); 131423#L133-1 assume !(0 != main_~p12~0); 131424#L137-1 assume 0 != main_~p13~0;main_~lk13~0 := 1; 131409#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 131410#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 131392#L149-1 assume !(0 != main_~p1~0); 131393#L155-1 assume !(0 != main_~p2~0); 131373#L160-1 assume !(0 != main_~p3~0); 131372#L165-1 assume !(0 != main_~p4~0); 131349#L170-1 assume !(0 != main_~p5~0); 131350#L175-1 assume !(0 != main_~p6~0); 131327#L180-1 assume !(0 != main_~p7~0); 131328#L185-1 assume !(0 != main_~p8~0); 131309#L190-1 assume !(0 != main_~p9~0); 131311#L195-1 assume !(0 != main_~p10~0); 131469#L200-1 assume !(0 != main_~p11~0); 131464#L205-1 assume !(0 != main_~p12~0); 131465#L210-1 assume !(0 != main_~p13~0); 131576#L215-1 assume !(0 != main_~p14~0); 131573#L220-1 assume !(0 != main_~p15~0); 131088#L225-1 [2021-08-27 14:41:12,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:12,641 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2021-08-27 14:41:12,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:12,641 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358615897] [2021-08-27 14:41:12,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:12,641 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:12,645 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:12,649 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:12,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:12,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1682601334, now seen corresponding path program 1 times [2021-08-27 14:41:12,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:12,650 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50008524] [2021-08-27 14:41:12,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:12,650 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:41:12,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:41:12,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:41:12,673 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50008524] [2021-08-27 14:41:12,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50008524] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:41:12,676 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:41:12,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:41:12,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062265967] [2021-08-27 14:41:12,677 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:41:12,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:41:12,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:41:12,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:41:12,678 INFO L87 Difference]: Start difference. First operand 43010 states and 63490 transitions. cyclomatic complexity: 21504 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:13,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:41:13,023 INFO L93 Difference]: Finished difference Result 84994 states and 123906 transitions. [2021-08-27 14:41:13,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:41:13,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84994 states and 123906 transitions. [2021-08-27 14:41:13,336 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2021-08-27 14:41:13,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84994 states to 84994 states and 123906 transitions. [2021-08-27 14:41:13,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84994 [2021-08-27 14:41:13,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84994 [2021-08-27 14:41:13,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84994 states and 123906 transitions. [2021-08-27 14:41:13,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:41:13,925 INFO L681 BuchiCegarLoop]: Abstraction has 84994 states and 123906 transitions. [2021-08-27 14:41:14,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84994 states and 123906 transitions. [2021-08-27 14:41:14,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84994 to 84994. [2021-08-27 14:41:14,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84994 states, 84994 states have (on average 1.4578205520389675) internal successors, (123906), 84993 states have internal predecessors, (123906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:14,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84994 states to 84994 states and 123906 transitions. [2021-08-27 14:41:14,903 INFO L704 BuchiCegarLoop]: Abstraction has 84994 states and 123906 transitions. [2021-08-27 14:41:14,903 INFO L587 BuchiCegarLoop]: Abstraction has 84994 states and 123906 transitions. [2021-08-27 14:41:14,903 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-27 14:41:14,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84994 states and 123906 transitions. [2021-08-27 14:41:15,335 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2021-08-27 14:41:15,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:15,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:15,336 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:15,336 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:15,336 INFO L791 eck$LassoCheckResult]: Stem: 259116#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 259105#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 259106#L225-1 [2021-08-27 14:41:15,336 INFO L793 eck$LassoCheckResult]: Loop: 259106#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 260093#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 260071#L93 assume !(0 != main_~p1~0); 260073#L93-2 assume !(0 != main_~p2~0); 260053#L97-1 assume !(0 != main_~p3~0); 260054#L101-1 assume !(0 != main_~p4~0); 260027#L105-1 assume !(0 != main_~p5~0); 260029#L109-1 assume !(0 != main_~p6~0); 260313#L113-1 assume !(0 != main_~p7~0); 260283#L117-1 assume !(0 != main_~p8~0); 260285#L121-1 assume !(0 != main_~p9~0); 260309#L125-1 assume !(0 != main_~p10~0); 260308#L129-1 assume !(0 != main_~p11~0); 260306#L133-1 assume !(0 != main_~p12~0); 260304#L137-1 assume !(0 != main_~p13~0); 260302#L141-1 assume 0 != main_~p14~0;main_~lk14~0 := 1; 260300#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 260297#L149-1 assume !(0 != main_~p1~0); 260293#L155-1 assume !(0 != main_~p2~0); 260290#L160-1 assume !(0 != main_~p3~0); 260225#L165-1 assume !(0 != main_~p4~0); 260226#L170-1 assume !(0 != main_~p5~0); 260202#L175-1 assume !(0 != main_~p6~0); 260204#L180-1 assume !(0 != main_~p7~0); 260181#L185-1 assume !(0 != main_~p8~0); 260182#L190-1 assume !(0 != main_~p9~0); 260176#L195-1 assume !(0 != main_~p10~0); 260178#L200-1 assume !(0 != main_~p11~0); 260125#L205-1 assume !(0 != main_~p12~0); 260127#L210-1 assume !(0 != main_~p13~0); 260112#L215-1 assume !(0 != main_~p14~0); 260111#L220-1 assume !(0 != main_~p15~0); 259106#L225-1 [2021-08-27 14:41:15,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:15,337 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2021-08-27 14:41:15,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:15,337 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927097252] [2021-08-27 14:41:15,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:15,337 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:15,342 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:15,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:15,347 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:15,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:15,348 INFO L82 PathProgramCache]: Analyzing trace with hash 618221256, now seen corresponding path program 1 times [2021-08-27 14:41:15,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:15,348 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741997483] [2021-08-27 14:41:15,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:15,348 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:41:15,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:41:15,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:41:15,364 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741997483] [2021-08-27 14:41:15,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741997483] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:41:15,364 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:41:15,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:41:15,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218000660] [2021-08-27 14:41:15,365 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:41:15,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:41:15,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:41:15,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:41:15,366 INFO L87 Difference]: Start difference. First operand 84994 states and 123906 transitions. cyclomatic complexity: 40960 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:16,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:41:16,006 INFO L93 Difference]: Finished difference Result 167938 states and 241666 transitions. [2021-08-27 14:41:16,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:41:16,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167938 states and 241666 transitions. [2021-08-27 14:41:16,545 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 167936 [2021-08-27 14:41:17,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167938 states to 167938 states and 241666 transitions. [2021-08-27 14:41:17,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167938 [2021-08-27 14:41:17,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167938 [2021-08-27 14:41:17,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167938 states and 241666 transitions. [2021-08-27 14:41:17,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:41:17,304 INFO L681 BuchiCegarLoop]: Abstraction has 167938 states and 241666 transitions. [2021-08-27 14:41:17,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167938 states and 241666 transitions. [2021-08-27 14:41:18,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167938 to 167938. [2021-08-27 14:41:18,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167938 states, 167938 states have (on average 1.4390191618335337) internal successors, (241666), 167937 states have internal predecessors, (241666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:19,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167938 states to 167938 states and 241666 transitions. [2021-08-27 14:41:19,226 INFO L704 BuchiCegarLoop]: Abstraction has 167938 states and 241666 transitions. [2021-08-27 14:41:19,227 INFO L587 BuchiCegarLoop]: Abstraction has 167938 states and 241666 transitions. [2021-08-27 14:41:19,227 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-08-27 14:41:19,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167938 states and 241666 transitions. [2021-08-27 14:41:20,232 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 167936 [2021-08-27 14:41:20,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:20,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:20,234 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:20,234 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:20,234 INFO L791 eck$LassoCheckResult]: Stem: 512052#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 512037#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 512038#L225-1 [2021-08-27 14:41:20,234 INFO L793 eck$LassoCheckResult]: Loop: 512038#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 512371#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 512369#L93 assume !(0 != main_~p1~0); 512367#L93-2 assume !(0 != main_~p2~0); 512366#L97-1 assume !(0 != main_~p3~0); 512364#L101-1 assume !(0 != main_~p4~0); 512362#L105-1 assume !(0 != main_~p5~0); 512360#L109-1 assume !(0 != main_~p6~0); 512358#L113-1 assume !(0 != main_~p7~0); 512356#L117-1 assume !(0 != main_~p8~0); 512354#L121-1 assume !(0 != main_~p9~0); 512352#L125-1 assume !(0 != main_~p10~0); 512351#L129-1 assume !(0 != main_~p11~0); 512349#L133-1 assume !(0 != main_~p12~0); 512345#L137-1 assume !(0 != main_~p13~0); 512343#L141-1 assume !(0 != main_~p14~0); 512340#L145-1 assume 0 != main_~p15~0;main_~lk15~0 := 1; 512336#L149-1 assume !(0 != main_~p1~0); 512330#L155-1 assume !(0 != main_~p2~0); 512325#L160-1 assume !(0 != main_~p3~0); 512318#L165-1 assume !(0 != main_~p4~0); 512312#L170-1 assume !(0 != main_~p5~0); 512306#L175-1 assume !(0 != main_~p6~0); 512300#L180-1 assume !(0 != main_~p7~0); 512294#L185-1 assume !(0 != main_~p8~0); 512288#L190-1 assume !(0 != main_~p9~0); 512282#L195-1 assume !(0 != main_~p10~0); 512277#L200-1 assume !(0 != main_~p11~0); 512270#L205-1 assume !(0 != main_~p12~0); 512261#L210-1 assume !(0 != main_~p13~0); 512262#L215-1 assume !(0 != main_~p14~0); 512373#L220-1 assume !(0 != main_~p15~0); 512038#L225-1 [2021-08-27 14:41:20,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:20,235 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 13 times [2021-08-27 14:41:20,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:20,235 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273326520] [2021-08-27 14:41:20,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:20,235 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:20,239 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:20,244 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:20,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:20,245 INFO L82 PathProgramCache]: Analyzing trace with hash -970126646, now seen corresponding path program 1 times [2021-08-27 14:41:20,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:20,245 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364183127] [2021-08-27 14:41:20,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:20,245 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:41:20,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:41:20,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:41:20,258 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364183127] [2021-08-27 14:41:20,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364183127] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:41:20,258 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:41:20,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 14:41:20,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578654264] [2021-08-27 14:41:20,259 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:41:20,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:41:20,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:41:20,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:41:20,260 INFO L87 Difference]: Start difference. First operand 167938 states and 241666 transitions. cyclomatic complexity: 77824 Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:21,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:41:21,593 INFO L93 Difference]: Finished difference Result 331778 states and 471042 transitions. [2021-08-27 14:41:21,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:41:21,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 331778 states and 471042 transitions. [2021-08-27 14:41:23,253 INFO L131 ngComponentsAnalysis]: Automaton has 8192 accepting balls. 331776 [2021-08-27 14:41:24,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 331778 states to 331778 states and 471042 transitions. [2021-08-27 14:41:24,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 331778 [2021-08-27 14:41:24,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 331778 [2021-08-27 14:41:24,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 331778 states and 471042 transitions. [2021-08-27 14:41:24,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:41:24,365 INFO L681 BuchiCegarLoop]: Abstraction has 331778 states and 471042 transitions. [2021-08-27 14:41:24,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331778 states and 471042 transitions. [2021-08-27 14:41:27,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331778 to 331778. [2021-08-27 14:41:27,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331778 states, 331778 states have (on average 1.419750556094738) internal successors, (471042), 331777 states have internal predecessors, (471042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:41:28,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331778 states to 331778 states and 471042 transitions. [2021-08-27 14:41:28,399 INFO L704 BuchiCegarLoop]: Abstraction has 331778 states and 471042 transitions. [2021-08-27 14:41:28,399 INFO L587 BuchiCegarLoop]: Abstraction has 331778 states and 471042 transitions. [2021-08-27 14:41:28,400 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-08-27 14:41:28,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 331778 states and 471042 transitions. [2021-08-27 14:41:30,084 INFO L131 ngComponentsAnalysis]: Automaton has 8192 accepting balls. 331776 [2021-08-27 14:41:30,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:41:30,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:41:30,087 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:41:30,087 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:41:30,088 INFO L791 eck$LassoCheckResult]: Stem: 1011773#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1011759#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_~p1~0, main_~lk1~0, main_~p2~0, main_~lk2~0, main_~p3~0, main_~lk3~0, main_~p4~0, main_~lk4~0, main_~p5~0, main_~lk5~0, main_~p6~0, main_~lk6~0, main_~p7~0, main_~lk7~0, main_~p8~0, main_~lk8~0, main_~p9~0, main_~lk9~0, main_~p10~0, main_~lk10~0, main_~p11~0, main_~lk11~0, main_~p12~0, main_~lk12~0, main_~p13~0, main_~lk13~0, main_~p14~0, main_~lk14~0, main_~p15~0, main_~lk15~0, main_~cond~0;main_~p1~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~lk1~0;main_~p2~0 := main_#t~nondet8;havoc main_#t~nondet8;havoc main_~lk2~0;main_~p3~0 := main_#t~nondet9;havoc main_#t~nondet9;havoc main_~lk3~0;main_~p4~0 := main_#t~nondet10;havoc main_#t~nondet10;havoc main_~lk4~0;main_~p5~0 := main_#t~nondet11;havoc main_#t~nondet11;havoc main_~lk5~0;main_~p6~0 := main_#t~nondet12;havoc main_#t~nondet12;havoc main_~lk6~0;main_~p7~0 := main_#t~nondet13;havoc main_#t~nondet13;havoc main_~lk7~0;main_~p8~0 := main_#t~nondet14;havoc main_#t~nondet14;havoc main_~lk8~0;main_~p9~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc main_~lk9~0;main_~p10~0 := main_#t~nondet16;havoc main_#t~nondet16;havoc main_~lk10~0;main_~p11~0 := main_#t~nondet17;havoc main_#t~nondet17;havoc main_~lk11~0;main_~p12~0 := main_#t~nondet18;havoc main_#t~nondet18;havoc main_~lk12~0;main_~p13~0 := main_#t~nondet19;havoc main_#t~nondet19;havoc main_~lk13~0;main_~p14~0 := main_#t~nondet20;havoc main_#t~nondet20;havoc main_~lk14~0;main_~p15~0 := main_#t~nondet21;havoc main_#t~nondet21;havoc main_~lk15~0;havoc main_~cond~0; 1011760#L225-1 [2021-08-27 14:41:30,088 INFO L793 eck$LassoCheckResult]: Loop: 1011760#L225-1 assume !false;main_~cond~0 := main_#t~nondet22;havoc main_#t~nondet22; 1012553#L58 assume !(0 == main_~cond~0);main_~lk1~0 := 0;main_~lk2~0 := 0;main_~lk3~0 := 0;main_~lk4~0 := 0;main_~lk5~0 := 0;main_~lk6~0 := 0;main_~lk7~0 := 0;main_~lk8~0 := 0;main_~lk9~0 := 0;main_~lk10~0 := 0;main_~lk11~0 := 0;main_~lk12~0 := 0;main_~lk13~0 := 0;main_~lk14~0 := 0;main_~lk15~0 := 0; 1012551#L93 assume !(0 != main_~p1~0); 1012549#L93-2 assume !(0 != main_~p2~0); 1012548#L97-1 assume !(0 != main_~p3~0); 1012546#L101-1 assume !(0 != main_~p4~0); 1012544#L105-1 assume !(0 != main_~p5~0); 1012545#L109-1 assume !(0 != main_~p6~0); 1012707#L113-1 assume !(0 != main_~p7~0); 1012702#L117-1 assume !(0 != main_~p8~0); 1012697#L121-1 assume !(0 != main_~p9~0); 1012691#L125-1 assume !(0 != main_~p10~0); 1012687#L129-1 assume !(0 != main_~p11~0); 1012683#L133-1 assume !(0 != main_~p12~0); 1012678#L137-1 assume !(0 != main_~p13~0); 1012674#L141-1 assume !(0 != main_~p14~0); 1012668#L145-1 assume !(0 != main_~p15~0); 1012661#L149-1 assume !(0 != main_~p1~0); 1012653#L155-1 assume !(0 != main_~p2~0); 1012642#L160-1 assume !(0 != main_~p3~0); 1012638#L165-1 assume !(0 != main_~p4~0); 1012636#L170-1 assume !(0 != main_~p5~0); 1012632#L175-1 assume !(0 != main_~p6~0); 1012628#L180-1 assume !(0 != main_~p7~0); 1012624#L185-1 assume !(0 != main_~p8~0); 1012620#L190-1 assume !(0 != main_~p9~0); 1012616#L195-1 assume !(0 != main_~p10~0); 1012570#L200-1 assume !(0 != main_~p11~0); 1012560#L205-1 assume !(0 != main_~p12~0); 1012558#L210-1 assume !(0 != main_~p13~0); 1012556#L215-1 assume !(0 != main_~p14~0); 1012554#L220-1 assume !(0 != main_~p15~0); 1011760#L225-1 [2021-08-27 14:41:30,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:30,088 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 14 times [2021-08-27 14:41:30,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:30,089 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158620630] [2021-08-27 14:41:30,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:30,089 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:30,093 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:30,098 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:30,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:30,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1991195000, now seen corresponding path program 1 times [2021-08-27 14:41:30,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:30,099 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802156912] [2021-08-27 14:41:30,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:30,099 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:30,102 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:30,108 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:30,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:41:30,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1845576266, now seen corresponding path program 1 times [2021-08-27 14:41:30,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:41:30,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127497597] [2021-08-27 14:41:30,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:41:30,109 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:41:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:30,117 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:41:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:41:30,127 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:41:30,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 02:41:30 BoogieIcfgContainer [2021-08-27 14:41:30,890 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 14:41:30,891 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 14:41:30,891 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 14:41:30,891 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 14:41:30,891 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:41:07" (3/4) ... [2021-08-27 14:41:30,894 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-08-27 14:41:30,937 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 14:41:30,937 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 14:41:30,939 INFO L168 Benchmark]: Toolchain (without parser) took 24202.28 ms. Allocated memory was 60.8 MB in the beginning and 13.8 GB in the end (delta: 13.7 GB). Free memory was 41.3 MB in the beginning and 10.6 GB in the end (delta: -10.6 GB). Peak memory consumption was 3.1 GB. Max. memory is 16.1 GB. [2021-08-27 14:41:30,939 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 60.8 MB. Free memory was 42.1 MB in the beginning and 42.1 MB in the end (delta: 84.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:41:30,940 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.01 ms. Allocated memory is still 60.8 MB. Free memory was 41.2 MB in the beginning and 42.6 MB in the end (delta: -1.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 14:41:30,940 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.98 ms. Allocated memory is still 60.8 MB. Free memory was 42.4 MB in the beginning and 40.7 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:41:30,940 INFO L168 Benchmark]: Boogie Preprocessor took 46.26 ms. Allocated memory is still 60.8 MB. Free memory was 40.7 MB in the beginning and 39.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 14:41:30,941 INFO L168 Benchmark]: RCFGBuilder took 494.99 ms. Allocated memory is still 60.8 MB. Free memory was 39.3 MB in the beginning and 30.7 MB in the end (delta: 8.6 MB). Peak memory consumption was 16.3 MB. Max. memory is 16.1 GB. [2021-08-27 14:41:30,941 INFO L168 Benchmark]: BuchiAutomizer took 23281.48 ms. Allocated memory was 60.8 MB in the beginning and 13.8 GB in the end (delta: 13.7 GB). Free memory was 30.4 MB in the beginning and 10.6 GB in the end (delta: -10.6 GB). Peak memory consumption was 3.1 GB. Max. memory is 16.1 GB. [2021-08-27 14:41:30,941 INFO L168 Benchmark]: Witness Printer took 47.06 ms. Allocated memory is still 13.8 GB. Free memory was 10.6 GB in the beginning and 10.6 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 14:41:30,943 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 60.8 MB. Free memory was 42.1 MB in the beginning and 42.1 MB in the end (delta: 84.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 266.01 ms. Allocated memory is still 60.8 MB. Free memory was 41.2 MB in the beginning and 42.6 MB in the end (delta: -1.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 59.98 ms. Allocated memory is still 60.8 MB. Free memory was 42.4 MB in the beginning and 40.7 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 46.26 ms. Allocated memory is still 60.8 MB. Free memory was 40.7 MB in the beginning and 39.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 494.99 ms. Allocated memory is still 60.8 MB. Free memory was 39.3 MB in the beginning and 30.7 MB in the end (delta: 8.6 MB). Peak memory consumption was 16.3 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 23281.48 ms. Allocated memory was 60.8 MB in the beginning and 13.8 GB in the end (delta: 13.7 GB). Free memory was 30.4 MB in the beginning and 10.6 GB in the end (delta: -10.6 GB). Peak memory consumption was 3.1 GB. Max. memory is 16.1 GB. * Witness Printer took 47.06 ms. Allocated memory is still 13.8 GB. Free memory was 10.6 GB in the beginning and 10.6 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (13 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.13 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 331778 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 23.2s and 14 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.1s. Büchi inclusion checks took 2.8s. Highest rank in rank-based complementation 0. Minimization of det autom 13. Minimization of nondet autom 0. Automata minimization 8589.5ms AutomataMinimizationTime, 13 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 5.4s Buchi closure took 0.3s. Biggest automaton had 331778 states and ocurred in iteration 13. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1530 SDtfs, 799 SDslu, 967 SDs, 0 SdLazy, 65 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 133.9ms Time LassoAnalysisResults: nont1 unkn0 SFLI13 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 56]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=24847} State at position 1 is {NULL=0, p1=0, p3=0, p5=0, NULL=24847, p10=0, p7=0, p9=0, lk12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@45c56bcf=0, lk14=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5857a35f=0, p14=0, lk10=0, p12=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ff4df41=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5c9a11b5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4d83a075=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@79cf90ea=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@16b2867f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@62aa2e8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@685f2af1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@df721fe=0, NULL=0, NULL=0, lk3=0, lk5=0, NULL=0, lk1=0, lk7=0, lk9=0, NULL=24850, \result=0, p2=0, p4=0, p6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1e3067f7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7946fdaf=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6e3fd6ef=0, lk13=0, p15=0, lk15=0, p13=0, p11=0, lk11=0, cond=10, NULL=24849, NULL=0, NULL=24848, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@50e84645=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5cf3e254=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ca361b7=10, lk6=0, lk2=0, lk8=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 56]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; Loop: [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 [L93] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L101] COND FALSE !(p3 != 0) [L105] COND FALSE !(p4 != 0) [L109] COND FALSE !(p5 != 0) [L113] COND FALSE !(p6 != 0) [L117] COND FALSE !(p7 != 0) [L121] COND FALSE !(p8 != 0) [L125] COND FALSE !(p9 != 0) [L129] COND FALSE !(p10 != 0) [L133] COND FALSE !(p11 != 0) [L137] COND FALSE !(p12 != 0) [L141] COND FALSE !(p13 != 0) [L145] COND FALSE !(p14 != 0) [L149] COND FALSE !(p15 != 0) [L155] COND FALSE !(p1 != 0) [L160] COND FALSE !(p2 != 0) [L165] COND FALSE !(p3 != 0) [L170] COND FALSE !(p4 != 0) [L175] COND FALSE !(p5 != 0) [L180] COND FALSE !(p6 != 0) [L185] COND FALSE !(p7 != 0) [L190] COND FALSE !(p8 != 0) [L195] COND FALSE !(p9 != 0) [L200] COND FALSE !(p10 != 0) [L205] COND FALSE !(p11 != 0) [L210] COND FALSE !(p12 != 0) [L215] COND FALSE !(p13 != 0) [L220] COND FALSE !(p14 != 0) [L225] COND FALSE !(p15 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-08-27 14:41:31,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...