./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_15-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_15-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 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 22:08:22,586 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 22:08:22,588 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 22:08:22,614 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 22:08:22,614 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 22:08:22,618 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 22:08:22,620 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 22:08:22,622 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 22:08:22,624 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 22:08:22,629 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 22:08:22,630 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 22:08:22,631 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 22:08:22,631 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 22:08:22,633 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 22:08:22,634 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 22:08:22,635 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 22:08:22,636 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 22:08:22,636 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 22:08:22,640 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 22:08:22,643 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 22:08:22,644 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 22:08:22,645 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 22:08:22,646 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 22:08:22,647 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 22:08:22,650 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 22:08:22,650 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 22:08:22,650 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 22:08:22,652 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 22:08:22,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 22:08:22,653 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 22:08:22,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 22:08:22,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 22:08:22,655 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 22:08:22,656 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 22:08:22,657 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 22:08:22,657 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 22:08:22,657 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 22:08:22,657 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 22:08:22,658 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 22:08:22,658 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 22:08:22,659 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 22:08:22,659 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-21 22:08:22,690 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 22:08:22,690 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 22:08:22,691 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 22:08:22,691 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 22:08:22,692 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 22:08:22,692 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 22:08:22,692 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 22:08:22,692 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-21 22:08:22,693 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-21 22:08:22,693 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-21 22:08:22,693 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-21 22:08:22,694 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-21 22:08:22,694 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-21 22:08:22,694 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 22:08:22,694 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 22:08:22,694 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 22:08:22,694 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 22:08:22,694 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 22:08:22,695 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 22:08:22,695 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-21 22:08:22,695 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-21 22:08:22,695 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-21 22:08:22,695 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 22:08:22,695 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 22:08:22,696 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-21 22:08:22,696 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 22:08:22,697 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-21 22:08:22,697 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 22:08:22,697 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 22:08:22,697 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 22:08:22,697 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 22:08:22,698 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 22:08:22,698 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-21 22:08:22,698 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 -> 11a9c91fdf6b42598924d9a4ae5a3db9994a05118a3b564c2bd29b9bad4177b0 [2021-12-21 22:08:22,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 22:08:22,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 22:08:22,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 22:08:22,897 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 22:08:22,897 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 22:08:22,898 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-1.c [2021-12-21 22:08:22,943 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/137dfd9a1/fa01fc339f284ebeb4448bccce3489f5/FLAG8ea8ddf61 [2021-12-21 22:08:23,290 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 22:08:23,290 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-1.c [2021-12-21 22:08:23,297 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/137dfd9a1/fa01fc339f284ebeb4448bccce3489f5/FLAG8ea8ddf61 [2021-12-21 22:08:23,309 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/137dfd9a1/fa01fc339f284ebeb4448bccce3489f5 [2021-12-21 22:08:23,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 22:08:23,312 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 22:08:23,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 22:08:23,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 22:08:23,315 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 22:08:23,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:08:23" (1/1) ... [2021-12-21 22:08:23,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@494c9f66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:08:23, skipping insertion in model container [2021-12-21 22:08:23,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:08:23" (1/1) ... [2021-12-21 22:08:23,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 22:08:23,347 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 22:08:23,501 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_15-1.c[5654,5667] [2021-12-21 22:08:23,503 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 22:08:23,513 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 22:08:23,542 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_15-1.c[5654,5667] [2021-12-21 22:08:23,550 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 22:08:23,560 INFO L208 MainTranslator]: Completed translation [2021-12-21 22:08:23,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:08:23 WrapperNode [2021-12-21 22:08:23,561 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 22:08:23,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 22:08:23,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 22:08:23,563 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 22:08:23,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:08:23" (1/1) ... [2021-12-21 22:08:23,580 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:08:23" (1/1) ... [2021-12-21 22:08:23,601 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 179 [2021-12-21 22:08:23,602 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 22:08:23,603 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 22:08:23,603 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 22:08:23,603 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 22:08:23,608 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:08:23" (1/1) ... [2021-12-21 22:08:23,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:08:23" (1/1) ... [2021-12-21 22:08:23,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:08:23" (1/1) ... [2021-12-21 22:08:23,620 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:08:23" (1/1) ... [2021-12-21 22:08:23,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:08:23" (1/1) ... [2021-12-21 22:08:23,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:08:23" (1/1) ... [2021-12-21 22:08:23,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:08:23" (1/1) ... [2021-12-21 22:08:23,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 22:08:23,643 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 22:08:23,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 22:08:23,644 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 22:08:23,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:08:23" (1/1) ... [2021-12-21 22:08:23,650 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:08:23,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:08:23,677 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:08:23,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-21 22:08:23,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 22:08:23,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 22:08:23,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 22:08:23,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 22:08:23,766 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 22:08:23,767 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 22:08:23,967 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 22:08:23,971 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 22:08:23,971 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-21 22:08:23,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:08:23 BoogieIcfgContainer [2021-12-21 22:08:23,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 22:08:23,988 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-21 22:08:23,988 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-21 22:08:23,991 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-21 22:08:23,991 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:08:23,991 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.12 10:08:23" (1/3) ... [2021-12-21 22:08:23,992 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4716b148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.12 10:08:23, skipping insertion in model container [2021-12-21 22:08:23,992 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:08:23,992 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:08:23" (2/3) ... [2021-12-21 22:08:23,992 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4716b148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.12 10:08:23, skipping insertion in model container [2021-12-21 22:08:23,992 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:08:23,992 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:08:23" (3/3) ... [2021-12-21 22:08:23,993 INFO L388 chiAutomizerObserver]: Analyzing ICFG test_locks_15-1.c [2021-12-21 22:08:24,029 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-21 22:08:24,043 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-21 22:08:24,043 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-21 22:08:24,043 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-21 22:08:24,043 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-21 22:08:24,044 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-21 22:08:24,044 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-21 22:08:24,044 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-21 22:08:24,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 53 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:08:24,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-12-21 22:08:24,092 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:08:24,092 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:08:24,096 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 22:08:24,106 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:08:24,106 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-21 22:08:24,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 53 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:08:24,110 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-12-21 22:08:24,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:08:24,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:08:24,111 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 22:08:24,111 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:08:24,116 INFO L791 eck$LassoCheckResult]: Stem: 43#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 22#L225-1true [2021-12-21 22:08:24,127 INFO L793 eck$LassoCheckResult]: Loop: 22#L225-1true assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 33#L58true 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;main_~lk15~0#1 := 0; 29#L93true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 27#L93-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 14#L97-1true assume !(0 != main_~p3~0#1); 17#L101-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 50#L105-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 45#L109-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 13#L113-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 24#L117-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 31#L121-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 18#L125-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 36#L129-1true assume !(0 != main_~p11~0#1); 4#L133-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 7#L137-1true assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 40#L141-1true assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 55#L145-1true assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 48#L149-1true assume !(0 != main_~p1~0#1); 47#L155-1true assume 0 != main_~p2~0#1; 9#L161true assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 20#L160true assume !(0 != main_~p3~0#1); 12#L165-1true assume !(0 != main_~p4~0#1); 42#L170-1true assume !(0 != main_~p5~0#1); 46#L175-1true assume !(0 != main_~p6~0#1); 19#L180-1true assume !(0 != main_~p7~0#1); 39#L185-1true assume !(0 != main_~p8~0#1); 26#L190-1true assume !(0 != main_~p9~0#1); 41#L195-1true assume !(0 != main_~p10~0#1); 16#L200-1true assume !(0 != main_~p11~0#1); 44#L205-1true assume !(0 != main_~p12~0#1); 25#L210-1true assume !(0 != main_~p13~0#1); 6#L215-1true assume 0 != main_~p14~0#1; 15#L221true assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 54#L220true assume !(0 != main_~p15~0#1); 22#L225-1true [2021-12-21 22:08:24,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:08:24,132 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-21 22:08:24,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:08:24,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311773502] [2021-12-21 22:08:24,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:08:24,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:08:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:08:24,188 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:08:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:08:24,205 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:08:24,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:08:24,207 INFO L85 PathProgramCache]: Analyzing trace with hash -638858682, now seen corresponding path program 1 times [2021-12-21 22:08:24,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:08:24,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859418711] [2021-12-21 22:08:24,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:08:24,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:08:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:08:24,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:08:24,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:08:24,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859418711] [2021-12-21 22:08:24,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859418711] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:08:24,310 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:08:24,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:08:24,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468170260] [2021-12-21 22:08:24,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:08:24,314 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:08:24,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:08:24,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:08:24,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:08:24,340 INFO L87 Difference]: Start difference. First operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 53 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:08:24,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:08:24,385 INFO L93 Difference]: Finished difference Result 105 states and 190 transitions. [2021-12-21 22:08:24,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:08:24,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 190 transitions. [2021-12-21 22:08:24,400 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2021-12-21 22:08:24,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 95 states and 149 transitions. [2021-12-21 22:08:24,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2021-12-21 22:08:24,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2021-12-21 22:08:24,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 149 transitions. [2021-12-21 22:08:24,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:08:24,408 INFO L681 BuchiCegarLoop]: Abstraction has 95 states and 149 transitions. [2021-12-21 22:08:24,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 149 transitions. [2021-12-21 22:08:24,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-12-21 22:08:24,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.568421052631579) internal successors, (149), 94 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:08:24,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 149 transitions. [2021-12-21 22:08:24,436 INFO L704 BuchiCegarLoop]: Abstraction has 95 states and 149 transitions. [2021-12-21 22:08:24,437 INFO L587 BuchiCegarLoop]: Abstraction has 95 states and 149 transitions. [2021-12-21 22:08:24,437 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-21 22:08:24,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 149 transitions. [2021-12-21 22:08:24,441 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2021-12-21 22:08:24,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:08:24,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:08:24,442 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 22:08:24,442 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:08:24,443 INFO L791 eck$LassoCheckResult]: Stem: 218#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); 212#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 174#L225-1 [2021-12-21 22:08:24,443 INFO L793 eck$LassoCheckResult]: Loop: 174#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 210#L58 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;main_~lk15~0#1 := 0; 211#L93 assume !(0 != main_~p1~0#1); 206#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 186#L97-1 assume !(0 != main_~p3~0#1); 187#L101-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 191#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 220#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 182#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 183#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 201#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 192#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 193#L129-1 assume !(0 != main_~p11~0#1); 168#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 169#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 172#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 215#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 226#L149-1 assume !(0 != main_~p1~0#1); 227#L155-1 assume 0 != main_~p2~0#1; 262#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 261#L160 assume !(0 != main_~p3~0#1); 259#L165-1 assume !(0 != main_~p4~0#1); 256#L170-1 assume !(0 != main_~p5~0#1); 255#L175-1 assume !(0 != main_~p6~0#1); 253#L180-1 assume !(0 != main_~p7~0#1); 250#L185-1 assume !(0 != main_~p8~0#1); 249#L190-1 assume !(0 != main_~p9~0#1); 216#L195-1 assume !(0 != main_~p10~0#1); 188#L200-1 assume !(0 != main_~p11~0#1); 189#L205-1 assume !(0 != main_~p12~0#1); 241#L210-1 assume !(0 != main_~p13~0#1); 239#L215-1 assume 0 != main_~p14~0#1; 184#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 185#L220 assume !(0 != main_~p15~0#1); 174#L225-1 [2021-12-21 22:08:24,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:08:24,444 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-21 22:08:24,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:08:24,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181737653] [2021-12-21 22:08:24,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:08:24,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:08:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:08:24,465 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:08:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:08:24,475 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:08:24,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:08:24,477 INFO L85 PathProgramCache]: Analyzing trace with hash -364099068, now seen corresponding path program 1 times [2021-12-21 22:08:24,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:08:24,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379455237] [2021-12-21 22:08:24,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:08:24,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:08:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:08:24,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:08:24,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:08:24,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379455237] [2021-12-21 22:08:24,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379455237] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:08:24,535 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:08:24,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:08:24,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659075042] [2021-12-21 22:08:24,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:08:24,540 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:08:24,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:08:24,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:08:24,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:08:24,542 INFO L87 Difference]: Start difference. First operand 95 states and 149 transitions. cyclomatic complexity: 56 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:08:24,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:08:24,563 INFO L93 Difference]: Finished difference Result 186 states and 290 transitions. [2021-12-21 22:08:24,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:08:24,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 290 transitions. [2021-12-21 22:08:24,567 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2021-12-21 22:08:24,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 186 states and 290 transitions. [2021-12-21 22:08:24,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2021-12-21 22:08:24,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 186 [2021-12-21 22:08:24,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 290 transitions. [2021-12-21 22:08:24,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:08:24,574 INFO L681 BuchiCegarLoop]: Abstraction has 186 states and 290 transitions. [2021-12-21 22:08:24,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 290 transitions. [2021-12-21 22:08:24,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2021-12-21 22:08:24,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 186 states have (on average 1.5591397849462365) internal successors, (290), 185 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:08:24,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 290 transitions. [2021-12-21 22:08:24,582 INFO L704 BuchiCegarLoop]: Abstraction has 186 states and 290 transitions. [2021-12-21 22:08:24,582 INFO L587 BuchiCegarLoop]: Abstraction has 186 states and 290 transitions. [2021-12-21 22:08:24,583 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-21 22:08:24,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 186 states and 290 transitions. [2021-12-21 22:08:24,583 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2021-12-21 22:08:24,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:08:24,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:08:24,585 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 22:08:24,585 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:08:24,586 INFO L791 eck$LassoCheckResult]: Stem: 503#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); 495#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 496#L225-1 [2021-12-21 22:08:24,586 INFO L793 eck$LassoCheckResult]: Loop: 496#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 521#L58 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;main_~lk15~0#1 := 0; 518#L93 assume !(0 != main_~p1~0#1); 519#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 513#L97-1 assume !(0 != main_~p3~0#1); 514#L101-1 assume !(0 != main_~p4~0#1); 589#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 588#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 587#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 586#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 585#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 584#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 583#L129-1 assume !(0 != main_~p11~0#1); 582#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 581#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 580#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 579#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 578#L149-1 assume !(0 != main_~p1~0#1); 577#L155-1 assume 0 != main_~p2~0#1; 576#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 573#L160 assume !(0 != main_~p3~0#1); 569#L165-1 assume !(0 != main_~p4~0#1); 565#L170-1 assume !(0 != main_~p5~0#1); 562#L175-1 assume !(0 != main_~p6~0#1); 558#L180-1 assume !(0 != main_~p7~0#1); 553#L185-1 assume !(0 != main_~p8~0#1); 550#L190-1 assume !(0 != main_~p9~0#1); 546#L195-1 assume !(0 != main_~p10~0#1); 542#L200-1 assume !(0 != main_~p11~0#1); 538#L205-1 assume !(0 != main_~p12~0#1); 534#L210-1 assume !(0 != main_~p13~0#1); 530#L215-1 assume 0 != main_~p14~0#1; 528#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 526#L220 assume !(0 != main_~p15~0#1); 496#L225-1 [2021-12-21 22:08:24,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:08:24,587 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-12-21 22:08:24,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:08:24,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662070306] [2021-12-21 22:08:24,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:08:24,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:08:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:08:24,598 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:08:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:08:24,612 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:08:24,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:08:24,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1022104326, now seen corresponding path program 1 times [2021-12-21 22:08:24,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:08:24,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129872522] [2021-12-21 22:08:24,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:08:24,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:08:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:08:24,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:08:24,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:08:24,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129872522] [2021-12-21 22:08:24,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129872522] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:08:24,659 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:08:24,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:08:24,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930980574] [2021-12-21 22:08:24,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:08:24,660 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:08:24,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:08:24,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:08:24,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:08:24,661 INFO L87 Difference]: Start difference. First operand 186 states and 290 transitions. cyclomatic complexity: 108 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:08:24,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:08:24,676 INFO L93 Difference]: Finished difference Result 366 states and 566 transitions. [2021-12-21 22:08:24,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:08:24,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 366 states and 566 transitions. [2021-12-21 22:08:24,681 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2021-12-21 22:08:24,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 366 states to 366 states and 566 transitions. [2021-12-21 22:08:24,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 366 [2021-12-21 22:08:24,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 366 [2021-12-21 22:08:24,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 366 states and 566 transitions. [2021-12-21 22:08:24,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:08:24,685 INFO L681 BuchiCegarLoop]: Abstraction has 366 states and 566 transitions. [2021-12-21 22:08:24,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states and 566 transitions. [2021-12-21 22:08:24,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2021-12-21 22:08:24,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 366 states have (on average 1.546448087431694) internal successors, (566), 365 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:08:24,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 566 transitions. [2021-12-21 22:08:24,706 INFO L704 BuchiCegarLoop]: Abstraction has 366 states and 566 transitions. [2021-12-21 22:08:24,706 INFO L587 BuchiCegarLoop]: Abstraction has 366 states and 566 transitions. [2021-12-21 22:08:24,706 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-21 22:08:24,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 366 states and 566 transitions. [2021-12-21 22:08:24,708 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2021-12-21 22:08:24,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:08:24,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:08:24,708 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 22:08:24,708 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:08:24,709 INFO L791 eck$LassoCheckResult]: Stem: 1060#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); 1053#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 1054#L225-1 [2021-12-21 22:08:24,709 INFO L793 eck$LassoCheckResult]: Loop: 1054#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1078#L58 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;main_~lk15~0#1 := 0; 1079#L93 assume !(0 != main_~p1~0#1); 1205#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 1223#L97-1 assume !(0 != main_~p3~0#1); 1220#L101-1 assume !(0 != main_~p4~0#1); 1217#L105-1 assume !(0 != main_~p5~0#1); 1215#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1214#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1212#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1210#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1208#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1206#L129-1 assume !(0 != main_~p11~0#1); 1203#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1200#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1197#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 1193#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 1167#L149-1 assume !(0 != main_~p1~0#1); 1165#L155-1 assume 0 != main_~p2~0#1; 1162#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 1160#L160 assume !(0 != main_~p3~0#1); 1156#L165-1 assume !(0 != main_~p4~0#1); 1153#L170-1 assume !(0 != main_~p5~0#1); 1132#L175-1 assume !(0 != main_~p6~0#1); 1128#L180-1 assume !(0 != main_~p7~0#1); 1122#L185-1 assume !(0 != main_~p8~0#1); 1118#L190-1 assume !(0 != main_~p9~0#1); 1117#L195-1 assume !(0 != main_~p10~0#1); 1241#L200-1 assume !(0 != main_~p11~0#1); 1103#L205-1 assume !(0 != main_~p12~0#1); 1102#L210-1 assume !(0 != main_~p13~0#1); 1091#L215-1 assume 0 != main_~p14~0#1; 1092#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 1086#L220 assume !(0 != main_~p15~0#1); 1054#L225-1 [2021-12-21 22:08:24,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:08:24,710 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-12-21 22:08:24,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:08:24,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367502570] [2021-12-21 22:08:24,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:08:24,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:08:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:08:24,717 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:08:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:08:24,723 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:08:24,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:08:24,724 INFO L85 PathProgramCache]: Analyzing trace with hash 512631236, now seen corresponding path program 1 times [2021-12-21 22:08:24,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:08:24,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295138700] [2021-12-21 22:08:24,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:08:24,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:08:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:08:24,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:08:24,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:08:24,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295138700] [2021-12-21 22:08:24,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295138700] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:08:24,769 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:08:24,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:08:24,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537259670] [2021-12-21 22:08:24,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:08:24,770 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:08:24,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:08:24,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:08:24,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:08:24,772 INFO L87 Difference]: Start difference. First operand 366 states and 566 transitions. cyclomatic complexity: 208 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:08:24,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:08:24,790 INFO L93 Difference]: Finished difference Result 722 states and 1106 transitions. [2021-12-21 22:08:24,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:08:24,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 722 states and 1106 transitions. [2021-12-21 22:08:24,795 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2021-12-21 22:08:24,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 722 states to 722 states and 1106 transitions. [2021-12-21 22:08:24,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 722 [2021-12-21 22:08:24,798 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 722 [2021-12-21 22:08:24,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 722 states and 1106 transitions. [2021-12-21 22:08:24,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:08:24,800 INFO L681 BuchiCegarLoop]: Abstraction has 722 states and 1106 transitions. [2021-12-21 22:08:24,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states and 1106 transitions. [2021-12-21 22:08:24,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2021-12-21 22:08:24,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 722 states have (on average 1.5318559556786704) internal successors, (1106), 721 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:08:24,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1106 transitions. [2021-12-21 22:08:24,839 INFO L704 BuchiCegarLoop]: Abstraction has 722 states and 1106 transitions. [2021-12-21 22:08:24,839 INFO L587 BuchiCegarLoop]: Abstraction has 722 states and 1106 transitions. [2021-12-21 22:08:24,839 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-21 22:08:24,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 722 states and 1106 transitions. [2021-12-21 22:08:24,842 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2021-12-21 22:08:24,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:08:24,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:08:24,843 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 22:08:24,843 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:08:24,843 INFO L791 eck$LassoCheckResult]: Stem: 2165#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); 2154#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 2155#L225-1 [2021-12-21 22:08:24,843 INFO L793 eck$LassoCheckResult]: Loop: 2155#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 2351#L58 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;main_~lk15~0#1 := 0; 2348#L93 assume !(0 != main_~p1~0#1); 2349#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 2338#L97-1 assume !(0 != main_~p3~0#1); 2339#L101-1 assume !(0 != main_~p4~0#1); 2327#L105-1 assume !(0 != main_~p5~0#1); 2329#L109-1 assume !(0 != main_~p6~0#1); 2315#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2316#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2303#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 2304#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 2291#L129-1 assume !(0 != main_~p11~0#1); 2292#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 2279#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 2280#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 2267#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 2268#L149-1 assume !(0 != main_~p1~0#1); 2399#L155-1 assume 0 != main_~p2~0#1; 2398#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 2397#L160 assume !(0 != main_~p3~0#1); 2393#L165-1 assume !(0 != main_~p4~0#1); 2391#L170-1 assume !(0 != main_~p5~0#1); 2389#L175-1 assume !(0 != main_~p6~0#1); 2386#L180-1 assume !(0 != main_~p7~0#1); 2381#L185-1 assume !(0 != main_~p8~0#1); 2378#L190-1 assume !(0 != main_~p9~0#1); 2374#L195-1 assume !(0 != main_~p10~0#1); 2370#L200-1 assume !(0 != main_~p11~0#1); 2366#L205-1 assume !(0 != main_~p12~0#1); 2362#L210-1 assume !(0 != main_~p13~0#1); 2359#L215-1 assume 0 != main_~p14~0#1; 2357#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 2356#L220 assume !(0 != main_~p15~0#1); 2155#L225-1 [2021-12-21 22:08:24,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:08:24,844 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-12-21 22:08:24,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:08:24,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671205852] [2021-12-21 22:08:24,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:08:24,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:08:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:08:24,848 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:08:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:08:24,851 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:08:24,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:08:24,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1859108026, now seen corresponding path program 1 times [2021-12-21 22:08:24,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:08:24,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148939746] [2021-12-21 22:08:24,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:08:24,852 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:08:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:08:24,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:08:24,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:08:24,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148939746] [2021-12-21 22:08:24,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148939746] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:08:24,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:08:24,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:08:24,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184354013] [2021-12-21 22:08:24,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:08:24,869 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:08:24,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:08:24,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:08:24,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:08:24,870 INFO L87 Difference]: Start difference. First operand 722 states and 1106 transitions. cyclomatic complexity: 400 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:08:24,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:08:24,881 INFO L93 Difference]: Finished difference Result 1426 states and 2162 transitions. [2021-12-21 22:08:24,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:08:24,882 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1426 states and 2162 transitions. [2021-12-21 22:08:24,888 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2021-12-21 22:08:24,893 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1426 states to 1426 states and 2162 transitions. [2021-12-21 22:08:24,893 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1426 [2021-12-21 22:08:24,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1426 [2021-12-21 22:08:24,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1426 states and 2162 transitions. [2021-12-21 22:08:24,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:08:24,895 INFO L681 BuchiCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2021-12-21 22:08:24,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states and 2162 transitions. [2021-12-21 22:08:24,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1426. [2021-12-21 22:08:24,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1426 states have (on average 1.5161290322580645) internal successors, (2162), 1425 states have internal predecessors, (2162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:08:24,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2162 transitions. [2021-12-21 22:08:24,910 INFO L704 BuchiCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2021-12-21 22:08:24,910 INFO L587 BuchiCegarLoop]: Abstraction has 1426 states and 2162 transitions. [2021-12-21 22:08:24,910 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-21 22:08:24,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1426 states and 2162 transitions. [2021-12-21 22:08:24,914 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2021-12-21 22:08:24,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:08:24,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:08:24,915 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 22:08:24,915 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:08:24,915 INFO L791 eck$LassoCheckResult]: Stem: 4312#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); 4301#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 4302#L225-1 [2021-12-21 22:08:24,915 INFO L793 eck$LassoCheckResult]: Loop: 4302#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 4635#L58 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;main_~lk15~0#1 := 0; 4632#L93 assume !(0 != main_~p1~0#1); 4595#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 4352#L97-1 assume !(0 != main_~p3~0#1); 4353#L101-1 assume !(0 != main_~p4~0#1); 4588#L105-1 assume !(0 != main_~p5~0#1); 4586#L109-1 assume !(0 != main_~p6~0#1); 4580#L113-1 assume !(0 != main_~p7~0#1); 4576#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4572#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 4569#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 4566#L129-1 assume !(0 != main_~p11~0#1); 4563#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 4559#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 4556#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 4553#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 4548#L149-1 assume !(0 != main_~p1~0#1); 4546#L155-1 assume 0 != main_~p2~0#1; 4543#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 4540#L160 assume !(0 != main_~p3~0#1); 4535#L165-1 assume !(0 != main_~p4~0#1); 4536#L170-1 assume !(0 != main_~p5~0#1); 4686#L175-1 assume !(0 != main_~p6~0#1); 4682#L180-1 assume !(0 != main_~p7~0#1); 4678#L185-1 assume !(0 != main_~p8~0#1); 4674#L190-1 assume !(0 != main_~p9~0#1); 4668#L195-1 assume !(0 != main_~p10~0#1); 4663#L200-1 assume !(0 != main_~p11~0#1); 4658#L205-1 assume !(0 != main_~p12~0#1); 4653#L210-1 assume !(0 != main_~p13~0#1); 4648#L215-1 assume 0 != main_~p14~0#1; 4645#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 4642#L220 assume !(0 != main_~p15~0#1); 4302#L225-1 [2021-12-21 22:08:24,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:08:24,916 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-12-21 22:08:24,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:08:24,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226174268] [2021-12-21 22:08:24,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:08:24,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:08:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:08:24,919 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:08:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:08:24,923 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:08:24,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:08:24,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1797068412, now seen corresponding path program 1 times [2021-12-21 22:08:24,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:08:24,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233217246] [2021-12-21 22:08:24,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:08:24,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:08:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:08:24,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:08:24,956 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:08:24,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233217246] [2021-12-21 22:08:24,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233217246] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:08:24,957 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:08:24,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:08:24,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676770601] [2021-12-21 22:08:24,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:08:24,958 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:08:24,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:08:24,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:08:24,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:08:24,959 INFO L87 Difference]: Start difference. First operand 1426 states and 2162 transitions. cyclomatic complexity: 768 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:08:24,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:08:24,978 INFO L93 Difference]: Finished difference Result 2818 states and 4226 transitions. [2021-12-21 22:08:24,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:08:24,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2818 states and 4226 transitions. [2021-12-21 22:08:25,000 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2021-12-21 22:08:25,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2818 states to 2818 states and 4226 transitions. [2021-12-21 22:08:25,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2818 [2021-12-21 22:08:25,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2818 [2021-12-21 22:08:25,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2818 states and 4226 transitions. [2021-12-21 22:08:25,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:08:25,016 INFO L681 BuchiCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2021-12-21 22:08:25,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states and 4226 transitions. [2021-12-21 22:08:25,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2818. [2021-12-21 22:08:25,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2818 states have (on average 1.4996451383960256) internal successors, (4226), 2817 states have internal predecessors, (4226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:08:25,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 4226 transitions. [2021-12-21 22:08:25,080 INFO L704 BuchiCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2021-12-21 22:08:25,081 INFO L587 BuchiCegarLoop]: Abstraction has 2818 states and 4226 transitions. [2021-12-21 22:08:25,081 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-21 22:08:25,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2818 states and 4226 transitions. [2021-12-21 22:08:25,099 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2021-12-21 22:08:25,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:08:25,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:08:25,102 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 22:08:25,102 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:08:25,102 INFO L791 eck$LassoCheckResult]: Stem: 8565#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); 8557#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 8558#L225-1 [2021-12-21 22:08:25,103 INFO L793 eck$LassoCheckResult]: Loop: 8558#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 8705#L58 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;main_~lk15~0#1 := 0; 8706#L93 assume !(0 != main_~p1~0#1); 8830#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 8829#L97-1 assume !(0 != main_~p3~0#1); 8827#L101-1 assume !(0 != main_~p4~0#1); 8824#L105-1 assume !(0 != main_~p5~0#1); 8820#L109-1 assume !(0 != main_~p6~0#1); 8816#L113-1 assume !(0 != main_~p7~0#1); 8812#L117-1 assume !(0 != main_~p8~0#1); 8810#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 8808#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 8806#L129-1 assume !(0 != main_~p11~0#1); 8804#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 8802#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 8800#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 8798#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 8795#L149-1 assume !(0 != main_~p1~0#1); 8796#L155-1 assume 0 != main_~p2~0#1; 8785#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 8786#L160 assume !(0 != main_~p3~0#1); 8777#L165-1 assume !(0 != main_~p4~0#1); 8778#L170-1 assume !(0 != main_~p5~0#1); 8766#L175-1 assume !(0 != main_~p6~0#1); 8768#L180-1 assume !(0 != main_~p7~0#1); 8756#L185-1 assume !(0 != main_~p8~0#1); 8757#L190-1 assume !(0 != main_~p9~0#1); 8747#L195-1 assume !(0 != main_~p10~0#1); 8746#L200-1 assume !(0 != main_~p11~0#1); 8735#L205-1 assume !(0 != main_~p12~0#1); 8734#L210-1 assume !(0 != main_~p13~0#1); 8722#L215-1 assume 0 != main_~p14~0#1; 8723#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 8715#L220 assume !(0 != main_~p15~0#1); 8558#L225-1 [2021-12-21 22:08:25,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:08:25,103 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-12-21 22:08:25,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:08:25,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757829586] [2021-12-21 22:08:25,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:08:25,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:08:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:08:25,112 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:08:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:08:25,126 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:08:25,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:08:25,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1656519802, now seen corresponding path program 1 times [2021-12-21 22:08:25,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:08:25,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663358489] [2021-12-21 22:08:25,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:08:25,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:08:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:08:25,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:08:25,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:08:25,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663358489] [2021-12-21 22:08:25,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663358489] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:08:25,162 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:08:25,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:08:25,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678877210] [2021-12-21 22:08:25,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:08:25,162 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:08:25,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:08:25,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:08:25,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:08:25,163 INFO L87 Difference]: Start difference. First operand 2818 states and 4226 transitions. cyclomatic complexity: 1472 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:08:25,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:08:25,191 INFO L93 Difference]: Finished difference Result 5570 states and 8258 transitions. [2021-12-21 22:08:25,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:08:25,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5570 states and 8258 transitions. [2021-12-21 22:08:25,233 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2021-12-21 22:08:25,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5570 states to 5570 states and 8258 transitions. [2021-12-21 22:08:25,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5570 [2021-12-21 22:08:25,279 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5570 [2021-12-21 22:08:25,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5570 states and 8258 transitions. [2021-12-21 22:08:25,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:08:25,282 INFO L681 BuchiCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2021-12-21 22:08:25,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states and 8258 transitions. [2021-12-21 22:08:25,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 5570. [2021-12-21 22:08:25,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5570 states, 5570 states have (on average 1.4825852782764812) internal successors, (8258), 5569 states have internal predecessors, (8258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:08:25,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5570 states to 5570 states and 8258 transitions. [2021-12-21 22:08:25,377 INFO L704 BuchiCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2021-12-21 22:08:25,377 INFO L587 BuchiCegarLoop]: Abstraction has 5570 states and 8258 transitions. [2021-12-21 22:08:25,377 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-21 22:08:25,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5570 states and 8258 transitions. [2021-12-21 22:08:25,391 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2021-12-21 22:08:25,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:08:25,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:08:25,391 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 22:08:25,391 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:08:25,392 INFO L791 eck$LassoCheckResult]: Stem: 16967#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); 16953#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 16954#L225-1 [2021-12-21 22:08:25,392 INFO L793 eck$LassoCheckResult]: Loop: 16954#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 17157#L58 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;main_~lk15~0#1 := 0; 17155#L93 assume !(0 != main_~p1~0#1); 17151#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 17147#L97-1 assume !(0 != main_~p3~0#1); 17140#L101-1 assume !(0 != main_~p4~0#1); 17132#L105-1 assume !(0 != main_~p5~0#1); 17127#L109-1 assume !(0 != main_~p6~0#1); 17120#L113-1 assume !(0 != main_~p7~0#1); 17112#L117-1 assume !(0 != main_~p8~0#1); 17104#L121-1 assume !(0 != main_~p9~0#1); 17099#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 17095#L129-1 assume !(0 != main_~p11~0#1); 17091#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 17087#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 17083#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 17079#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 17073#L149-1 assume !(0 != main_~p1~0#1); 17074#L155-1 assume 0 != main_~p2~0#1; 17211#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 17206#L160 assume !(0 != main_~p3~0#1); 17201#L165-1 assume !(0 != main_~p4~0#1); 17197#L170-1 assume !(0 != main_~p5~0#1); 17193#L175-1 assume !(0 != main_~p6~0#1); 17191#L180-1 assume !(0 != main_~p7~0#1); 17189#L185-1 assume !(0 != main_~p8~0#1); 17185#L190-1 assume !(0 != main_~p9~0#1); 17182#L195-1 assume !(0 != main_~p10~0#1); 17178#L200-1 assume !(0 != main_~p11~0#1); 17174#L205-1 assume !(0 != main_~p12~0#1); 17170#L210-1 assume !(0 != main_~p13~0#1); 17166#L215-1 assume 0 != main_~p14~0#1; 17164#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 17162#L220 assume !(0 != main_~p15~0#1); 16954#L225-1 [2021-12-21 22:08:25,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:08:25,392 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-12-21 22:08:25,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:08:25,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654825516] [2021-12-21 22:08:25,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:08:25,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:08:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:08:25,395 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:08:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:08:25,398 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:08:25,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:08:25,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1790533308, now seen corresponding path program 1 times [2021-12-21 22:08:25,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:08:25,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476082774] [2021-12-21 22:08:25,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:08:25,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:08:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:08:25,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:08:25,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:08:25,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476082774] [2021-12-21 22:08:25,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476082774] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:08:25,411 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:08:25,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:08:25,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069139951] [2021-12-21 22:08:25,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:08:25,411 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:08:25,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:08:25,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:08:25,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:08:25,412 INFO L87 Difference]: Start difference. First operand 5570 states and 8258 transitions. cyclomatic complexity: 2816 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:08:25,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:08:25,446 INFO L93 Difference]: Finished difference Result 11010 states and 16130 transitions. [2021-12-21 22:08:25,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:08:25,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11010 states and 16130 transitions. [2021-12-21 22:08:25,489 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2021-12-21 22:08:25,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11010 states to 11010 states and 16130 transitions. [2021-12-21 22:08:25,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11010 [2021-12-21 22:08:25,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11010 [2021-12-21 22:08:25,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11010 states and 16130 transitions. [2021-12-21 22:08:25,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:08:25,598 INFO L681 BuchiCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2021-12-21 22:08:25,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11010 states and 16130 transitions. [2021-12-21 22:08:25,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11010 to 11010. [2021-12-21 22:08:25,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11010 states, 11010 states have (on average 1.4650317892824705) internal successors, (16130), 11009 states have internal predecessors, (16130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:08:25,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11010 states to 11010 states and 16130 transitions. [2021-12-21 22:08:25,765 INFO L704 BuchiCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2021-12-21 22:08:25,765 INFO L587 BuchiCegarLoop]: Abstraction has 11010 states and 16130 transitions. [2021-12-21 22:08:25,765 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-21 22:08:25,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11010 states and 16130 transitions. [2021-12-21 22:08:25,800 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2021-12-21 22:08:25,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:08:25,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:08:25,801 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 22:08:25,801 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:08:25,801 INFO L791 eck$LassoCheckResult]: Stem: 33550#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); 33536#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 33537#L225-1 [2021-12-21 22:08:25,801 INFO L793 eck$LassoCheckResult]: Loop: 33537#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 33841#L58 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;main_~lk15~0#1 := 0; 33839#L93 assume !(0 != main_~p1~0#1); 33838#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 33837#L97-1 assume !(0 != main_~p3~0#1); 33835#L101-1 assume !(0 != main_~p4~0#1); 33833#L105-1 assume !(0 != main_~p5~0#1); 33831#L109-1 assume !(0 != main_~p6~0#1); 33830#L113-1 assume !(0 != main_~p7~0#1); 33828#L117-1 assume !(0 != main_~p8~0#1); 33824#L121-1 assume !(0 != main_~p9~0#1); 33821#L125-1 assume !(0 != main_~p10~0#1); 33815#L129-1 assume !(0 != main_~p11~0#1); 33816#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 33807#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 33808#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 33799#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 33800#L149-1 assume !(0 != main_~p1~0#1); 33789#L155-1 assume 0 != main_~p2~0#1; 33790#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 33781#L160 assume !(0 != main_~p3~0#1); 33780#L165-1 assume !(0 != main_~p4~0#1); 33720#L170-1 assume !(0 != main_~p5~0#1); 33721#L175-1 assume !(0 != main_~p6~0#1); 33711#L180-1 assume !(0 != main_~p7~0#1); 33712#L185-1 assume !(0 != main_~p8~0#1); 33699#L190-1 assume !(0 != main_~p9~0#1); 33701#L195-1 assume !(0 != main_~p10~0#1); 33851#L200-1 assume !(0 != main_~p11~0#1); 33849#L205-1 assume !(0 != main_~p12~0#1); 33847#L210-1 assume !(0 != main_~p13~0#1); 33845#L215-1 assume 0 != main_~p14~0#1; 33844#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 33843#L220 assume !(0 != main_~p15~0#1); 33537#L225-1 [2021-12-21 22:08:25,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:08:25,801 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-12-21 22:08:25,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:08:25,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904030589] [2021-12-21 22:08:25,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:08:25,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:08:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:08:25,804 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:08:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:08:25,806 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:08:25,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:08:25,806 INFO L85 PathProgramCache]: Analyzing trace with hash 698995654, now seen corresponding path program 1 times [2021-12-21 22:08:25,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:08:25,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141955287] [2021-12-21 22:08:25,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:08:25,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:08:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:08:25,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:08:25,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:08:25,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141955287] [2021-12-21 22:08:25,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141955287] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:08:25,818 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:08:25,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:08:25,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907803268] [2021-12-21 22:08:25,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:08:25,819 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:08:25,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:08:25,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:08:25,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:08:25,819 INFO L87 Difference]: Start difference. First operand 11010 states and 16130 transitions. cyclomatic complexity: 5376 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:08:25,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:08:25,942 INFO L93 Difference]: Finished difference Result 21762 states and 31490 transitions. [2021-12-21 22:08:25,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:08:25,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21762 states and 31490 transitions. [2021-12-21 22:08:26,128 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2021-12-21 22:08:26,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21762 states to 21762 states and 31490 transitions. [2021-12-21 22:08:26,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21762 [2021-12-21 22:08:26,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21762 [2021-12-21 22:08:26,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21762 states and 31490 transitions. [2021-12-21 22:08:26,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:08:26,300 INFO L681 BuchiCegarLoop]: Abstraction has 21762 states and 31490 transitions. [2021-12-21 22:08:26,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21762 states and 31490 transitions. [2021-12-21 22:08:26,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21762 to 21762. [2021-12-21 22:08:26,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21762 states, 21762 states have (on average 1.447017737340318) internal successors, (31490), 21761 states have internal predecessors, (31490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:08:26,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21762 states to 21762 states and 31490 transitions. [2021-12-21 22:08:26,605 INFO L704 BuchiCegarLoop]: Abstraction has 21762 states and 31490 transitions. [2021-12-21 22:08:26,605 INFO L587 BuchiCegarLoop]: Abstraction has 21762 states and 31490 transitions. [2021-12-21 22:08:26,605 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-21 22:08:26,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21762 states and 31490 transitions. [2021-12-21 22:08:26,654 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2021-12-21 22:08:26,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:08:26,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:08:26,655 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 22:08:26,655 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:08:26,655 INFO L791 eck$LassoCheckResult]: Stem: 66321#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); 66308#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 66309#L225-1 [2021-12-21 22:08:26,656 INFO L793 eck$LassoCheckResult]: Loop: 66309#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 66490#L58 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;main_~lk15~0#1 := 0; 66486#L93 assume !(0 != main_~p1~0#1); 66484#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 66482#L97-1 assume !(0 != main_~p3~0#1); 66478#L101-1 assume !(0 != main_~p4~0#1); 66474#L105-1 assume !(0 != main_~p5~0#1); 66472#L109-1 assume !(0 != main_~p6~0#1); 66468#L113-1 assume !(0 != main_~p7~0#1); 66464#L117-1 assume !(0 != main_~p8~0#1); 66460#L121-1 assume !(0 != main_~p9~0#1); 66456#L125-1 assume !(0 != main_~p10~0#1); 66454#L129-1 assume !(0 != main_~p11~0#1); 66450#L133-1 assume !(0 != main_~p12~0#1); 66448#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 66446#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 66444#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 66440#L149-1 assume !(0 != main_~p1~0#1); 66438#L155-1 assume 0 != main_~p2~0#1; 66436#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 66433#L160 assume !(0 != main_~p3~0#1); 66428#L165-1 assume !(0 != main_~p4~0#1); 66424#L170-1 assume !(0 != main_~p5~0#1); 66421#L175-1 assume !(0 != main_~p6~0#1); 66422#L180-1 assume !(0 != main_~p7~0#1); 66521#L185-1 assume !(0 != main_~p8~0#1); 66517#L190-1 assume !(0 != main_~p9~0#1); 66513#L195-1 assume !(0 != main_~p10~0#1); 66510#L200-1 assume !(0 != main_~p11~0#1); 66505#L205-1 assume !(0 != main_~p12~0#1); 66502#L210-1 assume !(0 != main_~p13~0#1); 66499#L215-1 assume 0 != main_~p14~0#1; 66497#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 66494#L220 assume !(0 != main_~p15~0#1); 66309#L225-1 [2021-12-21 22:08:26,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:08:26,656 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2021-12-21 22:08:26,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:08:26,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624620124] [2021-12-21 22:08:26,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:08:26,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:08:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:08:26,661 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:08:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:08:26,667 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:08:26,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:08:26,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1121697480, now seen corresponding path program 1 times [2021-12-21 22:08:26,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:08:26,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509360647] [2021-12-21 22:08:26,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:08:26,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:08:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:08:26,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:08:26,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:08:26,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509360647] [2021-12-21 22:08:26,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509360647] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:08:26,686 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:08:26,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:08:26,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226461373] [2021-12-21 22:08:26,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:08:26,686 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:08:26,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:08:26,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:08:26,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:08:26,687 INFO L87 Difference]: Start difference. First operand 21762 states and 31490 transitions. cyclomatic complexity: 10240 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:08:26,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:08:26,847 INFO L93 Difference]: Finished difference Result 43010 states and 61442 transitions. [2021-12-21 22:08:26,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:08:26,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43010 states and 61442 transitions. [2021-12-21 22:08:27,146 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2021-12-21 22:08:27,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43010 states to 43010 states and 61442 transitions. [2021-12-21 22:08:27,321 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43010 [2021-12-21 22:08:27,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43010 [2021-12-21 22:08:27,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43010 states and 61442 transitions. [2021-12-21 22:08:27,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:08:27,372 INFO L681 BuchiCegarLoop]: Abstraction has 43010 states and 61442 transitions. [2021-12-21 22:08:27,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43010 states and 61442 transitions. [2021-12-21 22:08:27,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43010 to 43010. [2021-12-21 22:08:27,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43010 states, 43010 states have (on average 1.4285514996512438) internal successors, (61442), 43009 states have internal predecessors, (61442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:08:27,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43010 states to 43010 states and 61442 transitions. [2021-12-21 22:08:27,916 INFO L704 BuchiCegarLoop]: Abstraction has 43010 states and 61442 transitions. [2021-12-21 22:08:27,916 INFO L587 BuchiCegarLoop]: Abstraction has 43010 states and 61442 transitions. [2021-12-21 22:08:27,916 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-21 22:08:27,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43010 states and 61442 transitions. [2021-12-21 22:08:28,019 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2021-12-21 22:08:28,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:08:28,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:08:28,020 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 22:08:28,021 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:08:28,021 INFO L791 eck$LassoCheckResult]: Stem: 131107#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); 131095#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 131096#L225-1 [2021-12-21 22:08:28,021 INFO L793 eck$LassoCheckResult]: Loop: 131096#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 132419#L58 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;main_~lk15~0#1 := 0; 132416#L93 assume !(0 != main_~p1~0#1); 132413#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 132411#L97-1 assume !(0 != main_~p3~0#1); 132408#L101-1 assume !(0 != main_~p4~0#1); 132404#L105-1 assume !(0 != main_~p5~0#1); 132400#L109-1 assume !(0 != main_~p6~0#1); 132396#L113-1 assume !(0 != main_~p7~0#1); 132392#L117-1 assume !(0 != main_~p8~0#1); 132388#L121-1 assume !(0 != main_~p9~0#1); 132384#L125-1 assume !(0 != main_~p10~0#1); 132381#L129-1 assume !(0 != main_~p11~0#1); 132378#L133-1 assume !(0 != main_~p12~0#1); 132379#L137-1 assume !(0 != main_~p13~0#1); 132483#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 132481#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 132476#L149-1 assume !(0 != main_~p1~0#1); 132474#L155-1 assume 0 != main_~p2~0#1; 132472#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 132304#L160 assume !(0 != main_~p3~0#1); 132303#L165-1 assume !(0 != main_~p4~0#1); 132269#L170-1 assume !(0 != main_~p5~0#1); 132270#L175-1 assume !(0 != main_~p6~0#1); 132246#L180-1 assume !(0 != main_~p7~0#1); 132247#L185-1 assume !(0 != main_~p8~0#1); 132158#L190-1 assume !(0 != main_~p9~0#1); 132160#L195-1 assume !(0 != main_~p10~0#1); 132436#L200-1 assume !(0 != main_~p11~0#1); 132431#L205-1 assume !(0 != main_~p12~0#1); 132429#L210-1 assume !(0 != main_~p13~0#1); 132428#L215-1 assume 0 != main_~p14~0#1; 132426#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 132424#L220 assume !(0 != main_~p15~0#1); 131096#L225-1 [2021-12-21 22:08:28,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:08:28,021 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2021-12-21 22:08:28,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:08:28,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875767287] [2021-12-21 22:08:28,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:08:28,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:08:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:08:28,024 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:08:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:08:28,026 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:08:28,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:08:28,027 INFO L85 PathProgramCache]: Analyzing trace with hash 304049030, now seen corresponding path program 1 times [2021-12-21 22:08:28,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:08:28,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325291121] [2021-12-21 22:08:28,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:08:28,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:08:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:08:28,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:08:28,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:08:28,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325291121] [2021-12-21 22:08:28,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325291121] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:08:28,037 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:08:28,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 22:08:28,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288960678] [2021-12-21 22:08:28,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:08:28,037 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:08:28,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:08:28,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:08:28,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:08:28,038 INFO L87 Difference]: Start difference. First operand 43010 states and 61442 transitions. cyclomatic complexity: 19456 Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:08:28,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:08:28,351 INFO L93 Difference]: Finished difference Result 84994 states and 119810 transitions. [2021-12-21 22:08:28,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:08:28,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84994 states and 119810 transitions. [2021-12-21 22:08:28,834 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2021-12-21 22:08:29,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84994 states to 84994 states and 119810 transitions. [2021-12-21 22:08:29,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84994 [2021-12-21 22:08:29,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84994 [2021-12-21 22:08:29,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84994 states and 119810 transitions. [2021-12-21 22:08:29,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:08:29,251 INFO L681 BuchiCegarLoop]: Abstraction has 84994 states and 119810 transitions. [2021-12-21 22:08:29,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84994 states and 119810 transitions. [2021-12-21 22:08:29,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84994 to 84994. [2021-12-21 22:08:29,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84994 states, 84994 states have (on average 1.409628914982234) internal successors, (119810), 84993 states have internal predecessors, (119810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:08:30,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84994 states to 84994 states and 119810 transitions. [2021-12-21 22:08:30,044 INFO L704 BuchiCegarLoop]: Abstraction has 84994 states and 119810 transitions. [2021-12-21 22:08:30,044 INFO L587 BuchiCegarLoop]: Abstraction has 84994 states and 119810 transitions. [2021-12-21 22:08:30,044 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-21 22:08:30,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84994 states and 119810 transitions. [2021-12-21 22:08:30,458 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2021-12-21 22:08:30,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:08:30,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:08:30,460 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 22:08:30,460 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:08:30,460 INFO L791 eck$LassoCheckResult]: Stem: 259110#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); 259098#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_#t~nondet19#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_~p15~0#1, main_~lk15~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;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 259099#L225-1 [2021-12-21 22:08:30,460 INFO L793 eck$LassoCheckResult]: Loop: 259099#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 260713#L58 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;main_~lk15~0#1 := 0; 260700#L93 assume !(0 != main_~p1~0#1); 260702#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 260686#L97-1 assume !(0 != main_~p3~0#1); 260687#L101-1 assume !(0 != main_~p4~0#1); 260670#L105-1 assume !(0 != main_~p5~0#1); 260672#L109-1 assume !(0 != main_~p6~0#1); 260644#L113-1 assume !(0 != main_~p7~0#1); 260646#L117-1 assume !(0 != main_~p8~0#1); 260618#L121-1 assume !(0 != main_~p9~0#1); 260620#L125-1 assume !(0 != main_~p10~0#1); 260839#L129-1 assume !(0 != main_~p11~0#1); 260837#L133-1 assume !(0 != main_~p12~0#1); 260833#L137-1 assume !(0 != main_~p13~0#1); 260830#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 260827#L145-1 assume !(0 != main_~p15~0#1); 260824#L149-1 assume !(0 != main_~p1~0#1); 260821#L155-1 assume 0 != main_~p2~0#1; 260818#L161 assume !(1 != main_~lk2~0#1);main_~lk2~0#1 := 0; 260796#L160 assume !(0 != main_~p3~0#1); 260787#L165-1 assume !(0 != main_~p4~0#1); 260779#L170-1 assume !(0 != main_~p5~0#1); 260771#L175-1 assume !(0 != main_~p6~0#1); 260765#L180-1 assume !(0 != main_~p7~0#1); 260761#L185-1 assume !(0 != main_~p8~0#1); 260758#L190-1 assume !(0 != main_~p9~0#1); 260756#L195-1 assume !(0 != main_~p10~0#1); 260753#L200-1 assume !(0 != main_~p11~0#1); 260730#L205-1 assume !(0 != main_~p12~0#1); 260732#L210-1 assume !(0 != main_~p13~0#1); 260746#L215-1 assume 0 != main_~p14~0#1; 260738#L221 assume !(1 != main_~lk14~0#1);main_~lk14~0#1 := 0; 260739#L220 assume !(0 != main_~p15~0#1); 259099#L225-1 [2021-12-21 22:08:30,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:08:30,461 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2021-12-21 22:08:30,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:08:30,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135135236] [2021-12-21 22:08:30,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:08:30,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:08:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:08:30,464 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:08:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:08:30,466 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:08:30,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:08:30,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1690095676, now seen corresponding path program 1 times [2021-12-21 22:08:30,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:08:30,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006369533] [2021-12-21 22:08:30,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:08:30,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:08:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:08:30,470 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:08:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:08:30,475 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:08:30,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:08:30,475 INFO L85 PathProgramCache]: Analyzing trace with hash 365150982, now seen corresponding path program 1 times [2021-12-21 22:08:30,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:08:30,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101699462] [2021-12-21 22:08:30,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:08:30,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:08:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:08:30,479 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:08:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:08:30,485 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:08:30,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.12 10:08:30 BoogieIcfgContainer [2021-12-21 22:08:30,812 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-21 22:08:30,812 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 22:08:30,812 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 22:08:30,812 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 22:08:30,813 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:08:23" (3/4) ... [2021-12-21 22:08:30,814 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-12-21 22:08:30,840 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-21 22:08:30,840 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 22:08:30,840 INFO L158 Benchmark]: Toolchain (without parser) took 7528.51ms. Allocated memory was 94.4MB in the beginning and 8.1GB in the end (delta: 8.0GB). Free memory was 60.9MB in the beginning and 7.3GB in the end (delta: -7.3GB). Peak memory consumption was 714.2MB. Max. memory is 16.1GB. [2021-12-21 22:08:30,841 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 94.4MB. Free memory was 67.7MB in the beginning and 67.7MB in the end (delta: 31.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 22:08:30,841 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.76ms. Allocated memory is still 94.4MB. Free memory was 60.7MB in the beginning and 69.4MB in the end (delta: -8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-21 22:08:30,841 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.09ms. Allocated memory is still 94.4MB. Free memory was 69.4MB in the beginning and 67.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 22:08:30,841 INFO L158 Benchmark]: Boogie Preprocessor took 40.37ms. Allocated memory is still 94.4MB. Free memory was 67.7MB in the beginning and 66.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 22:08:30,841 INFO L158 Benchmark]: RCFGBuilder took 343.77ms. Allocated memory is still 94.4MB. Free memory was 66.1MB in the beginning and 53.1MB in the end (delta: 13.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-21 22:08:30,842 INFO L158 Benchmark]: BuchiAutomizer took 6823.85ms. Allocated memory was 94.4MB in the beginning and 8.1GB in the end (delta: 8.0GB). Free memory was 53.1MB in the beginning and 7.3GB in the end (delta: -7.3GB). Peak memory consumption was 704.3MB. Max. memory is 16.1GB. [2021-12-21 22:08:30,842 INFO L158 Benchmark]: Witness Printer took 27.84ms. Allocated memory is still 8.1GB. Free memory was 7.3GB in the beginning and 7.3GB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-21 22:08:30,843 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.10ms. Allocated memory is still 94.4MB. Free memory was 67.7MB in the beginning and 67.7MB in the end (delta: 31.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.76ms. Allocated memory is still 94.4MB. Free memory was 60.7MB in the beginning and 69.4MB in the end (delta: -8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.09ms. Allocated memory is still 94.4MB. Free memory was 69.4MB in the beginning and 67.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.37ms. Allocated memory is still 94.4MB. Free memory was 67.7MB in the beginning and 66.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 343.77ms. Allocated memory is still 94.4MB. Free memory was 66.1MB in the beginning and 53.1MB in the end (delta: 13.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 6823.85ms. Allocated memory was 94.4MB in the beginning and 8.1GB in the end (delta: 8.0GB). Free memory was 53.1MB in the beginning and 7.3GB in the end (delta: -7.3GB). Peak memory consumption was 704.3MB. Max. memory is 16.1GB. * Witness Printer took 27.84ms. Allocated memory is still 8.1GB. Free memory was 7.3GB in the beginning and 7.3GB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. 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 11 terminating modules (11 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.11 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 84994 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.7s and 12 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 2.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 1.9s Buchi closure took 0.0s. Biggest automaton had 84994 states and ocurred in iteration 11. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 648 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 648 mSDsluCounter, 2072 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 801 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 1271 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI11 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 56]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {p11=0, p13=0, lk5=0, p1=0, NULL=0, p9=0, NULL=1, cond=5, p12=0, p10=0, p14=6, p8=0, lk6=0, lk15=0, p3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@288cbc35=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4381c4de=0, p15=0, \result=0, lk7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@424878aa=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@cd8373e=0, lk14=0, p2=4, lk8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@f06d24c=5, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2723f013=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5b65ad0d=0, lk13=0, lk9=0, lk12=0, p5=0, lk2=0, p4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7ad8db9a=0, lk11=0, lk1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7019690a=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3778a454=0, p7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5c651d1f=0, lk10=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7e7068f5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4132acf2=0, p6=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@79fd15bb=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@262f4154=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@16c9092d=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 56]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; Loop: [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 [L93] COND FALSE !(p1 != 0) [L97] COND TRUE p2 != 0 [L98] lk2 = 1 [L101] COND FALSE !(p3 != 0) [L105] COND FALSE !(p4 != 0) [L109] COND FALSE !(p5 != 0) [L113] COND FALSE !(p6 != 0) [L117] COND FALSE !(p7 != 0) [L121] COND FALSE !(p8 != 0) [L125] COND FALSE !(p9 != 0) [L129] COND FALSE !(p10 != 0) [L133] COND FALSE !(p11 != 0) [L137] COND FALSE !(p12 != 0) [L141] COND FALSE !(p13 != 0) [L145] COND TRUE p14 != 0 [L146] lk14 = 1 [L149] COND FALSE !(p15 != 0) [L155] COND FALSE !(p1 != 0) [L160] COND TRUE p2 != 0 [L161] COND FALSE !(lk2 != 1) [L162] lk2 = 0 [L165] COND FALSE !(p3 != 0) [L170] COND FALSE !(p4 != 0) [L175] COND FALSE !(p5 != 0) [L180] COND FALSE !(p6 != 0) [L185] COND FALSE !(p7 != 0) [L190] COND FALSE !(p8 != 0) [L195] COND FALSE !(p9 != 0) [L200] COND FALSE !(p10 != 0) [L205] COND FALSE !(p11 != 0) [L210] COND FALSE !(p12 != 0) [L215] COND FALSE !(p13 != 0) [L220] COND TRUE p14 != 0 [L221] COND FALSE !(lk14 != 1) [L222] lk14 = 0 [L225] COND FALSE !(p15 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-12-21 22:08:30,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with 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)