./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_14-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c 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_14-1.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 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 03:29:48,555 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 03:29:48,558 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 03:29:48,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 03:29:48,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 03:29:48,603 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 03:29:48,605 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 03:29:48,608 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 03:29:48,610 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 03:29:48,611 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 03:29:48,612 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 03:29:48,613 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 03:29:48,613 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 03:29:48,614 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 03:29:48,615 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 03:29:48,616 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 03:29:48,617 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 03:29:48,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 03:29:48,619 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 03:29:48,620 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 03:29:48,622 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 03:29:48,623 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 03:29:48,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 03:29:48,624 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 03:29:48,625 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 03:29:48,628 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 03:29:48,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 03:29:48,628 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 03:29:48,629 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 03:29:48,630 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 03:29:48,630 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 03:29:48,631 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 03:29:48,631 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 03:29:48,632 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 03:29:48,633 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 03:29:48,633 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 03:29:48,634 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 03:29:48,634 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 03:29:48,634 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 03:29:48,634 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 03:29:48,635 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 03:29:48,636 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 03:29:48,637 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 03:29:48,653 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 03:29:48,654 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 03:29:48,654 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 03:29:48,654 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 03:29:48,655 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 03:29:48,655 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 03:29:48,655 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 03:29:48,656 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 03:29:48,656 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 03:29:48,656 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 03:29:48,656 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 03:29:48,656 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 03:29:48,657 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 03:29:48,657 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 03:29:48,657 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 03:29:48,657 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 03:29:48,657 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 03:29:48,657 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 03:29:48,658 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 03:29:48,658 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 03:29:48,658 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 03:29:48,658 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 03:29:48,658 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 03:29:48,659 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 03:29:48,659 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 03:29:48,659 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 03:29:48,659 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 03:29:48,659 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 03:29:48,660 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 03:29:48,660 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 03:29:48,660 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 03:29:48,661 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 03:29:48,661 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 -> 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd [2022-07-13 03:29:48,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 03:29:48,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 03:29:48,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 03:29:48,906 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 03:29:48,908 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 03:29:48,909 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_14-1.c [2022-07-13 03:29:48,977 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dabc752b/497f2a1f046d4252b46692bec9b19100/FLAG9ab1a1103 [2022-07-13 03:29:49,445 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 03:29:49,447 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-1.c [2022-07-13 03:29:49,456 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dabc752b/497f2a1f046d4252b46692bec9b19100/FLAG9ab1a1103 [2022-07-13 03:29:49,481 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dabc752b/497f2a1f046d4252b46692bec9b19100 [2022-07-13 03:29:49,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 03:29:49,486 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 03:29:49,487 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 03:29:49,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 03:29:49,490 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 03:29:49,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:29:49" (1/1) ... [2022-07-13 03:29:49,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@533e31b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:49, skipping insertion in model container [2022-07-13 03:29:49,492 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:29:49" (1/1) ... [2022-07-13 03:29:49,498 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 03:29:49,522 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 03:29:49,677 WARN L230 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_14-1.c[5283,5296] [2022-07-13 03:29:49,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:29:49,687 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 03:29:49,709 WARN L230 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_14-1.c[5283,5296] [2022-07-13 03:29:49,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:29:49,720 INFO L208 MainTranslator]: Completed translation [2022-07-13 03:29:49,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:49 WrapperNode [2022-07-13 03:29:49,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 03:29:49,722 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 03:29:49,722 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 03:29:49,722 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 03:29:49,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:49" (1/1) ... [2022-07-13 03:29:49,734 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:49" (1/1) ... [2022-07-13 03:29:49,755 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 167 [2022-07-13 03:29:49,755 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 03:29:49,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 03:29:49,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 03:29:49,756 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 03:29:49,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:49" (1/1) ... [2022-07-13 03:29:49,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:49" (1/1) ... [2022-07-13 03:29:49,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:49" (1/1) ... [2022-07-13 03:29:49,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:49" (1/1) ... [2022-07-13 03:29:49,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:49" (1/1) ... [2022-07-13 03:29:49,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:49" (1/1) ... [2022-07-13 03:29:49,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:49" (1/1) ... [2022-07-13 03:29:49,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 03:29:49,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 03:29:49,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 03:29:49,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 03:29:49,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:49" (1/1) ... [2022-07-13 03:29:49,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:29:49,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:29:49,809 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) [2022-07-13 03:29:49,821 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 [2022-07-13 03:29:49,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 03:29:49,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 03:29:49,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 03:29:49,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 03:29:49,901 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 03:29:49,902 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 03:29:50,062 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 03:29:50,068 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 03:29:50,069 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 03:29:50,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:29:50 BoogieIcfgContainer [2022-07-13 03:29:50,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 03:29:50,072 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 03:29:50,072 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 03:29:50,075 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 03:29:50,076 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:29:50,077 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 03:29:49" (1/3) ... [2022-07-13 03:29:50,078 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4426a0fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:29:50, skipping insertion in model container [2022-07-13 03:29:50,078 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:29:50,078 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:49" (2/3) ... [2022-07-13 03:29:50,078 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4426a0fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:29:50, skipping insertion in model container [2022-07-13 03:29:50,078 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:29:50,078 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:29:50" (3/3) ... [2022-07-13 03:29:50,080 INFO L354 chiAutomizerObserver]: Analyzing ICFG test_locks_14-1.c [2022-07-13 03:29:50,126 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 03:29:50,126 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 03:29:50,127 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 03:29:50,127 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 03:29:50,127 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 03:29:50,127 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 03:29:50,127 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 03:29:50,127 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 03:29:50,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 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) [2022-07-13 03:29:50,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2022-07-13 03:29:50,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:50,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:50,158 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:50,159 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-13 03:29:50,159 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 03:29:50,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 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) [2022-07-13 03:29:50,171 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2022-07-13 03:29:50,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:50,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:50,173 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:50,187 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-13 03:29:50,193 INFO L752 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 34#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 36#L211-1true [2022-07-13 03:29:50,202 INFO L754 eck$LassoCheckResult]: Loop: 36#L211-1true assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 45#L55true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 21#L88true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 11#L88-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 32#L92-1true assume !(0 != main_~p3~0#1); 3#L96-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 6#L100-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 48#L104-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 12#L108-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 51#L112-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 25#L116-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 39#L120-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 33#L124-1true assume !(0 != main_~p11~0#1); 15#L128-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 46#L132-1true assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 42#L136-1true assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 38#L140-1true assume !(0 != main_~p1~0#1); 16#L146-1true assume !(0 != main_~p2~0#1); 30#L151-1true assume !(0 != main_~p3~0#1); 28#L156-1true assume !(0 != main_~p4~0#1); 4#L161-1true assume !(0 != main_~p5~0#1); 10#L166-1true assume !(0 != main_~p6~0#1); 23#L171-1true assume !(0 != main_~p7~0#1); 19#L176-1true assume !(0 != main_~p8~0#1); 49#L181-1true assume !(0 != main_~p9~0#1); 20#L186-1true assume !(0 != main_~p10~0#1); 37#L191-1true assume !(0 != main_~p11~0#1); 50#L196-1true assume !(0 != main_~p12~0#1); 24#L201-1true assume !(0 != main_~p13~0#1); 13#L206-1true assume !(0 != main_~p14~0#1); 36#L211-1true [2022-07-13 03:29:50,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:50,209 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-13 03:29:50,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:50,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743574676] [2022-07-13 03:29:50,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:50,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:50,290 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:50,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:50,317 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:50,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:50,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1221430905, now seen corresponding path program 1 times [2022-07-13 03:29:50,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:50,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366054321] [2022-07-13 03:29:50,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:50,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:50,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:50,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:50,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366054321] [2022-07-13 03:29:50,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366054321] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:50,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:50,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:50,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437821242] [2022-07-13 03:29:50,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:50,503 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:50,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:50,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:50,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:50,530 INFO L87 Difference]: Start difference. First operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 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.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2022-07-13 03:29:50,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:50,575 INFO L93 Difference]: Finished difference Result 99 states and 178 transitions. [2022-07-13 03:29:50,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:50,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 178 transitions. [2022-07-13 03:29:50,586 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2022-07-13 03:29:50,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 89 states and 143 transitions. [2022-07-13 03:29:50,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2022-07-13 03:29:50,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2022-07-13 03:29:50,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 143 transitions. [2022-07-13 03:29:50,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:50,594 INFO L369 hiAutomatonCegarLoop]: Abstraction has 89 states and 143 transitions. [2022-07-13 03:29:50,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 143 transitions. [2022-07-13 03:29:50,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-07-13 03:29:50,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.6067415730337078) internal successors, (143), 88 states have internal predecessors, (143), 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) [2022-07-13 03:29:50,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 143 transitions. [2022-07-13 03:29:50,623 INFO L392 hiAutomatonCegarLoop]: Abstraction has 89 states and 143 transitions. [2022-07-13 03:29:50,623 INFO L374 stractBuchiCegarLoop]: Abstraction has 89 states and 143 transitions. [2022-07-13 03:29:50,624 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 03:29:50,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 143 transitions. [2022-07-13 03:29:50,626 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2022-07-13 03:29:50,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:50,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:50,627 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:50,627 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-13 03:29:50,628 INFO L752 eck$LassoCheckResult]: Stem: 190#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 174#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 168#L211-1 [2022-07-13 03:29:50,628 INFO L754 eck$LassoCheckResult]: Loop: 168#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 179#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 202#L88 assume !(0 != main_~p1~0#1); 221#L88-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 220#L92-1 assume !(0 != main_~p3~0#1); 219#L96-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 218#L100-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 208#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 185#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 186#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 205#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 183#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 172#L124-1 assume !(0 != main_~p11~0#1); 173#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 192#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 213#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 211#L140-1 assume !(0 != main_~p1~0#1); 212#L146-1 assume !(0 != main_~p2~0#1); 246#L151-1 assume !(0 != main_~p3~0#1); 244#L156-1 assume !(0 != main_~p4~0#1); 242#L161-1 assume !(0 != main_~p5~0#1); 240#L166-1 assume !(0 != main_~p6~0#1); 237#L171-1 assume !(0 != main_~p7~0#1); 236#L176-1 assume !(0 != main_~p8~0#1); 207#L181-1 assume !(0 != main_~p9~0#1); 194#L186-1 assume !(0 != main_~p10~0#1); 180#L191-1 assume !(0 != main_~p11~0#1); 176#L196-1 assume !(0 != main_~p12~0#1); 189#L201-1 assume !(0 != main_~p13~0#1); 166#L206-1 assume !(0 != main_~p14~0#1); 168#L211-1 [2022-07-13 03:29:50,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:50,629 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-13 03:29:50,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:50,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544573789] [2022-07-13 03:29:50,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:50,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:50,637 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:50,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:50,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:50,648 INFO L85 PathProgramCache]: Analyzing trace with hash 711957815, now seen corresponding path program 1 times [2022-07-13 03:29:50,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:50,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481685815] [2022-07-13 03:29:50,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:50,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:50,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:50,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:50,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481685815] [2022-07-13 03:29:50,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481685815] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:50,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:50,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:50,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569774576] [2022-07-13 03:29:50,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:50,728 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:50,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:50,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:50,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:50,729 INFO L87 Difference]: Start difference. First operand 89 states and 143 transitions. cyclomatic complexity: 56 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2022-07-13 03:29:50,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:50,763 INFO L93 Difference]: Finished difference Result 174 states and 278 transitions. [2022-07-13 03:29:50,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:50,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 174 states and 278 transitions. [2022-07-13 03:29:50,769 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2022-07-13 03:29:50,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 174 states to 174 states and 278 transitions. [2022-07-13 03:29:50,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 174 [2022-07-13 03:29:50,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 174 [2022-07-13 03:29:50,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 278 transitions. [2022-07-13 03:29:50,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:50,784 INFO L369 hiAutomatonCegarLoop]: Abstraction has 174 states and 278 transitions. [2022-07-13 03:29:50,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 278 transitions. [2022-07-13 03:29:50,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-07-13 03:29:50,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.5977011494252873) internal successors, (278), 173 states have internal predecessors, (278), 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) [2022-07-13 03:29:50,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 278 transitions. [2022-07-13 03:29:50,799 INFO L392 hiAutomatonCegarLoop]: Abstraction has 174 states and 278 transitions. [2022-07-13 03:29:50,800 INFO L374 stractBuchiCegarLoop]: Abstraction has 174 states and 278 transitions. [2022-07-13 03:29:50,800 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 03:29:50,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 278 transitions. [2022-07-13 03:29:50,803 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 172 [2022-07-13 03:29:50,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:50,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:50,804 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:50,806 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-13 03:29:50,807 INFO L752 eck$LassoCheckResult]: Stem: 465#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 444#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 445#L211-1 [2022-07-13 03:29:50,807 INFO L754 eck$LassoCheckResult]: Loop: 445#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 527#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 525#L88 assume !(0 != main_~p1~0#1); 522#L88-2 assume !(0 != main_~p2~0#1); 517#L92-1 assume !(0 != main_~p3~0#1); 516#L96-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 514#L100-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 512#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 511#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 510#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 509#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 508#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 507#L124-1 assume !(0 != main_~p11~0#1); 506#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 505#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 489#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 490#L140-1 assume !(0 != main_~p1~0#1); 499#L146-1 assume !(0 != main_~p2~0#1); 501#L151-1 assume !(0 != main_~p3~0#1); 550#L156-1 assume !(0 != main_~p4~0#1); 548#L161-1 assume !(0 != main_~p5~0#1); 546#L166-1 assume !(0 != main_~p6~0#1); 543#L171-1 assume !(0 != main_~p7~0#1); 542#L176-1 assume !(0 != main_~p8~0#1); 540#L181-1 assume !(0 != main_~p9~0#1); 537#L186-1 assume !(0 != main_~p10~0#1); 536#L191-1 assume !(0 != main_~p11~0#1); 534#L196-1 assume !(0 != main_~p12~0#1); 532#L201-1 assume !(0 != main_~p13~0#1); 530#L206-1 assume !(0 != main_~p14~0#1); 445#L211-1 [2022-07-13 03:29:50,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:50,808 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-07-13 03:29:50,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:50,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550868283] [2022-07-13 03:29:50,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:50,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:50,821 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:50,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:50,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:50,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1659781447, now seen corresponding path program 1 times [2022-07-13 03:29:50,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:50,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118496403] [2022-07-13 03:29:50,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:50,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:50,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:50,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:50,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118496403] [2022-07-13 03:29:50,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118496403] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:50,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:50,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:50,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369995356] [2022-07-13 03:29:50,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:50,896 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:50,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:50,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:50,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:50,898 INFO L87 Difference]: Start difference. First operand 174 states and 278 transitions. cyclomatic complexity: 108 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2022-07-13 03:29:50,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:50,932 INFO L93 Difference]: Finished difference Result 342 states and 542 transitions. [2022-07-13 03:29:50,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:50,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 342 states and 542 transitions. [2022-07-13 03:29:50,937 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2022-07-13 03:29:50,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 342 states to 342 states and 542 transitions. [2022-07-13 03:29:50,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 342 [2022-07-13 03:29:50,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 342 [2022-07-13 03:29:50,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 342 states and 542 transitions. [2022-07-13 03:29:50,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:50,943 INFO L369 hiAutomatonCegarLoop]: Abstraction has 342 states and 542 transitions. [2022-07-13 03:29:50,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states and 542 transitions. [2022-07-13 03:29:50,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2022-07-13 03:29:50,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 342 states have (on average 1.5847953216374269) internal successors, (542), 341 states have internal predecessors, (542), 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) [2022-07-13 03:29:50,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 542 transitions. [2022-07-13 03:29:50,971 INFO L392 hiAutomatonCegarLoop]: Abstraction has 342 states and 542 transitions. [2022-07-13 03:29:50,971 INFO L374 stractBuchiCegarLoop]: Abstraction has 342 states and 542 transitions. [2022-07-13 03:29:50,972 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 03:29:50,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 342 states and 542 transitions. [2022-07-13 03:29:50,974 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 340 [2022-07-13 03:29:50,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:50,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:50,975 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:50,975 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-13 03:29:50,976 INFO L752 eck$LassoCheckResult]: Stem: 983#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 967#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 968#L211-1 [2022-07-13 03:29:50,976 INFO L754 eck$LassoCheckResult]: Loop: 968#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 1027#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 1022#L88 assume !(0 != main_~p1~0#1); 1023#L88-2 assume !(0 != main_~p2~0#1); 1152#L92-1 assume !(0 != main_~p3~0#1); 1149#L96-1 assume !(0 != main_~p4~0#1); 1147#L100-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 1145#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1143#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1141#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1139#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1137#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1135#L124-1 assume !(0 != main_~p11~0#1); 1133#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1131#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1129#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 1125#L140-1 assume !(0 != main_~p1~0#1); 1123#L146-1 assume !(0 != main_~p2~0#1); 1121#L151-1 assume !(0 != main_~p3~0#1); 1116#L156-1 assume !(0 != main_~p4~0#1); 1114#L161-1 assume !(0 != main_~p5~0#1); 1108#L166-1 assume !(0 != main_~p6~0#1); 1103#L171-1 assume !(0 != main_~p7~0#1); 1100#L176-1 assume !(0 != main_~p8~0#1); 1098#L181-1 assume !(0 != main_~p9~0#1); 1095#L186-1 assume !(0 != main_~p10~0#1); 1092#L191-1 assume !(0 != main_~p11~0#1); 1088#L196-1 assume !(0 != main_~p12~0#1); 1068#L201-1 assume !(0 != main_~p13~0#1); 1038#L206-1 assume !(0 != main_~p14~0#1); 968#L211-1 [2022-07-13 03:29:50,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:50,977 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-07-13 03:29:50,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:50,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343095464] [2022-07-13 03:29:50,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:50,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:50,991 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:51,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:51,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:51,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1519232837, now seen corresponding path program 1 times [2022-07-13 03:29:51,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:51,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469767713] [2022-07-13 03:29:51,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:51,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:51,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:51,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:51,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:51,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469767713] [2022-07-13 03:29:51,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469767713] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:51,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:51,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:51,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876212018] [2022-07-13 03:29:51,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:51,048 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:51,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:51,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:51,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:51,049 INFO L87 Difference]: Start difference. First operand 342 states and 542 transitions. cyclomatic complexity: 208 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2022-07-13 03:29:51,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:51,075 INFO L93 Difference]: Finished difference Result 674 states and 1058 transitions. [2022-07-13 03:29:51,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:51,077 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 674 states and 1058 transitions. [2022-07-13 03:29:51,084 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2022-07-13 03:29:51,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 674 states to 674 states and 1058 transitions. [2022-07-13 03:29:51,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 674 [2022-07-13 03:29:51,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 674 [2022-07-13 03:29:51,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 674 states and 1058 transitions. [2022-07-13 03:29:51,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:51,094 INFO L369 hiAutomatonCegarLoop]: Abstraction has 674 states and 1058 transitions. [2022-07-13 03:29:51,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states and 1058 transitions. [2022-07-13 03:29:51,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2022-07-13 03:29:51,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 674 states have (on average 1.5697329376854599) internal successors, (1058), 673 states have internal predecessors, (1058), 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) [2022-07-13 03:29:51,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1058 transitions. [2022-07-13 03:29:51,134 INFO L392 hiAutomatonCegarLoop]: Abstraction has 674 states and 1058 transitions. [2022-07-13 03:29:51,134 INFO L374 stractBuchiCegarLoop]: Abstraction has 674 states and 1058 transitions. [2022-07-13 03:29:51,134 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 03:29:51,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 674 states and 1058 transitions. [2022-07-13 03:29:51,138 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 672 [2022-07-13 03:29:51,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:51,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:51,139 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:51,139 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-13 03:29:51,140 INFO L752 eck$LassoCheckResult]: Stem: 2005#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 1986#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 1987#L211-1 [2022-07-13 03:29:51,140 INFO L754 eck$LassoCheckResult]: Loop: 1987#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 2105#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 2103#L88 assume !(0 != main_~p1~0#1); 2104#L88-2 assume !(0 != main_~p2~0#1); 2147#L92-1 assume !(0 != main_~p3~0#1); 2145#L96-1 assume !(0 != main_~p4~0#1); 2143#L100-1 assume !(0 != main_~p5~0#1); 2142#L104-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 2141#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2140#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2139#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 2138#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 2137#L124-1 assume !(0 != main_~p11~0#1); 2136#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 2135#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 2134#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 2132#L140-1 assume !(0 != main_~p1~0#1); 2130#L146-1 assume !(0 != main_~p2~0#1); 2129#L151-1 assume !(0 != main_~p3~0#1); 2126#L156-1 assume !(0 != main_~p4~0#1); 2124#L161-1 assume !(0 != main_~p5~0#1); 2123#L166-1 assume !(0 != main_~p6~0#1); 2120#L171-1 assume !(0 != main_~p7~0#1); 2119#L176-1 assume !(0 != main_~p8~0#1); 2117#L181-1 assume !(0 != main_~p9~0#1); 2114#L186-1 assume !(0 != main_~p10~0#1); 2113#L191-1 assume !(0 != main_~p11~0#1); 2111#L196-1 assume !(0 != main_~p12~0#1); 2109#L201-1 assume !(0 != main_~p13~0#1); 2107#L206-1 assume !(0 != main_~p14~0#1); 1987#L211-1 [2022-07-13 03:29:51,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:51,141 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-07-13 03:29:51,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:51,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554965198] [2022-07-13 03:29:51,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:51,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:51,147 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:51,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:51,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:51,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1653246343, now seen corresponding path program 1 times [2022-07-13 03:29:51,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:51,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704394455] [2022-07-13 03:29:51,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:51,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:51,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:51,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:51,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704394455] [2022-07-13 03:29:51,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704394455] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:51,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:51,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:51,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318962547] [2022-07-13 03:29:51,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:51,181 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:51,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:51,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:51,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:51,183 INFO L87 Difference]: Start difference. First operand 674 states and 1058 transitions. cyclomatic complexity: 400 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2022-07-13 03:29:51,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:51,215 INFO L93 Difference]: Finished difference Result 1330 states and 2066 transitions. [2022-07-13 03:29:51,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:51,217 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1330 states and 2066 transitions. [2022-07-13 03:29:51,229 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2022-07-13 03:29:51,239 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1330 states to 1330 states and 2066 transitions. [2022-07-13 03:29:51,239 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1330 [2022-07-13 03:29:51,240 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1330 [2022-07-13 03:29:51,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1330 states and 2066 transitions. [2022-07-13 03:29:51,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:51,243 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2022-07-13 03:29:51,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states and 2066 transitions. [2022-07-13 03:29:51,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2022-07-13 03:29:51,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1330 states have (on average 1.5533834586466166) internal successors, (2066), 1329 states have internal predecessors, (2066), 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) [2022-07-13 03:29:51,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 2066 transitions. [2022-07-13 03:29:51,276 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2022-07-13 03:29:51,276 INFO L374 stractBuchiCegarLoop]: Abstraction has 1330 states and 2066 transitions. [2022-07-13 03:29:51,276 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 03:29:51,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1330 states and 2066 transitions. [2022-07-13 03:29:51,284 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1328 [2022-07-13 03:29:51,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:51,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:51,287 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:51,287 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-13 03:29:51,288 INFO L752 eck$LassoCheckResult]: Stem: 4017#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 3996#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 3997#L211-1 [2022-07-13 03:29:51,288 INFO L754 eck$LassoCheckResult]: Loop: 3997#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 4074#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 4061#L88 assume !(0 != main_~p1~0#1); 4054#L88-2 assume !(0 != main_~p2~0#1); 4055#L92-1 assume !(0 != main_~p3~0#1); 4048#L96-1 assume !(0 != main_~p4~0#1); 4050#L100-1 assume !(0 != main_~p5~0#1); 4187#L104-1 assume !(0 != main_~p6~0#1); 4189#L108-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 4179#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4180#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 4171#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 4172#L124-1 assume !(0 != main_~p11~0#1); 4163#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 4164#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 4155#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 4156#L140-1 assume !(0 != main_~p1~0#1); 4355#L146-1 assume !(0 != main_~p2~0#1); 4353#L151-1 assume !(0 != main_~p3~0#1); 4348#L156-1 assume !(0 != main_~p4~0#1); 4346#L161-1 assume !(0 != main_~p5~0#1); 4345#L166-1 assume !(0 != main_~p6~0#1); 4342#L171-1 assume !(0 != main_~p7~0#1); 4341#L176-1 assume !(0 != main_~p8~0#1); 4338#L181-1 assume !(0 != main_~p9~0#1); 4335#L186-1 assume !(0 != main_~p10~0#1); 4317#L191-1 assume !(0 != main_~p11~0#1); 4289#L196-1 assume !(0 != main_~p12~0#1); 4288#L201-1 assume !(0 != main_~p13~0#1); 4292#L206-1 assume !(0 != main_~p14~0#1); 3997#L211-1 [2022-07-13 03:29:51,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:51,289 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-07-13 03:29:51,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:51,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945289188] [2022-07-13 03:29:51,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:51,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:51,308 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:51,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:51,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:51,332 INFO L85 PathProgramCache]: Analyzing trace with hash 836282619, now seen corresponding path program 1 times [2022-07-13 03:29:51,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:51,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938305975] [2022-07-13 03:29:51,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:51,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:51,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:51,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:51,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938305975] [2022-07-13 03:29:51,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938305975] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:51,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:51,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:51,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232797024] [2022-07-13 03:29:51,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:51,362 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:51,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:51,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:51,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:51,363 INFO L87 Difference]: Start difference. First operand 1330 states and 2066 transitions. cyclomatic complexity: 768 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2022-07-13 03:29:51,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:51,394 INFO L93 Difference]: Finished difference Result 2626 states and 4034 transitions. [2022-07-13 03:29:51,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:51,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2626 states and 4034 transitions. [2022-07-13 03:29:51,439 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2022-07-13 03:29:51,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2626 states to 2626 states and 4034 transitions. [2022-07-13 03:29:51,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2626 [2022-07-13 03:29:51,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2626 [2022-07-13 03:29:51,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2626 states and 4034 transitions. [2022-07-13 03:29:51,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:51,461 INFO L369 hiAutomatonCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2022-07-13 03:29:51,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states and 4034 transitions. [2022-07-13 03:29:51,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2626. [2022-07-13 03:29:51,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2626 states have (on average 1.5361766945925361) internal successors, (4034), 2625 states have internal predecessors, (4034), 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) [2022-07-13 03:29:51,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 4034 transitions. [2022-07-13 03:29:51,519 INFO L392 hiAutomatonCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2022-07-13 03:29:51,519 INFO L374 stractBuchiCegarLoop]: Abstraction has 2626 states and 4034 transitions. [2022-07-13 03:29:51,520 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-13 03:29:51,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2626 states and 4034 transitions. [2022-07-13 03:29:51,536 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2624 [2022-07-13 03:29:51,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:51,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:51,539 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:51,539 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-13 03:29:51,539 INFO L752 eck$LassoCheckResult]: Stem: 7974#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 7958#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 7959#L211-1 [2022-07-13 03:29:51,539 INFO L754 eck$LassoCheckResult]: Loop: 7959#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 8097#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 8093#L88 assume !(0 != main_~p1~0#1); 8086#L88-2 assume !(0 != main_~p2~0#1); 8081#L92-1 assume !(0 != main_~p3~0#1); 8074#L96-1 assume !(0 != main_~p4~0#1); 8066#L100-1 assume !(0 != main_~p5~0#1); 8058#L104-1 assume !(0 != main_~p6~0#1); 8052#L108-1 assume !(0 != main_~p7~0#1); 8047#L112-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 8048#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 8041#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 8042#L124-1 assume !(0 != main_~p11~0#1); 8035#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 8036#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 8028#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 8029#L140-1 assume !(0 != main_~p1~0#1); 8194#L146-1 assume !(0 != main_~p2~0#1); 8174#L151-1 assume !(0 != main_~p3~0#1); 8168#L156-1 assume !(0 != main_~p4~0#1); 8163#L161-1 assume !(0 != main_~p5~0#1); 8159#L166-1 assume !(0 != main_~p6~0#1); 8157#L171-1 assume !(0 != main_~p7~0#1); 8156#L176-1 assume !(0 != main_~p8~0#1); 8154#L181-1 assume !(0 != main_~p9~0#1); 8141#L186-1 assume !(0 != main_~p10~0#1); 8122#L191-1 assume !(0 != main_~p11~0#1); 8118#L196-1 assume !(0 != main_~p12~0#1); 8116#L201-1 assume !(0 != main_~p13~0#1); 8106#L206-1 assume !(0 != main_~p14~0#1); 7959#L211-1 [2022-07-13 03:29:51,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:51,545 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-07-13 03:29:51,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:51,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033303388] [2022-07-13 03:29:51,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:51,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:51,556 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:51,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:51,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:51,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1055137337, now seen corresponding path program 1 times [2022-07-13 03:29:51,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:51,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740847760] [2022-07-13 03:29:51,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:51,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:51,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:51,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:51,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740847760] [2022-07-13 03:29:51,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740847760] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:51,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:51,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:51,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041726003] [2022-07-13 03:29:51,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:51,602 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:51,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:51,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:51,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:51,603 INFO L87 Difference]: Start difference. First operand 2626 states and 4034 transitions. cyclomatic complexity: 1472 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2022-07-13 03:29:51,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:51,634 INFO L93 Difference]: Finished difference Result 5186 states and 7874 transitions. [2022-07-13 03:29:51,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:51,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5186 states and 7874 transitions. [2022-07-13 03:29:51,697 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2022-07-13 03:29:51,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5186 states to 5186 states and 7874 transitions. [2022-07-13 03:29:51,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5186 [2022-07-13 03:29:51,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5186 [2022-07-13 03:29:51,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5186 states and 7874 transitions. [2022-07-13 03:29:51,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:51,740 INFO L369 hiAutomatonCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2022-07-13 03:29:51,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states and 7874 transitions. [2022-07-13 03:29:51,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 5186. [2022-07-13 03:29:51,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5186 states, 5186 states have (on average 1.5183185499421519) internal successors, (7874), 5185 states have internal predecessors, (7874), 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) [2022-07-13 03:29:51,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 7874 transitions. [2022-07-13 03:29:51,851 INFO L392 hiAutomatonCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2022-07-13 03:29:51,851 INFO L374 stractBuchiCegarLoop]: Abstraction has 5186 states and 7874 transitions. [2022-07-13 03:29:51,852 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-13 03:29:51,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5186 states and 7874 transitions. [2022-07-13 03:29:51,894 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5184 [2022-07-13 03:29:51,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:51,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:51,897 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:51,897 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-13 03:29:51,897 INFO L752 eck$LassoCheckResult]: Stem: 15796#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 15777#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 15778#L211-1 [2022-07-13 03:29:51,898 INFO L754 eck$LassoCheckResult]: Loop: 15778#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 16332#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 16329#L88 assume !(0 != main_~p1~0#1); 16326#L88-2 assume !(0 != main_~p2~0#1); 16324#L92-1 assume !(0 != main_~p3~0#1); 16321#L96-1 assume !(0 != main_~p4~0#1); 16317#L100-1 assume !(0 != main_~p5~0#1); 16314#L104-1 assume !(0 != main_~p6~0#1); 16311#L108-1 assume !(0 != main_~p7~0#1); 16140#L112-1 assume !(0 != main_~p8~0#1); 16142#L116-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 16090#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 16091#L124-1 assume !(0 != main_~p11~0#1); 16082#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 16083#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 16481#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 16477#L140-1 assume !(0 != main_~p1~0#1); 16066#L146-1 assume !(0 != main_~p2~0#1); 16068#L151-1 assume !(0 != main_~p3~0#1); 16057#L156-1 assume !(0 != main_~p4~0#1); 16059#L161-1 assume !(0 != main_~p5~0#1); 16363#L166-1 assume !(0 != main_~p6~0#1); 16361#L171-1 assume !(0 != main_~p7~0#1); 16359#L176-1 assume !(0 != main_~p8~0#1); 16357#L181-1 assume !(0 != main_~p9~0#1); 16352#L186-1 assume !(0 != main_~p10~0#1); 16349#L191-1 assume !(0 != main_~p11~0#1); 16345#L196-1 assume !(0 != main_~p12~0#1); 16341#L201-1 assume !(0 != main_~p13~0#1); 16337#L206-1 assume !(0 != main_~p14~0#1); 15778#L211-1 [2022-07-13 03:29:51,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:51,898 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-07-13 03:29:51,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:51,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609682294] [2022-07-13 03:29:51,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:51,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:51,908 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:51,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:51,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:51,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1477839163, now seen corresponding path program 1 times [2022-07-13 03:29:51,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:51,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507778991] [2022-07-13 03:29:51,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:51,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:51,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:51,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:51,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:51,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507778991] [2022-07-13 03:29:51,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507778991] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:51,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:51,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:51,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014990694] [2022-07-13 03:29:51,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:51,963 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:51,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:51,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:51,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:51,964 INFO L87 Difference]: Start difference. First operand 5186 states and 7874 transitions. cyclomatic complexity: 2816 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2022-07-13 03:29:52,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:52,007 INFO L93 Difference]: Finished difference Result 10242 states and 15362 transitions. [2022-07-13 03:29:52,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:52,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10242 states and 15362 transitions. [2022-07-13 03:29:52,081 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2022-07-13 03:29:52,170 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10242 states to 10242 states and 15362 transitions. [2022-07-13 03:29:52,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10242 [2022-07-13 03:29:52,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10242 [2022-07-13 03:29:52,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10242 states and 15362 transitions. [2022-07-13 03:29:52,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:52,195 INFO L369 hiAutomatonCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2022-07-13 03:29:52,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10242 states and 15362 transitions. [2022-07-13 03:29:52,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10242 to 10242. [2022-07-13 03:29:52,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10242 states, 10242 states have (on average 1.4999023628197619) internal successors, (15362), 10241 states have internal predecessors, (15362), 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) [2022-07-13 03:29:52,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10242 states to 10242 states and 15362 transitions. [2022-07-13 03:29:52,459 INFO L392 hiAutomatonCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2022-07-13 03:29:52,459 INFO L374 stractBuchiCegarLoop]: Abstraction has 10242 states and 15362 transitions. [2022-07-13 03:29:52,459 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-13 03:29:52,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10242 states and 15362 transitions. [2022-07-13 03:29:52,500 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 10240 [2022-07-13 03:29:52,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:52,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:52,501 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:52,501 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-13 03:29:52,502 INFO L752 eck$LassoCheckResult]: Stem: 31228#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 31211#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 31212#L211-1 [2022-07-13 03:29:52,503 INFO L754 eck$LassoCheckResult]: Loop: 31212#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 31931#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 31927#L88 assume !(0 != main_~p1~0#1); 31923#L88-2 assume !(0 != main_~p2~0#1); 31921#L92-1 assume !(0 != main_~p3~0#1); 31917#L96-1 assume !(0 != main_~p4~0#1); 31913#L100-1 assume !(0 != main_~p5~0#1); 31910#L104-1 assume !(0 != main_~p6~0#1); 31911#L108-1 assume !(0 != main_~p7~0#1); 31996#L112-1 assume !(0 != main_~p8~0#1); 31993#L116-1 assume !(0 != main_~p9~0#1); 31991#L120-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 31989#L124-1 assume !(0 != main_~p11~0#1); 31987#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 31985#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 31982#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 31978#L140-1 assume !(0 != main_~p1~0#1); 31974#L146-1 assume !(0 != main_~p2~0#1); 31972#L151-1 assume !(0 != main_~p3~0#1); 31968#L156-1 assume !(0 != main_~p4~0#1); 31965#L161-1 assume !(0 != main_~p5~0#1); 31964#L166-1 assume !(0 != main_~p6~0#1); 31962#L171-1 assume !(0 != main_~p7~0#1); 31958#L176-1 assume !(0 != main_~p8~0#1); 31954#L181-1 assume !(0 != main_~p9~0#1); 31950#L186-1 assume !(0 != main_~p10~0#1); 31947#L191-1 assume !(0 != main_~p11~0#1); 31943#L196-1 assume !(0 != main_~p12~0#1); 31939#L201-1 assume !(0 != main_~p13~0#1); 31935#L206-1 assume !(0 != main_~p14~0#1); 31212#L211-1 [2022-07-13 03:29:52,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:52,504 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2022-07-13 03:29:52,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:52,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686000434] [2022-07-13 03:29:52,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:52,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:52,518 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:52,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:52,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:52,527 INFO L85 PathProgramCache]: Analyzing trace with hash 660190713, now seen corresponding path program 1 times [2022-07-13 03:29:52,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:52,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622554998] [2022-07-13 03:29:52,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:52,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:52,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:52,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:52,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:52,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622554998] [2022-07-13 03:29:52,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622554998] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:52,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:52,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:52,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964120196] [2022-07-13 03:29:52,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:52,577 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:52,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:52,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:52,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:52,579 INFO L87 Difference]: Start difference. First operand 10242 states and 15362 transitions. cyclomatic complexity: 5376 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2022-07-13 03:29:52,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:52,695 INFO L93 Difference]: Finished difference Result 20226 states and 29954 transitions. [2022-07-13 03:29:52,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:52,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20226 states and 29954 transitions. [2022-07-13 03:29:52,812 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2022-07-13 03:29:52,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20226 states to 20226 states and 29954 transitions. [2022-07-13 03:29:52,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20226 [2022-07-13 03:29:53,002 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20226 [2022-07-13 03:29:53,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20226 states and 29954 transitions. [2022-07-13 03:29:53,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:53,029 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20226 states and 29954 transitions. [2022-07-13 03:29:53,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20226 states and 29954 transitions. [2022-07-13 03:29:53,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20226 to 20226. [2022-07-13 03:29:53,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20226 states, 20226 states have (on average 1.4809650944329082) internal successors, (29954), 20225 states have internal predecessors, (29954), 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) [2022-07-13 03:29:53,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20226 states to 20226 states and 29954 transitions. [2022-07-13 03:29:53,592 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20226 states and 29954 transitions. [2022-07-13 03:29:53,592 INFO L374 stractBuchiCegarLoop]: Abstraction has 20226 states and 29954 transitions. [2022-07-13 03:29:53,593 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-13 03:29:53,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20226 states and 29954 transitions. [2022-07-13 03:29:53,655 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 20224 [2022-07-13 03:29:53,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:53,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:53,656 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:53,656 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-13 03:29:53,656 INFO L752 eck$LassoCheckResult]: Stem: 61703#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 61684#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 61685#L211-1 [2022-07-13 03:29:53,656 INFO L754 eck$LassoCheckResult]: Loop: 61685#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 62023#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 62020#L88 assume !(0 != main_~p1~0#1); 62016#L88-2 assume !(0 != main_~p2~0#1); 62013#L92-1 assume !(0 != main_~p3~0#1); 62010#L96-1 assume !(0 != main_~p4~0#1); 62006#L100-1 assume !(0 != main_~p5~0#1); 62002#L104-1 assume !(0 != main_~p6~0#1); 61995#L108-1 assume !(0 != main_~p7~0#1); 61996#L112-1 assume !(0 != main_~p8~0#1); 62085#L116-1 assume !(0 != main_~p9~0#1); 62081#L120-1 assume !(0 != main_~p10~0#1); 62079#L124-1 assume !(0 != main_~p11~0#1); 62077#L128-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 62075#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 62073#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 62069#L140-1 assume !(0 != main_~p1~0#1); 62065#L146-1 assume !(0 != main_~p2~0#1); 62062#L151-1 assume !(0 != main_~p3~0#1); 62057#L156-1 assume !(0 != main_~p4~0#1); 62053#L161-1 assume !(0 != main_~p5~0#1); 62049#L166-1 assume !(0 != main_~p6~0#1); 62047#L171-1 assume !(0 != main_~p7~0#1); 62045#L176-1 assume !(0 != main_~p8~0#1); 62043#L181-1 assume !(0 != main_~p9~0#1); 62041#L186-1 assume !(0 != main_~p10~0#1); 62040#L191-1 assume !(0 != main_~p11~0#1); 62036#L196-1 assume !(0 != main_~p12~0#1); 62032#L201-1 assume !(0 != main_~p13~0#1); 62028#L206-1 assume !(0 != main_~p14~0#1); 61685#L211-1 [2022-07-13 03:29:53,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:53,657 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2022-07-13 03:29:53,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:53,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964292010] [2022-07-13 03:29:53,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:53,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:53,668 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:53,681 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:53,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:53,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1028753029, now seen corresponding path program 1 times [2022-07-13 03:29:53,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:53,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938353683] [2022-07-13 03:29:53,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:53,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:53,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:53,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:53,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938353683] [2022-07-13 03:29:53,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938353683] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:53,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:53,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:53,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924146739] [2022-07-13 03:29:53,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:53,713 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:53,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:53,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:53,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:53,718 INFO L87 Difference]: Start difference. First operand 20226 states and 29954 transitions. cyclomatic complexity: 10240 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2022-07-13 03:29:53,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:53,833 INFO L93 Difference]: Finished difference Result 39938 states and 58370 transitions. [2022-07-13 03:29:53,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:53,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39938 states and 58370 transitions. [2022-07-13 03:29:54,135 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2022-07-13 03:29:54,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39938 states to 39938 states and 58370 transitions. [2022-07-13 03:29:54,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39938 [2022-07-13 03:29:54,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39938 [2022-07-13 03:29:54,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39938 states and 58370 transitions. [2022-07-13 03:29:54,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:54,474 INFO L369 hiAutomatonCegarLoop]: Abstraction has 39938 states and 58370 transitions. [2022-07-13 03:29:54,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39938 states and 58370 transitions. [2022-07-13 03:29:54,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39938 to 39938. [2022-07-13 03:29:55,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39938 states, 39938 states have (on average 1.4615153487906254) internal successors, (58370), 39937 states have internal predecessors, (58370), 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) [2022-07-13 03:29:55,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39938 states to 39938 states and 58370 transitions. [2022-07-13 03:29:55,263 INFO L392 hiAutomatonCegarLoop]: Abstraction has 39938 states and 58370 transitions. [2022-07-13 03:29:55,263 INFO L374 stractBuchiCegarLoop]: Abstraction has 39938 states and 58370 transitions. [2022-07-13 03:29:55,263 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-13 03:29:55,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39938 states and 58370 transitions. [2022-07-13 03:29:55,365 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 39936 [2022-07-13 03:29:55,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:55,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:55,366 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:55,366 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-13 03:29:55,366 INFO L752 eck$LassoCheckResult]: Stem: 121875#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 121856#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 121857#L211-1 [2022-07-13 03:29:55,366 INFO L754 eck$LassoCheckResult]: Loop: 121857#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 122012#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 122010#L88 assume !(0 != main_~p1~0#1); 122006#L88-2 assume !(0 != main_~p2~0#1); 122004#L92-1 assume !(0 != main_~p3~0#1); 122000#L96-1 assume !(0 != main_~p4~0#1); 121996#L100-1 assume !(0 != main_~p5~0#1); 121992#L104-1 assume !(0 != main_~p6~0#1); 121988#L108-1 assume !(0 != main_~p7~0#1); 121984#L112-1 assume !(0 != main_~p8~0#1); 121980#L116-1 assume !(0 != main_~p9~0#1); 121976#L120-1 assume !(0 != main_~p10~0#1); 121974#L124-1 assume !(0 != main_~p11~0#1); 121970#L128-1 assume !(0 != main_~p12~0#1); 121968#L132-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 121966#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 121963#L140-1 assume !(0 != main_~p1~0#1); 121964#L146-1 assume !(0 != main_~p2~0#1); 122060#L151-1 assume !(0 != main_~p3~0#1); 122055#L156-1 assume !(0 != main_~p4~0#1); 122051#L161-1 assume !(0 != main_~p5~0#1); 122047#L166-1 assume !(0 != main_~p6~0#1); 122043#L171-1 assume !(0 != main_~p7~0#1); 122039#L176-1 assume !(0 != main_~p8~0#1); 122035#L181-1 assume !(0 != main_~p9~0#1); 122031#L186-1 assume !(0 != main_~p10~0#1); 122028#L191-1 assume !(0 != main_~p11~0#1); 122023#L196-1 assume !(0 != main_~p12~0#1); 122020#L201-1 assume !(0 != main_~p13~0#1); 122016#L206-1 assume !(0 != main_~p14~0#1); 121857#L211-1 [2022-07-13 03:29:55,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:55,366 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2022-07-13 03:29:55,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:55,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229113893] [2022-07-13 03:29:55,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:55,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:55,370 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:55,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:55,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:55,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1677866365, now seen corresponding path program 1 times [2022-07-13 03:29:55,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:55,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471146520] [2022-07-13 03:29:55,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:55,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:55,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:55,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:55,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471146520] [2022-07-13 03:29:55,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471146520] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:55,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:55,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:55,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211838713] [2022-07-13 03:29:55,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:55,400 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:55,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:55,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:55,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:55,401 INFO L87 Difference]: Start difference. First operand 39938 states and 58370 transitions. cyclomatic complexity: 19456 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2022-07-13 03:29:55,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:55,657 INFO L93 Difference]: Finished difference Result 78850 states and 113666 transitions. [2022-07-13 03:29:55,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:55,657 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78850 states and 113666 transitions. [2022-07-13 03:29:56,070 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 78848 [2022-07-13 03:29:56,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78850 states to 78850 states and 113666 transitions. [2022-07-13 03:29:56,340 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78850 [2022-07-13 03:29:56,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78850 [2022-07-13 03:29:56,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78850 states and 113666 transitions. [2022-07-13 03:29:56,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:56,468 INFO L369 hiAutomatonCegarLoop]: Abstraction has 78850 states and 113666 transitions. [2022-07-13 03:29:56,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78850 states and 113666 transitions. [2022-07-13 03:29:57,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78850 to 78850. [2022-07-13 03:29:57,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78850 states, 78850 states have (on average 1.4415472415979709) internal successors, (113666), 78849 states have internal predecessors, (113666), 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) [2022-07-13 03:29:57,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78850 states to 78850 states and 113666 transitions. [2022-07-13 03:29:57,836 INFO L392 hiAutomatonCegarLoop]: Abstraction has 78850 states and 113666 transitions. [2022-07-13 03:29:57,836 INFO L374 stractBuchiCegarLoop]: Abstraction has 78850 states and 113666 transitions. [2022-07-13 03:29:57,836 INFO L287 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-13 03:29:57,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78850 states and 113666 transitions. [2022-07-13 03:29:58,235 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 78848 [2022-07-13 03:29:58,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:58,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:58,237 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:58,237 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-13 03:29:58,237 INFO L752 eck$LassoCheckResult]: Stem: 240669#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 240648#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 240649#L211-1 [2022-07-13 03:29:58,237 INFO L754 eck$LassoCheckResult]: Loop: 240649#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 241123#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 241119#L88 assume !(0 != main_~p1~0#1); 241113#L88-2 assume !(0 != main_~p2~0#1); 241108#L92-1 assume !(0 != main_~p3~0#1); 241104#L96-1 assume !(0 != main_~p4~0#1); 241098#L100-1 assume !(0 != main_~p5~0#1); 241068#L104-1 assume !(0 != main_~p6~0#1); 241070#L108-1 assume !(0 != main_~p7~0#1); 241092#L112-1 assume !(0 != main_~p8~0#1); 241206#L116-1 assume !(0 != main_~p9~0#1); 241203#L120-1 assume !(0 != main_~p10~0#1); 241200#L124-1 assume !(0 != main_~p11~0#1); 241197#L128-1 assume !(0 != main_~p12~0#1); 241193#L132-1 assume !(0 != main_~p13~0#1); 241194#L136-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 241224#L140-1 assume !(0 != main_~p1~0#1); 241222#L146-1 assume !(0 != main_~p2~0#1); 241221#L151-1 assume !(0 != main_~p3~0#1); 241218#L156-1 assume !(0 != main_~p4~0#1); 241216#L161-1 assume !(0 != main_~p5~0#1); 241214#L166-1 assume !(0 != main_~p6~0#1); 241007#L171-1 assume !(0 != main_~p7~0#1); 241002#L176-1 assume !(0 != main_~p8~0#1); 240997#L181-1 assume !(0 != main_~p9~0#1); 240992#L186-1 assume !(0 != main_~p10~0#1); 240993#L191-1 assume !(0 != main_~p11~0#1); 240982#L196-1 assume !(0 != main_~p12~0#1); 240984#L201-1 assume !(0 != main_~p13~0#1); 241131#L206-1 assume !(0 != main_~p14~0#1); 240649#L211-1 [2022-07-13 03:29:58,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:58,238 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2022-07-13 03:29:58,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:58,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038935146] [2022-07-13 03:29:58,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:58,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:58,242 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:58,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:58,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:58,246 INFO L85 PathProgramCache]: Analyzing trace with hash 656798011, now seen corresponding path program 1 times [2022-07-13 03:29:58,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:58,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827216986] [2022-07-13 03:29:58,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:58,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:58,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:58,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:58,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827216986] [2022-07-13 03:29:58,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827216986] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:58,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:58,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 03:29:58,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161036708] [2022-07-13 03:29:58,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:58,265 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:58,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:58,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:58,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:58,266 INFO L87 Difference]: Start difference. First operand 78850 states and 113666 transitions. cyclomatic complexity: 36864 Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2022-07-13 03:29:58,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:58,682 INFO L93 Difference]: Finished difference Result 155650 states and 221186 transitions. [2022-07-13 03:29:58,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:58,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155650 states and 221186 transitions. [2022-07-13 03:29:59,782 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 155648 [2022-07-13 03:30:00,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155650 states to 155650 states and 221186 transitions. [2022-07-13 03:30:00,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155650 [2022-07-13 03:30:00,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155650 [2022-07-13 03:30:00,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155650 states and 221186 transitions. [2022-07-13 03:30:00,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:30:00,309 INFO L369 hiAutomatonCegarLoop]: Abstraction has 155650 states and 221186 transitions. [2022-07-13 03:30:00,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155650 states and 221186 transitions. [2022-07-13 03:30:01,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155650 to 155650. [2022-07-13 03:30:01,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155650 states, 155650 states have (on average 1.4210472213299068) internal successors, (221186), 155649 states have internal predecessors, (221186), 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) [2022-07-13 03:30:02,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155650 states to 155650 states and 221186 transitions. [2022-07-13 03:30:02,277 INFO L392 hiAutomatonCegarLoop]: Abstraction has 155650 states and 221186 transitions. [2022-07-13 03:30:02,277 INFO L374 stractBuchiCegarLoop]: Abstraction has 155650 states and 221186 transitions. [2022-07-13 03:30:02,277 INFO L287 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-13 03:30:02,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155650 states and 221186 transitions. [2022-07-13 03:30:03,233 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 155648 [2022-07-13 03:30:03,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:03,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:03,235 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:03,236 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-13 03:30:03,236 INFO L752 eck$LassoCheckResult]: Stem: 475174#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 475155#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; 475156#L211-1 [2022-07-13 03:30:03,236 INFO L754 eck$LassoCheckResult]: Loop: 475156#L211-1 assume !false;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; 476630#L55 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; 476626#L88 assume !(0 != main_~p1~0#1); 476622#L88-2 assume !(0 != main_~p2~0#1); 476620#L92-1 assume !(0 != main_~p3~0#1); 476615#L96-1 assume !(0 != main_~p4~0#1); 476603#L100-1 assume !(0 != main_~p5~0#1); 476604#L104-1 assume !(0 != main_~p6~0#1); 476674#L108-1 assume !(0 != main_~p7~0#1); 476661#L112-1 assume !(0 != main_~p8~0#1); 476659#L116-1 assume !(0 != main_~p9~0#1); 476569#L120-1 assume !(0 != main_~p10~0#1); 476571#L124-1 assume !(0 != main_~p11~0#1); 476544#L128-1 assume !(0 != main_~p12~0#1); 476546#L132-1 assume !(0 != main_~p13~0#1); 476521#L136-1 assume !(0 != main_~p14~0#1); 476523#L140-1 assume !(0 != main_~p1~0#1); 476485#L146-1 assume !(0 != main_~p2~0#1); 476487#L151-1 assume !(0 != main_~p3~0#1); 476475#L156-1 assume !(0 != main_~p4~0#1); 476477#L161-1 assume !(0 != main_~p5~0#1); 476335#L166-1 assume !(0 != main_~p6~0#1); 476336#L171-1 assume !(0 != main_~p7~0#1); 476428#L176-1 assume !(0 != main_~p8~0#1); 476650#L181-1 assume !(0 != main_~p9~0#1); 476647#L186-1 assume !(0 != main_~p10~0#1); 476646#L191-1 assume !(0 != main_~p11~0#1); 476643#L196-1 assume !(0 != main_~p12~0#1); 476639#L201-1 assume !(0 != main_~p13~0#1); 476635#L206-1 assume !(0 != main_~p14~0#1); 475156#L211-1 [2022-07-13 03:30:03,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:03,237 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 13 times [2022-07-13 03:30:03,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:03,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402145590] [2022-07-13 03:30:03,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:03,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:03,241 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:03,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:03,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:03,246 INFO L85 PathProgramCache]: Analyzing trace with hash -623065667, now seen corresponding path program 1 times [2022-07-13 03:30:03,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:03,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231078875] [2022-07-13 03:30:03,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:03,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:03,251 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:03,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:03,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:03,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1839024639, now seen corresponding path program 1 times [2022-07-13 03:30:03,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:03,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909397317] [2022-07-13 03:30:03,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:03,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:03,270 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:03,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:03,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.07 03:30:03 BoogieIcfgContainer [2022-07-13 03:30:03,698 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-13 03:30:03,698 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 03:30:03,698 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 03:30:03,699 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 03:30:03,699 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:29:50" (3/4) ... [2022-07-13 03:30:03,701 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-13 03:30:03,753 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 03:30:03,756 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 03:30:03,757 INFO L158 Benchmark]: Toolchain (without parser) took 14270.81ms. Allocated memory was 81.8MB in the beginning and 11.4GB in the end (delta: 11.3GB). Free memory was 43.9MB in the beginning and 10.0GB in the end (delta: -10.0GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-07-13 03:30:03,757 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 81.8MB. Free memory was 60.1MB in the beginning and 60.1MB in the end (delta: 46.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:30:03,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.00ms. Allocated memory was 81.8MB in the beginning and 100.7MB in the end (delta: 18.9MB). Free memory was 43.7MB in the beginning and 76.7MB in the end (delta: -33.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 03:30:03,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.95ms. Allocated memory is still 100.7MB. Free memory was 76.7MB in the beginning and 74.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:30:03,765 INFO L158 Benchmark]: Boogie Preprocessor took 20.65ms. Allocated memory is still 100.7MB. Free memory was 74.5MB in the beginning and 73.6MB in the end (delta: 897.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:30:03,765 INFO L158 Benchmark]: RCFGBuilder took 293.73ms. Allocated memory is still 100.7MB. Free memory was 73.0MB in the beginning and 60.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 03:30:03,766 INFO L158 Benchmark]: BuchiAutomizer took 13625.60ms. Allocated memory was 100.7MB in the beginning and 11.4GB in the end (delta: 11.3GB). Free memory was 60.4MB in the beginning and 10.0GB in the end (delta: -9.9GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-07-13 03:30:03,766 INFO L158 Benchmark]: Witness Printer took 57.55ms. Allocated memory is still 11.4GB. Free memory was 10.0GB in the beginning and 10.0GB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:30:03,768 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.22ms. Allocated memory is still 81.8MB. Free memory was 60.1MB in the beginning and 60.1MB in the end (delta: 46.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.00ms. Allocated memory was 81.8MB in the beginning and 100.7MB in the end (delta: 18.9MB). Free memory was 43.7MB in the beginning and 76.7MB in the end (delta: -33.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.95ms. Allocated memory is still 100.7MB. Free memory was 76.7MB in the beginning and 74.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.65ms. Allocated memory is still 100.7MB. Free memory was 74.5MB in the beginning and 73.6MB in the end (delta: 897.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 293.73ms. Allocated memory is still 100.7MB. Free memory was 73.0MB in the beginning and 60.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 13625.60ms. Allocated memory was 100.7MB in the beginning and 11.4GB in the end (delta: 11.3GB). Free memory was 60.4MB in the beginning and 10.0GB in the end (delta: -9.9GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 57.55ms. Allocated memory is still 11.4GB. Free memory was 10.0GB in the beginning and 10.0GB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (12 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.12 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 155650 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.5s and 13 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.1s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 0. Minimization of det autom 12. Minimization of nondet autom 0. Automata minimization 5.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 3.3s Buchi closure took 0.2s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 690 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 690 mSDsluCounter, 2157 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 833 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 60 IncrementalHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 1324 mSDtfsCounter, 60 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI12 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 53]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {p11=0, p13=0, lk5=0, p1=0, NULL=0, lk13=0, p9=0, lk9=0, NULL=1, lk12=0, cond=4, p5=0, p12=0, p10=0, lk2=0, p4=0, p14=0, p8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@728a8f77=0, lk6=0, lk11=0, lk1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7d8820ae=0, p3=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1a8e4bb3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1a319c51=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@489a1dd3=0, p7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@45f2f160=0, \result=0, lk10=0, lk7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@401269d6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6645a794=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4e3b4cd8=0, p6=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@56d7a449=0, lk14=0, p2=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@10e2fa06=4, lk8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4a9debc1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@12f8c01=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@720c6a08=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@19126dec=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 53]: 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; [L51] int cond; Loop: [L53] COND TRUE 1 [L54] cond = __VERIFIER_nondet_int() [L55] COND FALSE !(cond == 0) [L58] lk1 = 0 [L60] lk2 = 0 [L62] lk3 = 0 [L64] lk4 = 0 [L66] lk5 = 0 [L68] lk6 = 0 [L70] lk7 = 0 [L72] lk8 = 0 [L74] lk9 = 0 [L76] lk10 = 0 [L78] lk11 = 0 [L80] lk12 = 0 [L82] lk13 = 0 [L84] lk14 = 0 [L88] COND FALSE !(p1 != 0) [L92] COND FALSE !(p2 != 0) [L96] COND FALSE !(p3 != 0) [L100] COND FALSE !(p4 != 0) [L104] COND FALSE !(p5 != 0) [L108] COND FALSE !(p6 != 0) [L112] COND FALSE !(p7 != 0) [L116] COND FALSE !(p8 != 0) [L120] COND FALSE !(p9 != 0) [L124] COND FALSE !(p10 != 0) [L128] COND FALSE !(p11 != 0) [L132] COND FALSE !(p12 != 0) [L136] COND FALSE !(p13 != 0) [L140] COND FALSE !(p14 != 0) [L146] COND FALSE !(p1 != 0) [L151] COND FALSE !(p2 != 0) [L156] COND FALSE !(p3 != 0) [L161] COND FALSE !(p4 != 0) [L166] COND FALSE !(p5 != 0) [L171] COND FALSE !(p6 != 0) [L176] COND FALSE !(p7 != 0) [L181] COND FALSE !(p8 != 0) [L186] COND FALSE !(p9 != 0) [L191] COND FALSE !(p10 != 0) [L196] COND FALSE !(p11 != 0) [L201] COND FALSE !(p12 != 0) [L206] COND FALSE !(p13 != 0) [L211] COND FALSE !(p14 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-07-13 03:30:03,827 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)