./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3a877d22 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_11.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 dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:06:55,544 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:06:55,550 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:06:55,595 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:06:55,596 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:06:55,596 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:06:55,597 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:06:55,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:06:55,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:06:55,609 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:06:55,610 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:06:55,611 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:06:55,611 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:06:55,612 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:06:55,613 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:06:55,613 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:06:55,614 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:06:55,615 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:06:55,616 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:06:55,617 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:06:55,618 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:06:55,619 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:06:55,620 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:06:55,621 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:06:55,623 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:06:55,623 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:06:55,623 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:06:55,624 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:06:55,624 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:06:55,625 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:06:55,625 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:06:55,626 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:06:55,626 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:06:55,627 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:06:55,628 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:06:55,628 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:06:55,628 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:06:55,629 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:06:55,629 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:06:55,629 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:06:55,630 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:06:55,631 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-15 17:06:55,647 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:06:55,647 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:06:55,648 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:06:55,648 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:06:55,649 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:06:55,649 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:06:55,649 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:06:55,649 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:06:55,649 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:06:55,650 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:06:55,650 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:06:55,650 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:06:55,650 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:06:55,650 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:06:55,650 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:06:55,650 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:06:55,651 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:06:55,651 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:06:55,651 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:06:55,651 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:06:55,651 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:06:55,651 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:06:55,651 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:06:55,652 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:06:55,652 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:06:55,652 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:06:55,652 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:06:55,652 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:06:55,652 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:06:55,652 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:06:55,653 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:06:55,653 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:06:55,653 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:06:55,653 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 -> dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 [2021-12-15 17:06:55,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:06:55,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:06:55,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:06:55,890 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:06:55,891 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:06:55,892 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_11.c [2021-12-15 17:06:55,939 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d55e8fcd/9e86ab1da23941aba06e1888bd823e8b/FLAG4e879a9b5 [2021-12-15 17:06:56,311 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:06:56,312 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c [2021-12-15 17:06:56,318 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d55e8fcd/9e86ab1da23941aba06e1888bd823e8b/FLAG4e879a9b5 [2021-12-15 17:06:56,332 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d55e8fcd/9e86ab1da23941aba06e1888bd823e8b [2021-12-15 17:06:56,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:06:56,334 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:06:56,337 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:06:56,337 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:06:56,339 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:06:56,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:06:56" (1/1) ... [2021-12-15 17:06:56,342 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@208acd56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:56, skipping insertion in model container [2021-12-15 17:06:56,342 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:06:56" (1/1) ... [2021-12-15 17:06:56,347 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:06:56,365 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:06:56,526 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_11.c[4246,4259] [2021-12-15 17:06:56,528 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:06:56,535 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:06:56,563 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_11.c[4246,4259] [2021-12-15 17:06:56,569 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:06:56,579 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:06:56,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:56 WrapperNode [2021-12-15 17:06:56,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:06:56,580 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:06:56,580 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:06:56,580 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:06:56,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:56" (1/1) ... [2021-12-15 17:06:56,598 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:56" (1/1) ... [2021-12-15 17:06:56,619 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 137 [2021-12-15 17:06:56,620 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:06:56,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:06:56,621 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:06:56,621 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:06:56,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:56" (1/1) ... [2021-12-15 17:06:56,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:56" (1/1) ... [2021-12-15 17:06:56,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:56" (1/1) ... [2021-12-15 17:06:56,636 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:56" (1/1) ... [2021-12-15 17:06:56,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:56" (1/1) ... [2021-12-15 17:06:56,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:56" (1/1) ... [2021-12-15 17:06:56,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:56" (1/1) ... [2021-12-15 17:06:56,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:06:56,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:06:56,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:06:56,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:06:56,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:56" (1/1) ... [2021-12-15 17:06:56,683 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:06:56,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:56,713 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-15 17:06:56,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:06:56,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:06:56,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:06:56,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:06:56,726 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-15 17:06:56,793 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:06:56,794 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:06:56,974 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:06:56,978 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:06:56,979 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 17:06:56,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:06:56 BoogieIcfgContainer [2021-12-15 17:06:56,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:06:56,981 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:06:56,981 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:06:56,983 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:06:56,984 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:06:56,984 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:06:56" (1/3) ... [2021-12-15 17:06:56,985 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30e18daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:06:56, skipping insertion in model container [2021-12-15 17:06:56,985 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:06:56,985 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:56" (2/3) ... [2021-12-15 17:06:56,985 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30e18daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:06:56, skipping insertion in model container [2021-12-15 17:06:56,986 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:06:56,986 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:06:56" (3/3) ... [2021-12-15 17:06:56,987 INFO L388 chiAutomizerObserver]: Analyzing ICFG test_locks_11.c [2021-12-15 17:06:57,020 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:06:57,020 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:06:57,020 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:06:57,020 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:06:57,020 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:06:57,020 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:06:57,021 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:06:57,021 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:06:57,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 41 states have internal predecessors, (77), 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-15 17:06:57,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2021-12-15 17:06:57,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:57,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:57,050 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:57,050 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] [2021-12-15 17:06:57,050 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:06:57,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 41 states have internal predecessors, (77), 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-15 17:06:57,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2021-12-15 17:06:57,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:57,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:57,053 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:57,053 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] [2021-12-15 17:06:57,058 INFO L791 eck$LassoCheckResult]: Stem: 24#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(16, 2);call #Ultimate.allocInit(12, 3); 10#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_~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_~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;havoc main_~cond~0#1; 28#L169-1true [2021-12-15 17:06:57,059 INFO L793 eck$LassoCheckResult]: Loop: 28#L169-1true assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 15#L46true 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; 41#L73true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 42#L73-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 29#L77-1true assume !(0 != main_~p3~0#1); 6#L81-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 25#L85-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 19#L89-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 13#L93-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 22#L97-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 30#L101-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 36#L105-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 26#L109-1true assume !(0 != main_~p11~0#1); 21#L113-1true assume !(0 != main_~p1~0#1); 37#L119-1true assume !(0 != main_~p2~0#1); 9#L124-1true assume !(0 != main_~p3~0#1); 12#L129-1true assume !(0 != main_~p4~0#1); 20#L134-1true assume !(0 != main_~p5~0#1); 11#L139-1true assume !(0 != main_~p6~0#1); 4#L144-1true assume !(0 != main_~p7~0#1); 35#L149-1true assume !(0 != main_~p8~0#1); 18#L154-1true assume !(0 != main_~p9~0#1); 8#L159-1true assume !(0 != main_~p10~0#1); 39#L164-1true assume !(0 != main_~p11~0#1); 28#L169-1true [2021-12-15 17:06:57,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:57,066 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-15 17:06:57,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:57,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951028715] [2021-12-15 17:06:57,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:57,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:57,140 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:57,181 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:57,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:57,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1430849892, now seen corresponding path program 1 times [2021-12-15 17:06:57,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:57,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049493914] [2021-12-15 17:06:57,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:57,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:57,251 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-15 17:06:57,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:57,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049493914] [2021-12-15 17:06:57,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049493914] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:57,252 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:57,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:57,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757197528] [2021-12-15 17:06:57,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:57,257 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:57,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:57,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:57,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:57,283 INFO L87 Difference]: Start difference. First operand has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 41 states have internal predecessors, (77), 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 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-15 17:06:57,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:57,331 INFO L93 Difference]: Finished difference Result 81 states and 142 transitions. [2021-12-15 17:06:57,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:57,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 142 transitions. [2021-12-15 17:06:57,340 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2021-12-15 17:06:57,344 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 71 states and 113 transitions. [2021-12-15 17:06:57,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2021-12-15 17:06:57,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2021-12-15 17:06:57,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 113 transitions. [2021-12-15 17:06:57,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:57,346 INFO L681 BuchiCegarLoop]: Abstraction has 71 states and 113 transitions. [2021-12-15 17:06:57,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 113 transitions. [2021-12-15 17:06:57,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-12-15 17:06:57,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.591549295774648) internal successors, (113), 70 states have internal predecessors, (113), 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-15 17:06:57,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 113 transitions. [2021-12-15 17:06:57,380 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 113 transitions. [2021-12-15 17:06:57,380 INFO L587 BuchiCegarLoop]: Abstraction has 71 states and 113 transitions. [2021-12-15 17:06:57,381 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:06:57,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 113 transitions. [2021-12-15 17:06:57,388 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 69 [2021-12-15 17:06:57,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:57,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:57,389 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:57,389 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] [2021-12-15 17:06:57,390 INFO L791 eck$LassoCheckResult]: Stem: 164#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(16, 2);call #Ultimate.allocInit(12, 3); 145#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_~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_~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;havoc main_~cond~0#1; 146#L169-1 [2021-12-15 17:06:57,390 INFO L793 eck$LassoCheckResult]: Loop: 146#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 179#L46 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; 178#L73 assume !(0 != main_~p1~0#1); 174#L73-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 168#L77-1 assume !(0 != main_~p3~0#1); 135#L81-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 136#L85-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 159#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 149#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 150#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 169#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 170#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 177#L109-1 assume !(0 != main_~p11~0#1); 175#L113-1 assume !(0 != main_~p1~0#1); 176#L119-1 assume !(0 != main_~p2~0#1); 196#L124-1 assume !(0 != main_~p3~0#1); 194#L129-1 assume !(0 != main_~p4~0#1); 192#L134-1 assume !(0 != main_~p5~0#1); 190#L139-1 assume !(0 != main_~p6~0#1); 188#L144-1 assume !(0 != main_~p7~0#1); 186#L149-1 assume !(0 != main_~p8~0#1); 157#L154-1 assume !(0 != main_~p9~0#1); 139#L159-1 assume !(0 != main_~p10~0#1); 141#L164-1 assume !(0 != main_~p11~0#1); 146#L169-1 [2021-12-15 17:06:57,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:57,391 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-15 17:06:57,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:57,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395068539] [2021-12-15 17:06:57,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:57,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:57,412 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:57,417 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:57,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:57,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1649704610, now seen corresponding path program 1 times [2021-12-15 17:06:57,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:57,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994244086] [2021-12-15 17:06:57,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:57,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:57,452 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-15 17:06:57,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:57,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994244086] [2021-12-15 17:06:57,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994244086] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:57,453 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:57,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:57,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962578863] [2021-12-15 17:06:57,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:57,453 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:57,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:57,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:57,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:57,454 INFO L87 Difference]: Start difference. First operand 71 states and 113 transitions. cyclomatic complexity: 44 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-15 17:06:57,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:57,468 INFO L93 Difference]: Finished difference Result 138 states and 218 transitions. [2021-12-15 17:06:57,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:57,469 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 218 transitions. [2021-12-15 17:06:57,471 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2021-12-15 17:06:57,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 138 states and 218 transitions. [2021-12-15 17:06:57,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2021-12-15 17:06:57,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 138 [2021-12-15 17:06:57,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 218 transitions. [2021-12-15 17:06:57,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:57,473 INFO L681 BuchiCegarLoop]: Abstraction has 138 states and 218 transitions. [2021-12-15 17:06:57,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 218 transitions. [2021-12-15 17:06:57,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2021-12-15 17:06:57,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 138 states have (on average 1.5797101449275361) internal successors, (218), 137 states have internal predecessors, (218), 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-15 17:06:57,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 218 transitions. [2021-12-15 17:06:57,483 INFO L704 BuchiCegarLoop]: Abstraction has 138 states and 218 transitions. [2021-12-15 17:06:57,483 INFO L587 BuchiCegarLoop]: Abstraction has 138 states and 218 transitions. [2021-12-15 17:06:57,483 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:06:57,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 138 states and 218 transitions. [2021-12-15 17:06:57,485 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 136 [2021-12-15 17:06:57,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:57,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:57,488 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:57,489 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] [2021-12-15 17:06:57,489 INFO L791 eck$LassoCheckResult]: Stem: 379#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(16, 2);call #Ultimate.allocInit(12, 3); 360#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_~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_~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;havoc main_~cond~0#1; 361#L169-1 [2021-12-15 17:06:57,489 INFO L793 eck$LassoCheckResult]: Loop: 361#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 369#L46 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; 370#L73 assume !(0 != main_~p1~0#1); 425#L73-2 assume !(0 != main_~p2~0#1); 424#L77-1 assume !(0 != main_~p3~0#1); 421#L81-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 418#L85-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 415#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 412#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 409#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 406#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 404#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 395#L109-1 assume !(0 != main_~p11~0#1); 396#L113-1 assume !(0 != main_~p1~0#1); 400#L119-1 assume !(0 != main_~p2~0#1); 357#L124-1 assume !(0 != main_~p3~0#1); 358#L129-1 assume !(0 != main_~p4~0#1); 353#L134-1 assume !(0 != main_~p5~0#1); 362#L139-1 assume !(0 != main_~p6~0#1); 363#L144-1 assume !(0 != main_~p7~0#1); 456#L149-1 assume !(0 != main_~p8~0#1); 454#L154-1 assume !(0 != main_~p9~0#1); 452#L159-1 assume !(0 != main_~p10~0#1); 388#L164-1 assume !(0 != main_~p11~0#1); 361#L169-1 [2021-12-15 17:06:57,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:57,490 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-12-15 17:06:57,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:57,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662865092] [2021-12-15 17:06:57,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:57,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:57,498 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:57,506 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:57,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:57,509 INFO L85 PathProgramCache]: Analyzing trace with hash 2072406436, now seen corresponding path program 1 times [2021-12-15 17:06:57,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:57,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564421906] [2021-12-15 17:06:57,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:57,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:57,540 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-15 17:06:57,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:57,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564421906] [2021-12-15 17:06:57,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564421906] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:57,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:57,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:57,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791103123] [2021-12-15 17:06:57,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:57,542 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:57,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:57,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:57,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:57,542 INFO L87 Difference]: Start difference. First operand 138 states and 218 transitions. cyclomatic complexity: 84 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-15 17:06:57,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:57,560 INFO L93 Difference]: Finished difference Result 270 states and 422 transitions. [2021-12-15 17:06:57,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:57,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 422 transitions. [2021-12-15 17:06:57,563 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2021-12-15 17:06:57,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 270 states and 422 transitions. [2021-12-15 17:06:57,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 270 [2021-12-15 17:06:57,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 270 [2021-12-15 17:06:57,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 270 states and 422 transitions. [2021-12-15 17:06:57,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:57,566 INFO L681 BuchiCegarLoop]: Abstraction has 270 states and 422 transitions. [2021-12-15 17:06:57,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 422 transitions. [2021-12-15 17:06:57,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2021-12-15 17:06:57,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 270 states have (on average 1.5629629629629629) internal successors, (422), 269 states have internal predecessors, (422), 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-15 17:06:57,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 422 transitions. [2021-12-15 17:06:57,597 INFO L704 BuchiCegarLoop]: Abstraction has 270 states and 422 transitions. [2021-12-15 17:06:57,597 INFO L587 BuchiCegarLoop]: Abstraction has 270 states and 422 transitions. [2021-12-15 17:06:57,597 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:06:57,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 422 transitions. [2021-12-15 17:06:57,598 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 268 [2021-12-15 17:06:57,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:57,598 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:57,598 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:57,599 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] [2021-12-15 17:06:57,599 INFO L791 eck$LassoCheckResult]: Stem: 793#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(16, 2);call #Ultimate.allocInit(12, 3); 774#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_~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_~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;havoc main_~cond~0#1; 775#L169-1 [2021-12-15 17:06:57,599 INFO L793 eck$LassoCheckResult]: Loop: 775#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 917#L46 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; 916#L73 assume !(0 != main_~p1~0#1); 914#L73-2 assume !(0 != main_~p2~0#1); 910#L77-1 assume !(0 != main_~p3~0#1); 906#L81-1 assume !(0 != main_~p4~0#1); 902#L85-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 898#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 894#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 890#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 886#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 882#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 878#L109-1 assume !(0 != main_~p11~0#1); 872#L113-1 assume !(0 != main_~p1~0#1); 873#L119-1 assume !(0 != main_~p2~0#1); 940#L124-1 assume !(0 != main_~p3~0#1); 937#L129-1 assume !(0 != main_~p4~0#1); 936#L134-1 assume !(0 != main_~p5~0#1); 933#L139-1 assume !(0 != main_~p6~0#1); 848#L144-1 assume !(0 != main_~p7~0#1); 843#L149-1 assume !(0 != main_~p8~0#1); 842#L154-1 assume !(0 != main_~p9~0#1); 831#L159-1 assume !(0 != main_~p10~0#1); 830#L164-1 assume !(0 != main_~p11~0#1); 775#L169-1 [2021-12-15 17:06:57,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:57,599 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-12-15 17:06:57,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:57,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300426514] [2021-12-15 17:06:57,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:57,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:57,608 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:57,619 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:57,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:57,620 INFO L85 PathProgramCache]: Analyzing trace with hash 383462694, now seen corresponding path program 1 times [2021-12-15 17:06:57,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:57,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894983538] [2021-12-15 17:06:57,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:57,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:57,642 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-15 17:06:57,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:57,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894983538] [2021-12-15 17:06:57,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894983538] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:57,645 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:57,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:57,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681080545] [2021-12-15 17:06:57,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:57,645 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:57,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:57,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:57,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:57,647 INFO L87 Difference]: Start difference. First operand 270 states and 422 transitions. cyclomatic complexity: 160 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-15 17:06:57,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:57,689 INFO L93 Difference]: Finished difference Result 530 states and 818 transitions. [2021-12-15 17:06:57,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:57,690 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 530 states and 818 transitions. [2021-12-15 17:06:57,693 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2021-12-15 17:06:57,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 530 states to 530 states and 818 transitions. [2021-12-15 17:06:57,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 530 [2021-12-15 17:06:57,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 530 [2021-12-15 17:06:57,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 530 states and 818 transitions. [2021-12-15 17:06:57,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:57,705 INFO L681 BuchiCegarLoop]: Abstraction has 530 states and 818 transitions. [2021-12-15 17:06:57,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states and 818 transitions. [2021-12-15 17:06:57,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2021-12-15 17:06:57,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 530 states have (on average 1.5433962264150944) internal successors, (818), 529 states have internal predecessors, (818), 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-15 17:06:57,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 818 transitions. [2021-12-15 17:06:57,728 INFO L704 BuchiCegarLoop]: Abstraction has 530 states and 818 transitions. [2021-12-15 17:06:57,728 INFO L587 BuchiCegarLoop]: Abstraction has 530 states and 818 transitions. [2021-12-15 17:06:57,728 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-15 17:06:57,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 530 states and 818 transitions. [2021-12-15 17:06:57,741 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 528 [2021-12-15 17:06:57,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:57,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:57,742 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:57,742 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] [2021-12-15 17:06:57,742 INFO L791 eck$LassoCheckResult]: Stem: 1600#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(16, 2);call #Ultimate.allocInit(12, 3); 1580#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_~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_~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;havoc main_~cond~0#1; 1581#L169-1 [2021-12-15 17:06:57,743 INFO L793 eck$LassoCheckResult]: Loop: 1581#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 1663#L46 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; 1661#L73 assume !(0 != main_~p1~0#1); 1657#L73-2 assume !(0 != main_~p2~0#1); 1655#L77-1 assume !(0 != main_~p3~0#1); 1651#L81-1 assume !(0 != main_~p4~0#1); 1647#L85-1 assume !(0 != main_~p5~0#1); 1645#L89-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1643#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1641#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1639#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1637#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1635#L109-1 assume !(0 != main_~p11~0#1); 1632#L113-1 assume !(0 != main_~p1~0#1); 1633#L119-1 assume !(0 != main_~p2~0#1); 1699#L124-1 assume !(0 != main_~p3~0#1); 1694#L129-1 assume !(0 != main_~p4~0#1); 1690#L134-1 assume !(0 != main_~p5~0#1); 1687#L139-1 assume !(0 != main_~p6~0#1); 1683#L144-1 assume !(0 != main_~p7~0#1); 1679#L149-1 assume !(0 != main_~p8~0#1); 1675#L154-1 assume !(0 != main_~p9~0#1); 1671#L159-1 assume !(0 != main_~p10~0#1); 1667#L164-1 assume !(0 != main_~p11~0#1); 1581#L169-1 [2021-12-15 17:06:57,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:57,743 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-12-15 17:06:57,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:57,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766303443] [2021-12-15 17:06:57,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:57,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:57,748 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:57,752 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:57,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:57,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1610682012, now seen corresponding path program 1 times [2021-12-15 17:06:57,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:57,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981738546] [2021-12-15 17:06:57,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:57,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:57,794 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-15 17:06:57,794 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:57,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981738546] [2021-12-15 17:06:57,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981738546] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:57,794 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:57,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:57,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096265065] [2021-12-15 17:06:57,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:57,795 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:57,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:57,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:57,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:57,795 INFO L87 Difference]: Start difference. First operand 530 states and 818 transitions. cyclomatic complexity: 304 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-15 17:06:57,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:57,814 INFO L93 Difference]: Finished difference Result 1042 states and 1586 transitions. [2021-12-15 17:06:57,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:57,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1042 states and 1586 transitions. [2021-12-15 17:06:57,819 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2021-12-15 17:06:57,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1042 states to 1042 states and 1586 transitions. [2021-12-15 17:06:57,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1042 [2021-12-15 17:06:57,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1042 [2021-12-15 17:06:57,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1042 states and 1586 transitions. [2021-12-15 17:06:57,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:57,825 INFO L681 BuchiCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2021-12-15 17:06:57,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states and 1586 transitions. [2021-12-15 17:06:57,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1042. [2021-12-15 17:06:57,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 1042 states have (on average 1.5220729366602688) internal successors, (1586), 1041 states have internal predecessors, (1586), 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-15 17:06:57,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1586 transitions. [2021-12-15 17:06:57,839 INFO L704 BuchiCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2021-12-15 17:06:57,839 INFO L587 BuchiCegarLoop]: Abstraction has 1042 states and 1586 transitions. [2021-12-15 17:06:57,839 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-15 17:06:57,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1042 states and 1586 transitions. [2021-12-15 17:06:57,842 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1040 [2021-12-15 17:06:57,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:57,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:57,843 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:57,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] [2021-12-15 17:06:57,843 INFO L791 eck$LassoCheckResult]: Stem: 3176#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(16, 2);call #Ultimate.allocInit(12, 3); 3158#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_~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_~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;havoc main_~cond~0#1; 3159#L169-1 [2021-12-15 17:06:57,844 INFO L793 eck$LassoCheckResult]: Loop: 3159#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 3298#L46 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; 3294#L73 assume !(0 != main_~p1~0#1); 3290#L73-2 assume !(0 != main_~p2~0#1); 3288#L77-1 assume !(0 != main_~p3~0#1); 3286#L81-1 assume !(0 != main_~p4~0#1); 3282#L85-1 assume !(0 != main_~p5~0#1); 3278#L89-1 assume !(0 != main_~p6~0#1); 3276#L93-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3274#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 3272#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 3270#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3268#L109-1 assume !(0 != main_~p11~0#1); 3264#L113-1 assume !(0 != main_~p1~0#1); 3260#L119-1 assume !(0 != main_~p2~0#1); 3257#L124-1 assume !(0 != main_~p3~0#1); 3253#L129-1 assume !(0 != main_~p4~0#1); 3254#L134-1 assume !(0 != main_~p5~0#1); 3321#L139-1 assume !(0 != main_~p6~0#1); 3318#L144-1 assume !(0 != main_~p7~0#1); 3314#L149-1 assume !(0 != main_~p8~0#1); 3310#L154-1 assume !(0 != main_~p9~0#1); 3306#L159-1 assume !(0 != main_~p10~0#1); 3302#L164-1 assume !(0 != main_~p11~0#1); 3159#L169-1 [2021-12-15 17:06:57,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:57,844 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-12-15 17:06:57,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:57,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329671380] [2021-12-15 17:06:57,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:57,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:57,848 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:57,851 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:57,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:57,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1095937382, now seen corresponding path program 1 times [2021-12-15 17:06:57,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:57,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122335533] [2021-12-15 17:06:57,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:57,852 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:57,875 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-15 17:06:57,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:57,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122335533] [2021-12-15 17:06:57,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122335533] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:57,876 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:57,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:57,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639387867] [2021-12-15 17:06:57,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:57,877 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:57,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:57,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:57,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:57,878 INFO L87 Difference]: Start difference. First operand 1042 states and 1586 transitions. cyclomatic complexity: 576 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-15 17:06:57,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:57,891 INFO L93 Difference]: Finished difference Result 2050 states and 3074 transitions. [2021-12-15 17:06:57,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:57,892 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2050 states and 3074 transitions. [2021-12-15 17:06:57,903 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2021-12-15 17:06:57,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2050 states to 2050 states and 3074 transitions. [2021-12-15 17:06:57,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2050 [2021-12-15 17:06:57,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2050 [2021-12-15 17:06:57,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2050 states and 3074 transitions. [2021-12-15 17:06:57,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:57,914 INFO L681 BuchiCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2021-12-15 17:06:57,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states and 3074 transitions. [2021-12-15 17:06:57,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 2050. [2021-12-15 17:06:57,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2050 states, 2050 states have (on average 1.4995121951219512) internal successors, (3074), 2049 states have internal predecessors, (3074), 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-15 17:06:57,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 3074 transitions. [2021-12-15 17:06:57,951 INFO L704 BuchiCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2021-12-15 17:06:57,951 INFO L587 BuchiCegarLoop]: Abstraction has 2050 states and 3074 transitions. [2021-12-15 17:06:57,952 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-15 17:06:57,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2050 states and 3074 transitions. [2021-12-15 17:06:57,960 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2048 [2021-12-15 17:06:57,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:57,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:57,962 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:57,962 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] [2021-12-15 17:06:57,962 INFO L791 eck$LassoCheckResult]: Stem: 6275#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(16, 2);call #Ultimate.allocInit(12, 3); 6255#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_~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_~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;havoc main_~cond~0#1; 6256#L169-1 [2021-12-15 17:06:57,963 INFO L793 eck$LassoCheckResult]: Loop: 6256#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 6363#L46 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; 6361#L73 assume !(0 != main_~p1~0#1); 6357#L73-2 assume !(0 != main_~p2~0#1); 6355#L77-1 assume !(0 != main_~p3~0#1); 6351#L81-1 assume !(0 != main_~p4~0#1); 6347#L85-1 assume !(0 != main_~p5~0#1); 6343#L89-1 assume !(0 != main_~p6~0#1); 6339#L93-1 assume !(0 != main_~p7~0#1); 6337#L97-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 6335#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 6333#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 6331#L109-1 assume !(0 != main_~p11~0#1); 6328#L113-1 assume !(0 != main_~p1~0#1); 6329#L119-1 assume !(0 != main_~p2~0#1); 6399#L124-1 assume !(0 != main_~p3~0#1); 6394#L129-1 assume !(0 != main_~p4~0#1); 6390#L134-1 assume !(0 != main_~p5~0#1); 6386#L139-1 assume !(0 != main_~p6~0#1); 6382#L144-1 assume !(0 != main_~p7~0#1); 6379#L149-1 assume !(0 != main_~p8~0#1); 6375#L154-1 assume !(0 != main_~p9~0#1); 6371#L159-1 assume !(0 != main_~p10~0#1); 6367#L164-1 assume !(0 != main_~p11~0#1); 6256#L169-1 [2021-12-15 17:06:57,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:57,967 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-12-15 17:06:57,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:57,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10965038] [2021-12-15 17:06:57,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:57,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:57,971 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:57,974 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:57,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:57,975 INFO L85 PathProgramCache]: Analyzing trace with hash 74869028, now seen corresponding path program 1 times [2021-12-15 17:06:57,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:57,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427115578] [2021-12-15 17:06:57,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:57,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:57,990 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-15 17:06:57,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:57,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427115578] [2021-12-15 17:06:57,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427115578] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:57,990 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:57,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:57,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269910723] [2021-12-15 17:06:57,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:57,991 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:57,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:57,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:57,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:57,992 INFO L87 Difference]: Start difference. First operand 2050 states and 3074 transitions. cyclomatic complexity: 1088 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-15 17:06:58,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:58,017 INFO L93 Difference]: Finished difference Result 4034 states and 5954 transitions. [2021-12-15 17:06:58,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:58,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4034 states and 5954 transitions. [2021-12-15 17:06:58,037 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2021-12-15 17:06:58,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4034 states to 4034 states and 5954 transitions. [2021-12-15 17:06:58,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4034 [2021-12-15 17:06:58,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4034 [2021-12-15 17:06:58,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4034 states and 5954 transitions. [2021-12-15 17:06:58,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:58,059 INFO L681 BuchiCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2021-12-15 17:06:58,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4034 states and 5954 transitions. [2021-12-15 17:06:58,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4034 to 4034. [2021-12-15 17:06:58,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4034 states, 4034 states have (on average 1.4759543877045116) internal successors, (5954), 4033 states have internal predecessors, (5954), 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-15 17:06:58,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4034 states to 4034 states and 5954 transitions. [2021-12-15 17:06:58,157 INFO L704 BuchiCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2021-12-15 17:06:58,157 INFO L587 BuchiCegarLoop]: Abstraction has 4034 states and 5954 transitions. [2021-12-15 17:06:58,157 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-15 17:06:58,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4034 states and 5954 transitions. [2021-12-15 17:06:58,182 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4032 [2021-12-15 17:06:58,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:58,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:58,183 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:58,183 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] [2021-12-15 17:06:58,183 INFO L791 eck$LassoCheckResult]: Stem: 12367#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(16, 2);call #Ultimate.allocInit(12, 3); 12345#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_~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_~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;havoc main_~cond~0#1; 12346#L169-1 [2021-12-15 17:06:58,183 INFO L793 eck$LassoCheckResult]: Loop: 12346#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 12506#L46 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; 12500#L73 assume !(0 != main_~p1~0#1); 12494#L73-2 assume !(0 != main_~p2~0#1); 12495#L77-1 assume !(0 != main_~p3~0#1); 12689#L81-1 assume !(0 != main_~p4~0#1); 12687#L85-1 assume !(0 != main_~p5~0#1); 12685#L89-1 assume !(0 != main_~p6~0#1); 12450#L93-1 assume !(0 != main_~p7~0#1); 12452#L97-1 assume !(0 != main_~p8~0#1); 12638#L101-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 12634#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 12630#L109-1 assume !(0 != main_~p11~0#1); 12626#L113-1 assume !(0 != main_~p1~0#1); 12627#L119-1 assume !(0 != main_~p2~0#1); 12684#L124-1 assume !(0 != main_~p3~0#1); 12681#L129-1 assume !(0 != main_~p4~0#1); 12679#L134-1 assume !(0 != main_~p5~0#1); 12677#L139-1 assume !(0 != main_~p6~0#1); 12675#L144-1 assume !(0 != main_~p7~0#1); 12672#L149-1 assume !(0 != main_~p8~0#1); 12670#L154-1 assume !(0 != main_~p9~0#1); 12532#L159-1 assume !(0 != main_~p10~0#1); 12518#L164-1 assume !(0 != main_~p11~0#1); 12346#L169-1 [2021-12-15 17:06:58,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:58,184 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-12-15 17:06:58,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:58,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169835587] [2021-12-15 17:06:58,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:58,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:58,191 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:58,194 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:58,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:58,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1204994650, now seen corresponding path program 1 times [2021-12-15 17:06:58,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:58,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701636766] [2021-12-15 17:06:58,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:58,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:58,223 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-15 17:06:58,224 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:58,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701636766] [2021-12-15 17:06:58,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701636766] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:58,224 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:58,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:58,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439759599] [2021-12-15 17:06:58,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:58,225 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:58,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:58,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:58,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:58,226 INFO L87 Difference]: Start difference. First operand 4034 states and 5954 transitions. cyclomatic complexity: 2048 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-15 17:06:58,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:58,258 INFO L93 Difference]: Finished difference Result 7938 states and 11522 transitions. [2021-12-15 17:06:58,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:58,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7938 states and 11522 transitions. [2021-12-15 17:06:58,296 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2021-12-15 17:06:58,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7938 states to 7938 states and 11522 transitions. [2021-12-15 17:06:58,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7938 [2021-12-15 17:06:58,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7938 [2021-12-15 17:06:58,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7938 states and 11522 transitions. [2021-12-15 17:06:58,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:58,363 INFO L681 BuchiCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2021-12-15 17:06:58,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7938 states and 11522 transitions. [2021-12-15 17:06:58,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7938 to 7938. [2021-12-15 17:06:58,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7938 states, 7938 states have (on average 1.4514991181657848) internal successors, (11522), 7937 states have internal predecessors, (11522), 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-15 17:06:58,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7938 states to 7938 states and 11522 transitions. [2021-12-15 17:06:58,549 INFO L704 BuchiCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2021-12-15 17:06:58,549 INFO L587 BuchiCegarLoop]: Abstraction has 7938 states and 11522 transitions. [2021-12-15 17:06:58,549 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-15 17:06:58,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7938 states and 11522 transitions. [2021-12-15 17:06:58,580 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 7936 [2021-12-15 17:06:58,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:58,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:58,582 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:58,582 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] [2021-12-15 17:06:58,582 INFO L791 eck$LassoCheckResult]: Stem: 24342#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(16, 2);call #Ultimate.allocInit(12, 3); 24323#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_~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_~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;havoc main_~cond~0#1; 24324#L169-1 [2021-12-15 17:06:58,582 INFO L793 eck$LassoCheckResult]: Loop: 24324#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 24735#L46 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; 24728#L73 assume !(0 != main_~p1~0#1); 24720#L73-2 assume !(0 != main_~p2~0#1); 24716#L77-1 assume !(0 != main_~p3~0#1); 24714#L81-1 assume !(0 != main_~p4~0#1); 24712#L85-1 assume !(0 != main_~p5~0#1); 24710#L89-1 assume !(0 != main_~p6~0#1); 24709#L93-1 assume !(0 != main_~p7~0#1); 24707#L97-1 assume !(0 != main_~p8~0#1); 24706#L101-1 assume !(0 != main_~p9~0#1); 24702#L105-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 24699#L109-1 assume !(0 != main_~p11~0#1); 24695#L113-1 assume !(0 != main_~p1~0#1); 24681#L119-1 assume !(0 != main_~p2~0#1); 24678#L124-1 assume !(0 != main_~p3~0#1); 24669#L129-1 assume !(0 != main_~p4~0#1); 24659#L134-1 assume !(0 != main_~p5~0#1); 24649#L139-1 assume !(0 != main_~p6~0#1); 24639#L144-1 assume !(0 != main_~p7~0#1); 24630#L149-1 assume !(0 != main_~p8~0#1); 24631#L154-1 assume !(0 != main_~p9~0#1); 24832#L159-1 assume !(0 != main_~p10~0#1); 24746#L164-1 assume !(0 != main_~p11~0#1); 24324#L169-1 [2021-12-15 17:06:58,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:58,583 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-12-15 17:06:58,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:58,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335029141] [2021-12-15 17:06:58,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:58,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:58,592 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:58,608 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:58,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:58,609 INFO L85 PathProgramCache]: Analyzing trace with hash 2078855396, now seen corresponding path program 1 times [2021-12-15 17:06:58,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:58,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191307777] [2021-12-15 17:06:58,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:58,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:58,645 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-15 17:06:58,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:58,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191307777] [2021-12-15 17:06:58,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191307777] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:58,646 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:58,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:58,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805713575] [2021-12-15 17:06:58,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:58,647 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:58,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:58,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:58,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:58,648 INFO L87 Difference]: Start difference. First operand 7938 states and 11522 transitions. cyclomatic complexity: 3840 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-15 17:06:58,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:58,750 INFO L93 Difference]: Finished difference Result 15618 states and 22274 transitions. [2021-12-15 17:06:58,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:58,751 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15618 states and 22274 transitions. [2021-12-15 17:06:58,927 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2021-12-15 17:06:59,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15618 states to 15618 states and 22274 transitions. [2021-12-15 17:06:59,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15618 [2021-12-15 17:06:59,049 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15618 [2021-12-15 17:06:59,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15618 states and 22274 transitions. [2021-12-15 17:06:59,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:59,065 INFO L681 BuchiCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2021-12-15 17:06:59,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15618 states and 22274 transitions. [2021-12-15 17:06:59,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15618 to 15618. [2021-12-15 17:06:59,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15618 states, 15618 states have (on average 1.4261749263670125) internal successors, (22274), 15617 states have internal predecessors, (22274), 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-15 17:06:59,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15618 states to 15618 states and 22274 transitions. [2021-12-15 17:06:59,396 INFO L704 BuchiCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2021-12-15 17:06:59,396 INFO L587 BuchiCegarLoop]: Abstraction has 15618 states and 22274 transitions. [2021-12-15 17:06:59,396 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-15 17:06:59,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15618 states and 22274 transitions. [2021-12-15 17:06:59,499 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 15616 [2021-12-15 17:06:59,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:59,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:59,501 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:59,501 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] [2021-12-15 17:06:59,501 INFO L791 eck$LassoCheckResult]: Stem: 47906#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(16, 2);call #Ultimate.allocInit(12, 3); 47884#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_~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_~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;havoc main_~cond~0#1; 47885#L169-1 [2021-12-15 17:06:59,501 INFO L793 eck$LassoCheckResult]: Loop: 47885#L169-1 assume !false;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; 48601#L46 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; 48598#L73 assume !(0 != main_~p1~0#1); 48594#L73-2 assume !(0 != main_~p2~0#1); 48591#L77-1 assume !(0 != main_~p3~0#1); 48588#L81-1 assume !(0 != main_~p4~0#1); 48584#L85-1 assume !(0 != main_~p5~0#1); 48580#L89-1 assume !(0 != main_~p6~0#1); 48576#L93-1 assume !(0 != main_~p7~0#1); 48572#L97-1 assume !(0 != main_~p8~0#1); 48568#L101-1 assume !(0 != main_~p9~0#1); 48569#L105-1 assume !(0 != main_~p10~0#1); 48527#L109-1 assume !(0 != main_~p11~0#1); 48528#L113-1 assume !(0 != main_~p1~0#1); 48643#L119-1 assume !(0 != main_~p2~0#1); 48637#L124-1 assume !(0 != main_~p3~0#1); 48631#L129-1 assume !(0 != main_~p4~0#1); 48626#L134-1 assume !(0 != main_~p5~0#1); 48622#L139-1 assume !(0 != main_~p6~0#1); 48617#L144-1 assume !(0 != main_~p7~0#1); 48612#L149-1 assume !(0 != main_~p8~0#1); 48609#L154-1 assume !(0 != main_~p9~0#1); 48607#L159-1 assume !(0 != main_~p10~0#1); 48606#L164-1 assume !(0 != main_~p11~0#1); 47885#L169-1 [2021-12-15 17:06:59,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:59,502 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2021-12-15 17:06:59,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:59,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626185937] [2021-12-15 17:06:59,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:59,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:59,506 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:59,510 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:59,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:59,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1492049382, now seen corresponding path program 1 times [2021-12-15 17:06:59,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:59,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634019930] [2021-12-15 17:06:59,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:59,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:59,515 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:59,550 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:59,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:59,551 INFO L85 PathProgramCache]: Analyzing trace with hash 376454056, now seen corresponding path program 1 times [2021-12-15 17:06:59,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:59,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855299151] [2021-12-15 17:06:59,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:59,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:59,556 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:59,560 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:59,727 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.UnsupportedOperationException: Set is immutable at de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.removeSuperfluousVars(UnmodifiableTransFormula.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:273) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.getTrivialTransFormula(TransFormulaBuilder.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:548) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLoopTermination(LassoCheck.java:944) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:855) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-15 17:06:59,731 INFO L158 Benchmark]: Toolchain (without parser) took 3395.64ms. Allocated memory was 113.2MB in the beginning and 285.2MB in the end (delta: 172.0MB). Free memory was 83.3MB in the beginning and 141.0MB in the end (delta: -57.7MB). Peak memory consumption was 114.7MB. Max. memory is 16.1GB. [2021-12-15 17:06:59,731 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 88.1MB. Free memory is still 45.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:06:59,731 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.81ms. Allocated memory is still 113.2MB. Free memory was 83.0MB in the beginning and 89.7MB in the end (delta: -6.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-15 17:06:59,732 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.64ms. Allocated memory is still 113.2MB. Free memory was 89.7MB in the beginning and 88.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:06:59,732 INFO L158 Benchmark]: Boogie Preprocessor took 54.93ms. Allocated memory is still 113.2MB. Free memory was 88.2MB in the beginning and 86.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:06:59,732 INFO L158 Benchmark]: RCFGBuilder took 304.31ms. Allocated memory is still 113.2MB. Free memory was 86.8MB in the beginning and 74.9MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-15 17:06:59,733 INFO L158 Benchmark]: BuchiAutomizer took 2748.76ms. Allocated memory was 113.2MB in the beginning and 285.2MB in the end (delta: 172.0MB). Free memory was 74.9MB in the beginning and 141.0MB in the end (delta: -66.1MB). Peak memory consumption was 108.9MB. Max. memory is 16.1GB. [2021-12-15 17:06:59,735 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.16ms. Allocated memory is still 88.1MB. Free memory is still 45.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.81ms. Allocated memory is still 113.2MB. Free memory was 83.0MB in the beginning and 89.7MB in the end (delta: -6.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.64ms. Allocated memory is still 113.2MB. Free memory was 89.7MB in the beginning and 88.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.93ms. Allocated memory is still 113.2MB. Free memory was 88.2MB in the beginning and 86.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 304.31ms. Allocated memory is still 113.2MB. Free memory was 86.8MB in the beginning and 74.9MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 2748.76ms. Allocated memory was 113.2MB in the beginning and 285.2MB in the end (delta: 172.0MB). Free memory was 74.9MB in the beginning and 141.0MB in the end (delta: -66.1MB). Peak memory consumption was 108.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: UnsupportedOperationException: Set is immutable: de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-15 17:06:59,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable