./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/locks/test_locks_15-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_15-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 03:29:57,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 03:29:57,187 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 03:29:57,223 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 03:29:57,223 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 03:29:57,225 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 03:29:57,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 03:29:57,234 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 03:29:57,236 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 03:29:57,241 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 03:29:57,242 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 03:29:57,244 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 03:29:57,245 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 03:29:57,247 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 03:29:57,248 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 03:29:57,249 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 03:29:57,250 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 03:29:57,251 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 03:29:57,254 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 03:29:57,258 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 03:29:57,261 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 03:29:57,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 03:29:57,262 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 03:29:57,263 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 03:29:57,265 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 03:29:57,272 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 03:29:57,272 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 03:29:57,273 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 03:29:57,274 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 03:29:57,274 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 03:29:57,275 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 03:29:57,276 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 03:29:57,277 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 03:29:57,278 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 03:29:57,279 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 03:29:57,279 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 03:29:57,279 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 03:29:57,280 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 03:29:57,281 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 03:29:57,281 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 03:29:57,282 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 03:29:57,284 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 03:29:57,285 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 03:29:57,314 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 03:29:57,314 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 03:29:57,315 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 03:29:57,315 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 03:29:57,316 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 03:29:57,317 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 03:29:57,317 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 03:29:57,317 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 03:29:57,317 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 03:29:57,318 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 03:29:57,318 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 03:29:57,319 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 03:29:57,319 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 03:29:57,319 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 03:29:57,319 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 03:29:57,319 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 03:29:57,319 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 03:29:57,321 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 03:29:57,321 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 03:29:57,321 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 03:29:57,321 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 03:29:57,321 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 03:29:57,322 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 03:29:57,322 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 03:29:57,322 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 03:29:57,322 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 03:29:57,322 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 03:29:57,323 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 03:29:57,323 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 03:29:57,323 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 03:29:57,323 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 03:29:57,324 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 03:29:57,325 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 -> ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 [2022-07-13 03:29:57,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 03:29:57,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 03:29:57,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 03:29:57,635 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 03:29:57,635 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 03:29:57,637 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-2.c [2022-07-13 03:29:57,701 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92a70857e/bbf67808c9934af9a1ff943f01641f83/FLAG448d97c0f [2022-07-13 03:29:58,147 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 03:29:58,149 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c [2022-07-13 03:29:58,160 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92a70857e/bbf67808c9934af9a1ff943f01641f83/FLAG448d97c0f [2022-07-13 03:29:58,178 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92a70857e/bbf67808c9934af9a1ff943f01641f83 [2022-07-13 03:29:58,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 03:29:58,184 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 03:29:58,186 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 03:29:58,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 03:29:58,189 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 03:29:58,190 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:29:58" (1/1) ... [2022-07-13 03:29:58,191 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eb17040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:58, skipping insertion in model container [2022-07-13 03:29:58,192 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:29:58" (1/1) ... [2022-07-13 03:29:58,198 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 03:29:58,221 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 03:29:58,423 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c[5628,5641] [2022-07-13 03:29:58,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:29:58,433 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 03:29:58,455 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c[5628,5641] [2022-07-13 03:29:58,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:29:58,477 INFO L208 MainTranslator]: Completed translation [2022-07-13 03:29:58,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:58 WrapperNode [2022-07-13 03:29:58,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 03:29:58,479 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 03:29:58,479 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 03:29:58,479 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 03:29:58,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:58" (1/1) ... [2022-07-13 03:29:58,499 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:58" (1/1) ... [2022-07-13 03:29:58,524 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 177 [2022-07-13 03:29:58,525 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 03:29:58,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 03:29:58,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 03:29:58,526 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 03:29:58,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:58" (1/1) ... [2022-07-13 03:29:58,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:58" (1/1) ... [2022-07-13 03:29:58,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:58" (1/1) ... [2022-07-13 03:29:58,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:58" (1/1) ... [2022-07-13 03:29:58,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:58" (1/1) ... [2022-07-13 03:29:58,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:58" (1/1) ... [2022-07-13 03:29:58,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:58" (1/1) ... [2022-07-13 03:29:58,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 03:29:58,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 03:29:58,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 03:29:58,572 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 03:29:58,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:58" (1/1) ... [2022-07-13 03:29:58,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:29:58,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:29:58,605 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:29:58,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-13 03:29:58,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 03:29:58,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 03:29:58,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 03:29:58,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 03:29:58,737 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 03:29:58,738 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 03:29:58,950 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 03:29:58,955 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 03:29:58,971 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 03:29:58,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:29:58 BoogieIcfgContainer [2022-07-13 03:29:58,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 03:29:58,975 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 03:29:58,975 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 03:29:58,979 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 03:29:58,979 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:29:58,980 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 03:29:58" (1/3) ... [2022-07-13 03:29:58,980 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37c02b48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:29:58, skipping insertion in model container [2022-07-13 03:29:58,981 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:29:58,981 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:29:58" (2/3) ... [2022-07-13 03:29:58,981 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37c02b48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:29:58, skipping insertion in model container [2022-07-13 03:29:58,981 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:29:58,981 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:29:58" (3/3) ... [2022-07-13 03:29:58,983 INFO L354 chiAutomizerObserver]: Analyzing ICFG test_locks_15-2.c [2022-07-13 03:29:59,055 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 03:29:59,056 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 03:29:59,056 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 03:29:59,056 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 03:29:59,056 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 03:29:59,056 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 03:29:59,056 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 03:29:59,057 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 03:29:59,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 53 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:59,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2022-07-13 03:29:59,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:59,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:59,090 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:59,090 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:29:59,090 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 03:29:59,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 53 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:59,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2022-07-13 03:29:59,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:59,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:59,101 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:59,101 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:29:59,107 INFO L752 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 33#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 20#L225-1true [2022-07-13 03:29:59,114 INFO L754 eck$LassoCheckResult]: Loop: 20#L225-1true assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 32#L58true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 28#L93true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 25#L93-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 13#L97-1true assume !(0 != main_~p3~0#1); 16#L101-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 50#L105-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 45#L109-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 12#L113-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 22#L117-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 30#L121-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 17#L125-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 35#L129-1true assume !(0 != main_~p11~0#1); 3#L133-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 6#L137-1true assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 40#L141-1true assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 54#L145-1true assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 48#L149-1true assume !(0 != main_~p1~0#1); 47#L155-1true assume !(0 != main_~p2~0#1); 27#L160-1true assume !(0 != main_~p3~0#1); 11#L165-1true assume !(0 != main_~p4~0#1); 42#L170-1true assume !(0 != main_~p5~0#1); 46#L175-1true assume !(0 != main_~p6~0#1); 18#L180-1true assume !(0 != main_~p7~0#1); 39#L185-1true assume !(0 != main_~p8~0#1); 24#L190-1true assume !(0 != main_~p9~0#1); 41#L195-1true assume !(0 != main_~p10~0#1); 15#L200-1true assume !(0 != main_~p11~0#1); 44#L205-1true assume !(0 != main_~p12~0#1); 23#L210-1true assume !(0 != main_~p13~0#1); 5#L215-1true assume !(0 != main_~p14~0#1); 37#L220-1true assume !(0 != main_~p15~0#1); 20#L225-1true [2022-07-13 03:29:59,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:59,124 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-13 03:29:59,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:59,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138815257] [2022-07-13 03:29:59,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:59,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:59,225 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:59,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:59,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:59,269 INFO L85 PathProgramCache]: Analyzing trace with hash 2064553094, now seen corresponding path program 1 times [2022-07-13 03:29:59,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:59,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857230956] [2022-07-13 03:29:59,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:59,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:59,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:59,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:59,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857230956] [2022-07-13 03:29:59,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857230956] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:59,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:59,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:59,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385555861] [2022-07-13 03:29:59,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:59,392 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:59,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:59,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:59,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:59,426 INFO L87 Difference]: Start difference. First operand has 54 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 53 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:59,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:59,486 INFO L93 Difference]: Finished difference Result 105 states and 190 transitions. [2022-07-13 03:29:59,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:59,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 190 transitions. [2022-07-13 03:29:59,504 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2022-07-13 03:29:59,508 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 95 states and 153 transitions. [2022-07-13 03:29:59,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2022-07-13 03:29:59,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2022-07-13 03:29:59,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 153 transitions. [2022-07-13 03:29:59,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:59,515 INFO L369 hiAutomatonCegarLoop]: Abstraction has 95 states and 153 transitions. [2022-07-13 03:29:59,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 153 transitions. [2022-07-13 03:29:59,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-07-13 03:29:59,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.6105263157894736) internal successors, (153), 94 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:59,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 153 transitions. [2022-07-13 03:29:59,553 INFO L392 hiAutomatonCegarLoop]: Abstraction has 95 states and 153 transitions. [2022-07-13 03:29:59,553 INFO L374 stractBuchiCegarLoop]: Abstraction has 95 states and 153 transitions. [2022-07-13 03:29:59,553 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 03:29:59,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 153 transitions. [2022-07-13 03:29:59,555 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 93 [2022-07-13 03:29:59,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:59,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:59,555 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:59,556 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:29:59,556 INFO L752 eck$LassoCheckResult]: Stem: 215#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 208#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 209#L225-1 [2022-07-13 03:29:59,556 INFO L754 eck$LassoCheckResult]: Loop: 209#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 237#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 236#L93 assume !(0 != main_~p1~0#1); 235#L93-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 234#L97-1 assume !(0 != main_~p3~0#1); 233#L101-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 220#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 216#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 183#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 184#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 199#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 191#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 192#L129-1 assume !(0 != main_~p11~0#1); 168#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 169#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 173#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 212#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 221#L149-1 assume !(0 != main_~p1~0#1); 222#L155-1 assume !(0 != main_~p2~0#1); 261#L160-1 assume !(0 != main_~p3~0#1); 259#L165-1 assume !(0 != main_~p4~0#1); 256#L170-1 assume !(0 != main_~p5~0#1); 255#L175-1 assume !(0 != main_~p6~0#1); 253#L180-1 assume !(0 != main_~p7~0#1); 250#L185-1 assume !(0 != main_~p8~0#1); 249#L190-1 assume !(0 != main_~p9~0#1); 247#L195-1 assume !(0 != main_~p10~0#1); 187#L200-1 assume !(0 != main_~p11~0#1); 188#L205-1 assume !(0 != main_~p12~0#1); 206#L210-1 assume !(0 != main_~p13~0#1); 241#L215-1 assume !(0 != main_~p14~0#1); 239#L220-1 assume !(0 != main_~p15~0#1); 209#L225-1 [2022-07-13 03:29:59,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:59,557 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-13 03:29:59,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:59,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951600371] [2022-07-13 03:29:59,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:59,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:59,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:59,565 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:59,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:59,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:59,572 INFO L85 PathProgramCache]: Analyzing trace with hash 2087185348, now seen corresponding path program 1 times [2022-07-13 03:29:59,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:59,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882503344] [2022-07-13 03:29:59,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:59,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:59,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:59,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:59,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882503344] [2022-07-13 03:29:59,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882503344] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:59,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:59,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:59,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079266219] [2022-07-13 03:29:59,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:59,608 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:59,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:59,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:59,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:59,609 INFO L87 Difference]: Start difference. First operand 95 states and 153 transitions. cyclomatic complexity: 60 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:59,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:59,625 INFO L93 Difference]: Finished difference Result 186 states and 298 transitions. [2022-07-13 03:29:59,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:59,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 298 transitions. [2022-07-13 03:29:59,629 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2022-07-13 03:29:59,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 186 states and 298 transitions. [2022-07-13 03:29:59,631 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2022-07-13 03:29:59,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 186 [2022-07-13 03:29:59,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 298 transitions. [2022-07-13 03:29:59,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:59,633 INFO L369 hiAutomatonCegarLoop]: Abstraction has 186 states and 298 transitions. [2022-07-13 03:29:59,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 298 transitions. [2022-07-13 03:29:59,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-07-13 03:29:59,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 186 states have (on average 1.6021505376344085) internal successors, (298), 185 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:59,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 298 transitions. [2022-07-13 03:29:59,653 INFO L392 hiAutomatonCegarLoop]: Abstraction has 186 states and 298 transitions. [2022-07-13 03:29:59,653 INFO L374 stractBuchiCegarLoop]: Abstraction has 186 states and 298 transitions. [2022-07-13 03:29:59,654 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 03:29:59,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 186 states and 298 transitions. [2022-07-13 03:29:59,655 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 184 [2022-07-13 03:29:59,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:59,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:59,656 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:59,656 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:29:59,656 INFO L752 eck$LassoCheckResult]: Stem: 508#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 498#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 499#L225-1 [2022-07-13 03:29:59,657 INFO L754 eck$LassoCheckResult]: Loop: 499#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 554#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 552#L93 assume !(0 != main_~p1~0#1); 537#L93-2 assume !(0 != main_~p2~0#1); 538#L97-1 assume !(0 != main_~p3~0#1); 533#L101-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 514#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 509#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 470#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 471#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 486#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 478#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 479#L129-1 assume !(0 != main_~p11~0#1); 455#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 456#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 460#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 515#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 516#L149-1 assume !(0 != main_~p1~0#1); 540#L155-1 assume !(0 != main_~p2~0#1); 591#L160-1 assume !(0 != main_~p3~0#1); 589#L165-1 assume !(0 != main_~p4~0#1); 586#L170-1 assume !(0 != main_~p5~0#1); 585#L175-1 assume !(0 != main_~p6~0#1); 583#L180-1 assume !(0 != main_~p7~0#1); 580#L185-1 assume !(0 != main_~p8~0#1); 579#L190-1 assume !(0 != main_~p9~0#1); 577#L195-1 assume !(0 != main_~p10~0#1); 575#L200-1 assume !(0 != main_~p11~0#1); 573#L205-1 assume !(0 != main_~p12~0#1); 571#L210-1 assume !(0 != main_~p13~0#1); 569#L215-1 assume !(0 != main_~p14~0#1); 558#L220-1 assume !(0 != main_~p15~0#1); 499#L225-1 [2022-07-13 03:29:59,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:59,657 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-07-13 03:29:59,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:59,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501498488] [2022-07-13 03:29:59,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:59,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:59,665 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:59,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:59,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:59,672 INFO L85 PathProgramCache]: Analyzing trace with hash -821578554, now seen corresponding path program 1 times [2022-07-13 03:29:59,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:59,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530485613] [2022-07-13 03:29:59,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:59,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:59,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:59,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:59,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530485613] [2022-07-13 03:29:59,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530485613] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:59,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:59,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:59,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938897376] [2022-07-13 03:29:59,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:59,705 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:59,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:59,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:59,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:59,706 INFO L87 Difference]: Start difference. First operand 186 states and 298 transitions. cyclomatic complexity: 116 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:59,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:59,738 INFO L93 Difference]: Finished difference Result 366 states and 582 transitions. [2022-07-13 03:29:59,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:59,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 366 states and 582 transitions. [2022-07-13 03:29:59,743 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2022-07-13 03:29:59,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 366 states to 366 states and 582 transitions. [2022-07-13 03:29:59,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 366 [2022-07-13 03:29:59,755 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 366 [2022-07-13 03:29:59,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 366 states and 582 transitions. [2022-07-13 03:29:59,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:59,757 INFO L369 hiAutomatonCegarLoop]: Abstraction has 366 states and 582 transitions. [2022-07-13 03:29:59,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states and 582 transitions. [2022-07-13 03:29:59,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2022-07-13 03:29:59,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 366 states have (on average 1.5901639344262295) internal successors, (582), 365 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:59,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 582 transitions. [2022-07-13 03:29:59,778 INFO L392 hiAutomatonCegarLoop]: Abstraction has 366 states and 582 transitions. [2022-07-13 03:29:59,778 INFO L374 stractBuchiCegarLoop]: Abstraction has 366 states and 582 transitions. [2022-07-13 03:29:59,778 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 03:29:59,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 366 states and 582 transitions. [2022-07-13 03:29:59,781 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 364 [2022-07-13 03:29:59,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:59,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:59,782 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:59,782 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:29:59,782 INFO L752 eck$LassoCheckResult]: Stem: 1067#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 1057#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 1058#L225-1 [2022-07-13 03:29:59,782 INFO L754 eck$LassoCheckResult]: Loop: 1058#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1096#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 1092#L93 assume !(0 != main_~p1~0#1); 1085#L93-2 assume !(0 != main_~p2~0#1); 1086#L97-1 assume !(0 != main_~p3~0#1); 1237#L101-1 assume !(0 != main_~p4~0#1); 1234#L105-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 1232#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1228#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1224#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1220#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1216#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1212#L129-1 assume !(0 != main_~p11~0#1); 1208#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1204#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 1200#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 1196#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 1190#L149-1 assume !(0 != main_~p1~0#1); 1188#L155-1 assume !(0 != main_~p2~0#1); 1187#L160-1 assume !(0 != main_~p3~0#1); 1182#L165-1 assume !(0 != main_~p4~0#1); 1175#L170-1 assume !(0 != main_~p5~0#1); 1127#L175-1 assume !(0 != main_~p6~0#1); 1123#L180-1 assume !(0 != main_~p7~0#1); 1120#L185-1 assume !(0 != main_~p8~0#1); 1119#L190-1 assume !(0 != main_~p9~0#1); 1117#L195-1 assume !(0 != main_~p10~0#1); 1115#L200-1 assume !(0 != main_~p11~0#1); 1113#L205-1 assume !(0 != main_~p12~0#1); 1111#L210-1 assume !(0 != main_~p13~0#1); 1109#L215-1 assume !(0 != main_~p14~0#1); 1107#L220-1 assume !(0 != main_~p15~0#1); 1058#L225-1 [2022-07-13 03:29:59,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:59,783 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-07-13 03:29:59,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:59,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871724728] [2022-07-13 03:29:59,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:59,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:59,790 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:59,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:59,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:59,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1101649480, now seen corresponding path program 1 times [2022-07-13 03:29:59,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:59,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758190097] [2022-07-13 03:29:59,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:59,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:59,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:59,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:59,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758190097] [2022-07-13 03:29:59,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758190097] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:59,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:59,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:59,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072716249] [2022-07-13 03:29:59,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:59,832 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:59,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:59,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:59,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:59,834 INFO L87 Difference]: Start difference. First operand 366 states and 582 transitions. cyclomatic complexity: 224 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:59,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:29:59,851 INFO L93 Difference]: Finished difference Result 722 states and 1138 transitions. [2022-07-13 03:29:59,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:29:59,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 722 states and 1138 transitions. [2022-07-13 03:29:59,859 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2022-07-13 03:29:59,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 722 states to 722 states and 1138 transitions. [2022-07-13 03:29:59,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 722 [2022-07-13 03:29:59,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 722 [2022-07-13 03:29:59,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 722 states and 1138 transitions. [2022-07-13 03:29:59,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:29:59,871 INFO L369 hiAutomatonCegarLoop]: Abstraction has 722 states and 1138 transitions. [2022-07-13 03:29:59,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states and 1138 transitions. [2022-07-13 03:29:59,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2022-07-13 03:29:59,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 722 states have (on average 1.5761772853185596) internal successors, (1138), 721 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:29:59,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1138 transitions. [2022-07-13 03:29:59,902 INFO L392 hiAutomatonCegarLoop]: Abstraction has 722 states and 1138 transitions. [2022-07-13 03:29:59,902 INFO L374 stractBuchiCegarLoop]: Abstraction has 722 states and 1138 transitions. [2022-07-13 03:29:59,903 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 03:29:59,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 722 states and 1138 transitions. [2022-07-13 03:29:59,907 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 720 [2022-07-13 03:29:59,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:29:59,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:29:59,908 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:29:59,908 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:29:59,908 INFO L752 eck$LassoCheckResult]: Stem: 2156#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 2149#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 2150#L225-1 [2022-07-13 03:29:59,908 INFO L754 eck$LassoCheckResult]: Loop: 2150#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 2251#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 2247#L93 assume !(0 != main_~p1~0#1); 2240#L93-2 assume !(0 != main_~p2~0#1); 2235#L97-1 assume !(0 != main_~p3~0#1); 2228#L101-1 assume !(0 != main_~p4~0#1); 2222#L105-1 assume !(0 != main_~p5~0#1); 2218#L109-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 2216#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 2214#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 2212#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 2210#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 2207#L129-1 assume !(0 != main_~p11~0#1); 2208#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 2201#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 2202#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 2194#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 2195#L149-1 assume !(0 != main_~p1~0#1); 2184#L155-1 assume !(0 != main_~p2~0#1); 2186#L160-1 assume !(0 != main_~p3~0#1); 2363#L165-1 assume !(0 != main_~p4~0#1); 2351#L170-1 assume !(0 != main_~p5~0#1); 2350#L175-1 assume !(0 != main_~p6~0#1); 2348#L180-1 assume !(0 != main_~p7~0#1); 2344#L185-1 assume !(0 != main_~p8~0#1); 2339#L190-1 assume !(0 != main_~p9~0#1); 2333#L195-1 assume !(0 != main_~p10~0#1); 2282#L200-1 assume !(0 != main_~p11~0#1); 2280#L205-1 assume !(0 != main_~p12~0#1); 2274#L210-1 assume !(0 != main_~p13~0#1); 2270#L215-1 assume !(0 != main_~p14~0#1); 2260#L220-1 assume !(0 != main_~p15~0#1); 2150#L225-1 [2022-07-13 03:29:59,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:59,909 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-07-13 03:29:59,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:59,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276052520] [2022-07-13 03:29:59,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:59,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:59,924 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:29:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:29:59,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:29:59,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:29:59,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1163689094, now seen corresponding path program 1 times [2022-07-13 03:29:59,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:29:59,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19736181] [2022-07-13 03:29:59,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:29:59,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:29:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:29:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:29:59,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:29:59,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19736181] [2022-07-13 03:29:59,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19736181] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:29:59,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:29:59,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:29:59,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587788231] [2022-07-13 03:29:59,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:29:59,975 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:29:59,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:29:59,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:29:59,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:29:59,977 INFO L87 Difference]: Start difference. First operand 722 states and 1138 transitions. cyclomatic complexity: 432 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:00,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:30:00,005 INFO L93 Difference]: Finished difference Result 1426 states and 2226 transitions. [2022-07-13 03:30:00,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:30:00,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1426 states and 2226 transitions. [2022-07-13 03:30:00,044 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2022-07-13 03:30:00,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1426 states to 1426 states and 2226 transitions. [2022-07-13 03:30:00,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1426 [2022-07-13 03:30:00,056 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1426 [2022-07-13 03:30:00,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1426 states and 2226 transitions. [2022-07-13 03:30:00,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:30:00,060 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2022-07-13 03:30:00,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states and 2226 transitions. [2022-07-13 03:30:00,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1426. [2022-07-13 03:30:00,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1426 states have (on average 1.5610098176718092) internal successors, (2226), 1425 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:00,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 2226 transitions. [2022-07-13 03:30:00,104 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2022-07-13 03:30:00,104 INFO L374 stractBuchiCegarLoop]: Abstraction has 1426 states and 2226 transitions. [2022-07-13 03:30:00,104 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 03:30:00,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1426 states and 2226 transitions. [2022-07-13 03:30:00,112 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1424 [2022-07-13 03:30:00,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:00,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:00,113 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:00,113 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:00,113 INFO L752 eck$LassoCheckResult]: Stem: 4313#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 4305#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 4306#L225-1 [2022-07-13 03:30:00,114 INFO L754 eck$LassoCheckResult]: Loop: 4306#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 4520#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 4521#L93 assume !(0 != main_~p1~0#1); 4734#L93-2 assume !(0 != main_~p2~0#1); 4733#L97-1 assume !(0 != main_~p3~0#1); 4731#L101-1 assume !(0 != main_~p4~0#1); 4728#L105-1 assume !(0 != main_~p5~0#1); 4724#L109-1 assume !(0 != main_~p6~0#1); 4722#L113-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 4720#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 4718#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 4716#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 4714#L129-1 assume !(0 != main_~p11~0#1); 4712#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 4710#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 4708#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 4706#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 4703#L149-1 assume !(0 != main_~p1~0#1); 4704#L155-1 assume !(0 != main_~p2~0#1); 4753#L160-1 assume !(0 != main_~p3~0#1); 4654#L165-1 assume !(0 != main_~p4~0#1); 4655#L170-1 assume !(0 != main_~p5~0#1); 4643#L175-1 assume !(0 != main_~p6~0#1); 4645#L180-1 assume !(0 != main_~p7~0#1); 4627#L185-1 assume !(0 != main_~p8~0#1); 4628#L190-1 assume !(0 != main_~p9~0#1); 4612#L195-1 assume !(0 != main_~p10~0#1); 4611#L200-1 assume !(0 != main_~p11~0#1); 4595#L205-1 assume !(0 != main_~p12~0#1); 4587#L210-1 assume !(0 != main_~p13~0#1); 4586#L215-1 assume !(0 != main_~p14~0#1); 4540#L220-1 assume !(0 != main_~p15~0#1); 4306#L225-1 [2022-07-13 03:30:00,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:00,114 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-07-13 03:30:00,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:00,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304751526] [2022-07-13 03:30:00,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:00,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:00,133 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:00,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:00,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:00,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1304237704, now seen corresponding path program 1 times [2022-07-13 03:30:00,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:00,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268120948] [2022-07-13 03:30:00,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:00,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:30:00,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:30:00,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:30:00,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268120948] [2022-07-13 03:30:00,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268120948] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:30:00,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:30:00,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:30:00,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207545294] [2022-07-13 03:30:00,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:30:00,205 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:30:00,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:30:00,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:30:00,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:30:00,207 INFO L87 Difference]: Start difference. First operand 1426 states and 2226 transitions. cyclomatic complexity: 832 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:00,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:30:00,243 INFO L93 Difference]: Finished difference Result 2818 states and 4354 transitions. [2022-07-13 03:30:00,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:30:00,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2818 states and 4354 transitions. [2022-07-13 03:30:00,274 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2022-07-13 03:30:00,291 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2818 states to 2818 states and 4354 transitions. [2022-07-13 03:30:00,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2818 [2022-07-13 03:30:00,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2818 [2022-07-13 03:30:00,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2818 states and 4354 transitions. [2022-07-13 03:30:00,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:30:00,301 INFO L369 hiAutomatonCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2022-07-13 03:30:00,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states and 4354 transitions. [2022-07-13 03:30:00,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2818. [2022-07-13 03:30:00,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2818 states have (on average 1.5450674237047552) internal successors, (4354), 2817 states have internal predecessors, (4354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:00,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 4354 transitions. [2022-07-13 03:30:00,383 INFO L392 hiAutomatonCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2022-07-13 03:30:00,383 INFO L374 stractBuchiCegarLoop]: Abstraction has 2818 states and 4354 transitions. [2022-07-13 03:30:00,386 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-13 03:30:00,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2818 states and 4354 transitions. [2022-07-13 03:30:00,402 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2816 [2022-07-13 03:30:00,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:00,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:00,407 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:00,407 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:00,407 INFO L752 eck$LassoCheckResult]: Stem: 8576#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 8562#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 8563#L225-1 [2022-07-13 03:30:00,408 INFO L754 eck$LassoCheckResult]: Loop: 8563#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 8727#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 8725#L93 assume !(0 != main_~p1~0#1); 8724#L93-2 assume !(0 != main_~p2~0#1); 8718#L97-1 assume !(0 != main_~p3~0#1); 8719#L101-1 assume !(0 != main_~p4~0#1); 8825#L105-1 assume !(0 != main_~p5~0#1); 8822#L109-1 assume !(0 != main_~p6~0#1); 8818#L113-1 assume !(0 != main_~p7~0#1); 8816#L117-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 8815#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 8812#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 8809#L129-1 assume !(0 != main_~p11~0#1); 8806#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 8802#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 8798#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 8793#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 8787#L149-1 assume !(0 != main_~p1~0#1); 8781#L155-1 assume !(0 != main_~p2~0#1); 8776#L160-1 assume !(0 != main_~p3~0#1); 8769#L165-1 assume !(0 != main_~p4~0#1); 8763#L170-1 assume !(0 != main_~p5~0#1); 8758#L175-1 assume !(0 != main_~p6~0#1); 8756#L180-1 assume !(0 != main_~p7~0#1); 8750#L185-1 assume !(0 != main_~p8~0#1); 8747#L190-1 assume !(0 != main_~p9~0#1); 8743#L195-1 assume !(0 != main_~p10~0#1); 8737#L200-1 assume !(0 != main_~p11~0#1); 8735#L205-1 assume !(0 != main_~p12~0#1); 8733#L210-1 assume !(0 != main_~p13~0#1); 8731#L215-1 assume !(0 != main_~p14~0#1); 8729#L220-1 assume !(0 != main_~p15~0#1); 8563#L225-1 [2022-07-13 03:30:00,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:00,414 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-07-13 03:30:00,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:00,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46238854] [2022-07-13 03:30:00,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:00,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:00,423 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:00,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:00,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:00,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1170224198, now seen corresponding path program 1 times [2022-07-13 03:30:00,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:00,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850050566] [2022-07-13 03:30:00,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:00,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:30:00,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:30:00,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:30:00,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850050566] [2022-07-13 03:30:00,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850050566] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:30:00,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:30:00,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:30:00,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64721028] [2022-07-13 03:30:00,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:30:00,479 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:30:00,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:30:00,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:30:00,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:30:00,481 INFO L87 Difference]: Start difference. First operand 2818 states and 4354 transitions. cyclomatic complexity: 1600 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:00,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:30:00,513 INFO L93 Difference]: Finished difference Result 5570 states and 8514 transitions. [2022-07-13 03:30:00,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:30:00,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5570 states and 8514 transitions. [2022-07-13 03:30:00,560 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2022-07-13 03:30:00,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5570 states to 5570 states and 8514 transitions. [2022-07-13 03:30:00,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5570 [2022-07-13 03:30:00,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5570 [2022-07-13 03:30:00,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5570 states and 8514 transitions. [2022-07-13 03:30:00,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:30:00,658 INFO L369 hiAutomatonCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2022-07-13 03:30:00,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5570 states and 8514 transitions. [2022-07-13 03:30:00,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5570 to 5570. [2022-07-13 03:30:00,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5570 states, 5570 states have (on average 1.5285457809694794) internal successors, (8514), 5569 states have internal predecessors, (8514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:00,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5570 states to 5570 states and 8514 transitions. [2022-07-13 03:30:00,771 INFO L392 hiAutomatonCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2022-07-13 03:30:00,771 INFO L374 stractBuchiCegarLoop]: Abstraction has 5570 states and 8514 transitions. [2022-07-13 03:30:00,771 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-13 03:30:00,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5570 states and 8514 transitions. [2022-07-13 03:30:00,800 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 5568 [2022-07-13 03:30:00,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:00,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:00,802 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:00,802 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:00,802 INFO L752 eck$LassoCheckResult]: Stem: 16963#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 16949#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 16950#L225-1 [2022-07-13 03:30:00,803 INFO L754 eck$LassoCheckResult]: Loop: 16950#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 17206#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 17200#L93 assume !(0 != main_~p1~0#1); 17196#L93-2 assume !(0 != main_~p2~0#1); 17193#L97-1 assume !(0 != main_~p3~0#1); 17187#L101-1 assume !(0 != main_~p4~0#1); 17181#L105-1 assume !(0 != main_~p5~0#1); 17177#L109-1 assume !(0 != main_~p6~0#1); 17172#L113-1 assume !(0 != main_~p7~0#1); 17166#L117-1 assume !(0 != main_~p8~0#1); 17167#L121-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 17154#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 17155#L129-1 assume !(0 != main_~p11~0#1); 17146#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 17147#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 17138#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 17139#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 17128#L149-1 assume !(0 != main_~p1~0#1); 17129#L155-1 assume !(0 != main_~p2~0#1); 17118#L160-1 assume !(0 != main_~p3~0#1); 17117#L165-1 assume !(0 != main_~p4~0#1); 17104#L170-1 assume !(0 != main_~p5~0#1); 17105#L175-1 assume !(0 != main_~p6~0#1); 17095#L180-1 assume !(0 != main_~p7~0#1); 17096#L185-1 assume !(0 != main_~p8~0#1); 17248#L190-1 assume !(0 != main_~p9~0#1); 17244#L195-1 assume !(0 != main_~p10~0#1); 17240#L200-1 assume !(0 != main_~p11~0#1); 17234#L205-1 assume !(0 != main_~p12~0#1); 17228#L210-1 assume !(0 != main_~p13~0#1); 17222#L215-1 assume !(0 != main_~p14~0#1); 17216#L220-1 assume !(0 != main_~p15~0#1); 16950#L225-1 [2022-07-13 03:30:00,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:00,804 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-07-13 03:30:00,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:00,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107927992] [2022-07-13 03:30:00,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:00,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:00,813 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:00,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:00,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:00,840 INFO L85 PathProgramCache]: Analyzing trace with hash -635214136, now seen corresponding path program 1 times [2022-07-13 03:30:00,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:00,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886838556] [2022-07-13 03:30:00,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:00,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:30:00,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:30:00,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:30:00,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886838556] [2022-07-13 03:30:00,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886838556] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:30:00,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:30:00,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:30:00,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854592583] [2022-07-13 03:30:00,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:30:00,863 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:30:00,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:30:00,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:30:00,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:30:00,864 INFO L87 Difference]: Start difference. First operand 5570 states and 8514 transitions. cyclomatic complexity: 3072 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:00,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:30:00,937 INFO L93 Difference]: Finished difference Result 11010 states and 16642 transitions. [2022-07-13 03:30:00,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:30:00,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11010 states and 16642 transitions. [2022-07-13 03:30:01,002 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2022-07-13 03:30:01,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11010 states to 11010 states and 16642 transitions. [2022-07-13 03:30:01,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11010 [2022-07-13 03:30:01,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11010 [2022-07-13 03:30:01,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11010 states and 16642 transitions. [2022-07-13 03:30:01,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:30:01,090 INFO L369 hiAutomatonCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2022-07-13 03:30:01,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11010 states and 16642 transitions. [2022-07-13 03:30:01,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11010 to 11010. [2022-07-13 03:30:01,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11010 states, 11010 states have (on average 1.5115349682107175) internal successors, (16642), 11009 states have internal predecessors, (16642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:01,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11010 states to 11010 states and 16642 transitions. [2022-07-13 03:30:01,376 INFO L392 hiAutomatonCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2022-07-13 03:30:01,376 INFO L374 stractBuchiCegarLoop]: Abstraction has 11010 states and 16642 transitions. [2022-07-13 03:30:01,377 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-13 03:30:01,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11010 states and 16642 transitions. [2022-07-13 03:30:01,468 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 11008 [2022-07-13 03:30:01,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:01,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:01,470 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:01,470 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:01,470 INFO L752 eck$LassoCheckResult]: Stem: 33547#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 33535#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 33536#L225-1 [2022-07-13 03:30:01,471 INFO L754 eck$LassoCheckResult]: Loop: 33536#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 34190#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 34191#L93 assume !(0 != main_~p1~0#1); 34313#L93-2 assume !(0 != main_~p2~0#1); 34311#L97-1 assume !(0 != main_~p3~0#1); 34307#L101-1 assume !(0 != main_~p4~0#1); 34304#L105-1 assume !(0 != main_~p5~0#1); 34302#L109-1 assume !(0 != main_~p6~0#1); 34298#L113-1 assume !(0 != main_~p7~0#1); 34294#L117-1 assume !(0 != main_~p8~0#1); 34290#L121-1 assume !(0 != main_~p9~0#1); 34288#L125-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 34286#L129-1 assume !(0 != main_~p11~0#1); 34284#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 34282#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 34280#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 34278#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 34274#L149-1 assume !(0 != main_~p1~0#1); 34270#L155-1 assume !(0 != main_~p2~0#1); 34267#L160-1 assume !(0 != main_~p3~0#1); 34262#L165-1 assume !(0 != main_~p4~0#1); 34258#L170-1 assume !(0 != main_~p5~0#1); 34256#L175-1 assume !(0 != main_~p6~0#1); 34233#L180-1 assume !(0 != main_~p7~0#1); 34234#L185-1 assume !(0 != main_~p8~0#1); 34227#L190-1 assume !(0 != main_~p9~0#1); 34229#L195-1 assume !(0 != main_~p10~0#1); 34223#L200-1 assume !(0 != main_~p11~0#1); 34222#L205-1 assume !(0 != main_~p12~0#1); 34217#L210-1 assume !(0 != main_~p13~0#1); 34216#L215-1 assume !(0 != main_~p14~0#1); 34208#L220-1 assume !(0 != main_~p15~0#1); 33536#L225-1 [2022-07-13 03:30:01,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:01,472 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2022-07-13 03:30:01,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:01,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736447252] [2022-07-13 03:30:01,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:01,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:01,482 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:01,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:01,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:01,500 INFO L85 PathProgramCache]: Analyzing trace with hash -416359418, now seen corresponding path program 1 times [2022-07-13 03:30:01,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:01,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459040593] [2022-07-13 03:30:01,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:01,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:30:01,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:30:01,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:30:01,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459040593] [2022-07-13 03:30:01,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459040593] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:30:01,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:30:01,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:30:01,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720733912] [2022-07-13 03:30:01,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:30:01,539 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:30:01,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:30:01,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:30:01,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:30:01,540 INFO L87 Difference]: Start difference. First operand 11010 states and 16642 transitions. cyclomatic complexity: 5888 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:01,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:30:01,612 INFO L93 Difference]: Finished difference Result 21762 states and 32514 transitions. [2022-07-13 03:30:01,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:30:01,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21762 states and 32514 transitions. [2022-07-13 03:30:01,764 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2022-07-13 03:30:01,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21762 states to 21762 states and 32514 transitions. [2022-07-13 03:30:01,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21762 [2022-07-13 03:30:01,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21762 [2022-07-13 03:30:01,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21762 states and 32514 transitions. [2022-07-13 03:30:01,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:30:01,989 INFO L369 hiAutomatonCegarLoop]: Abstraction has 21762 states and 32514 transitions. [2022-07-13 03:30:02,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21762 states and 32514 transitions. [2022-07-13 03:30:02,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21762 to 21762. [2022-07-13 03:30:02,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21762 states, 21762 states have (on average 1.4940722360077199) internal successors, (32514), 21761 states have internal predecessors, (32514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:02,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21762 states to 21762 states and 32514 transitions. [2022-07-13 03:30:02,499 INFO L392 hiAutomatonCegarLoop]: Abstraction has 21762 states and 32514 transitions. [2022-07-13 03:30:02,499 INFO L374 stractBuchiCegarLoop]: Abstraction has 21762 states and 32514 transitions. [2022-07-13 03:30:02,499 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-13 03:30:02,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21762 states and 32514 transitions. [2022-07-13 03:30:02,593 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 21760 [2022-07-13 03:30:02,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:02,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:02,594 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:02,594 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:02,595 INFO L752 eck$LassoCheckResult]: Stem: 66322#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 66310#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 66311#L225-1 [2022-07-13 03:30:02,595 INFO L754 eck$LassoCheckResult]: Loop: 66311#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 66629#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 66630#L93 assume !(0 != main_~p1~0#1); 66617#L93-2 assume !(0 != main_~p2~0#1); 66619#L97-1 assume !(0 != main_~p3~0#1); 66606#L101-1 assume !(0 != main_~p4~0#1); 66608#L105-1 assume !(0 != main_~p5~0#1); 66710#L109-1 assume !(0 != main_~p6~0#1); 66708#L113-1 assume !(0 != main_~p7~0#1); 66705#L117-1 assume !(0 != main_~p8~0#1); 66702#L121-1 assume !(0 != main_~p9~0#1); 66700#L125-1 assume !(0 != main_~p10~0#1); 66699#L129-1 assume !(0 != main_~p11~0#1); 66698#L133-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 66697#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 66696#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 66694#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 66691#L149-1 assume !(0 != main_~p1~0#1); 66688#L155-1 assume !(0 != main_~p2~0#1); 66686#L160-1 assume !(0 != main_~p3~0#1); 66530#L165-1 assume !(0 != main_~p4~0#1); 66531#L170-1 assume !(0 != main_~p5~0#1); 66516#L175-1 assume !(0 != main_~p6~0#1); 66517#L180-1 assume !(0 != main_~p7~0#1); 66683#L185-1 assume !(0 != main_~p8~0#1); 66671#L190-1 assume !(0 != main_~p9~0#1); 66673#L195-1 assume !(0 != main_~p10~0#1); 66661#L200-1 assume !(0 != main_~p11~0#1); 66660#L205-1 assume !(0 != main_~p12~0#1); 66651#L210-1 assume !(0 != main_~p13~0#1); 66650#L215-1 assume !(0 != main_~p14~0#1); 66639#L220-1 assume !(0 != main_~p15~0#1); 66311#L225-1 [2022-07-13 03:30:02,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:02,595 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2022-07-13 03:30:02,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:02,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593170933] [2022-07-13 03:30:02,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:02,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:02,603 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:02,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:02,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:02,621 INFO L85 PathProgramCache]: Analyzing trace with hash 6342408, now seen corresponding path program 1 times [2022-07-13 03:30:02,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:02,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667240333] [2022-07-13 03:30:02,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:02,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:30:02,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:30:02,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:30:02,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667240333] [2022-07-13 03:30:02,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667240333] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:30:02,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:30:02,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:30:02,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609106358] [2022-07-13 03:30:02,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:30:02,664 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:30:02,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:30:02,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:30:02,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:30:02,667 INFO L87 Difference]: Start difference. First operand 21762 states and 32514 transitions. cyclomatic complexity: 11264 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:02,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:30:02,825 INFO L93 Difference]: Finished difference Result 43010 states and 63490 transitions. [2022-07-13 03:30:02,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:30:02,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43010 states and 63490 transitions. [2022-07-13 03:30:03,248 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2022-07-13 03:30:03,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43010 states to 43010 states and 63490 transitions. [2022-07-13 03:30:03,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43010 [2022-07-13 03:30:03,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43010 [2022-07-13 03:30:03,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43010 states and 63490 transitions. [2022-07-13 03:30:03,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:30:03,635 INFO L369 hiAutomatonCegarLoop]: Abstraction has 43010 states and 63490 transitions. [2022-07-13 03:30:03,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43010 states and 63490 transitions. [2022-07-13 03:30:04,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43010 to 43010. [2022-07-13 03:30:04,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43010 states, 43010 states have (on average 1.4761683329458266) internal successors, (63490), 43009 states have internal predecessors, (63490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:04,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43010 states to 43010 states and 63490 transitions. [2022-07-13 03:30:04,545 INFO L392 hiAutomatonCegarLoop]: Abstraction has 43010 states and 63490 transitions. [2022-07-13 03:30:04,545 INFO L374 stractBuchiCegarLoop]: Abstraction has 43010 states and 63490 transitions. [2022-07-13 03:30:04,546 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-13 03:30:04,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43010 states and 63490 transitions. [2022-07-13 03:30:04,689 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 43008 [2022-07-13 03:30:04,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:04,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:04,690 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:04,690 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:04,690 INFO L752 eck$LassoCheckResult]: Stem: 131098#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 131087#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 131088#L225-1 [2022-07-13 03:30:04,690 INFO L754 eck$LassoCheckResult]: Loop: 131088#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 131568#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 131565#L93 assume !(0 != main_~p1~0#1); 131561#L93-2 assume !(0 != main_~p2~0#1); 131558#L97-1 assume !(0 != main_~p3~0#1); 131547#L101-1 assume !(0 != main_~p4~0#1); 131536#L105-1 assume !(0 != main_~p5~0#1); 131527#L109-1 assume !(0 != main_~p6~0#1); 131517#L113-1 assume !(0 != main_~p7~0#1); 131511#L117-1 assume !(0 != main_~p8~0#1); 131505#L121-1 assume !(0 != main_~p9~0#1); 131498#L125-1 assume !(0 != main_~p10~0#1); 131493#L129-1 assume !(0 != main_~p11~0#1); 131423#L133-1 assume !(0 != main_~p12~0#1); 131424#L137-1 assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; 131409#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 131410#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 131392#L149-1 assume !(0 != main_~p1~0#1); 131393#L155-1 assume !(0 != main_~p2~0#1); 131373#L160-1 assume !(0 != main_~p3~0#1); 131372#L165-1 assume !(0 != main_~p4~0#1); 131349#L170-1 assume !(0 != main_~p5~0#1); 131350#L175-1 assume !(0 != main_~p6~0#1); 131327#L180-1 assume !(0 != main_~p7~0#1); 131328#L185-1 assume !(0 != main_~p8~0#1); 131309#L190-1 assume !(0 != main_~p9~0#1); 131311#L195-1 assume !(0 != main_~p10~0#1); 131469#L200-1 assume !(0 != main_~p11~0#1); 131464#L205-1 assume !(0 != main_~p12~0#1); 131465#L210-1 assume !(0 != main_~p13~0#1); 131576#L215-1 assume !(0 != main_~p14~0#1); 131573#L220-1 assume !(0 != main_~p15~0#1); 131088#L225-1 [2022-07-13 03:30:04,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:04,691 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2022-07-13 03:30:04,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:04,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960080275] [2022-07-13 03:30:04,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:04,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:04,697 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:04,701 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:04,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:04,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1682601334, now seen corresponding path program 1 times [2022-07-13 03:30:04,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:04,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51119140] [2022-07-13 03:30:04,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:04,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:04,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:30:04,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:30:04,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:30:04,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51119140] [2022-07-13 03:30:04,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51119140] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:30:04,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:30:04,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:30:04,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737087247] [2022-07-13 03:30:04,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:30:04,803 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:30:04,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:30:04,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:30:04,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:30:04,804 INFO L87 Difference]: Start difference. First operand 43010 states and 63490 transitions. cyclomatic complexity: 21504 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:05,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:30:05,004 INFO L93 Difference]: Finished difference Result 84994 states and 123906 transitions. [2022-07-13 03:30:05,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:30:05,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84994 states and 123906 transitions. [2022-07-13 03:30:05,663 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2022-07-13 03:30:05,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84994 states to 84994 states and 123906 transitions. [2022-07-13 03:30:05,924 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84994 [2022-07-13 03:30:05,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84994 [2022-07-13 03:30:05,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84994 states and 123906 transitions. [2022-07-13 03:30:06,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:30:06,140 INFO L369 hiAutomatonCegarLoop]: Abstraction has 84994 states and 123906 transitions. [2022-07-13 03:30:06,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84994 states and 123906 transitions. [2022-07-13 03:30:06,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84994 to 84994. [2022-07-13 03:30:07,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84994 states, 84994 states have (on average 1.4578205520389675) internal successors, (123906), 84993 states have internal predecessors, (123906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:07,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84994 states to 84994 states and 123906 transitions. [2022-07-13 03:30:07,280 INFO L392 hiAutomatonCegarLoop]: Abstraction has 84994 states and 123906 transitions. [2022-07-13 03:30:07,280 INFO L374 stractBuchiCegarLoop]: Abstraction has 84994 states and 123906 transitions. [2022-07-13 03:30:07,280 INFO L287 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-13 03:30:07,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84994 states and 123906 transitions. [2022-07-13 03:30:07,514 INFO L131 ngComponentsAnalysis]: Automaton has 2048 accepting balls. 84992 [2022-07-13 03:30:07,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:07,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:07,515 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:07,516 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:07,516 INFO L752 eck$LassoCheckResult]: Stem: 259116#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 259105#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 259106#L225-1 [2022-07-13 03:30:07,516 INFO L754 eck$LassoCheckResult]: Loop: 259106#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 260093#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 260071#L93 assume !(0 != main_~p1~0#1); 260073#L93-2 assume !(0 != main_~p2~0#1); 260053#L97-1 assume !(0 != main_~p3~0#1); 260054#L101-1 assume !(0 != main_~p4~0#1); 260027#L105-1 assume !(0 != main_~p5~0#1); 260029#L109-1 assume !(0 != main_~p6~0#1); 260313#L113-1 assume !(0 != main_~p7~0#1); 260283#L117-1 assume !(0 != main_~p8~0#1); 260285#L121-1 assume !(0 != main_~p9~0#1); 260309#L125-1 assume !(0 != main_~p10~0#1); 260308#L129-1 assume !(0 != main_~p11~0#1); 260306#L133-1 assume !(0 != main_~p12~0#1); 260304#L137-1 assume !(0 != main_~p13~0#1); 260302#L141-1 assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; 260300#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 260297#L149-1 assume !(0 != main_~p1~0#1); 260293#L155-1 assume !(0 != main_~p2~0#1); 260290#L160-1 assume !(0 != main_~p3~0#1); 260225#L165-1 assume !(0 != main_~p4~0#1); 260226#L170-1 assume !(0 != main_~p5~0#1); 260202#L175-1 assume !(0 != main_~p6~0#1); 260204#L180-1 assume !(0 != main_~p7~0#1); 260181#L185-1 assume !(0 != main_~p8~0#1); 260182#L190-1 assume !(0 != main_~p9~0#1); 260176#L195-1 assume !(0 != main_~p10~0#1); 260178#L200-1 assume !(0 != main_~p11~0#1); 260125#L205-1 assume !(0 != main_~p12~0#1); 260127#L210-1 assume !(0 != main_~p13~0#1); 260112#L215-1 assume !(0 != main_~p14~0#1); 260111#L220-1 assume !(0 != main_~p15~0#1); 259106#L225-1 [2022-07-13 03:30:07,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:07,516 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 12 times [2022-07-13 03:30:07,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:07,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020434264] [2022-07-13 03:30:07,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:07,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:07,527 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:07,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:07,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:07,808 INFO L85 PathProgramCache]: Analyzing trace with hash 618221256, now seen corresponding path program 1 times [2022-07-13 03:30:07,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:07,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113750108] [2022-07-13 03:30:07,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:07,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:30:07,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:30:07,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:30:07,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113750108] [2022-07-13 03:30:07,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113750108] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:30:07,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:30:07,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:30:07,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887132314] [2022-07-13 03:30:07,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:30:07,850 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:30:07,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:30:07,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:30:07,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:30:07,851 INFO L87 Difference]: Start difference. First operand 84994 states and 123906 transitions. cyclomatic complexity: 40960 Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:08,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:30:08,278 INFO L93 Difference]: Finished difference Result 167938 states and 241666 transitions. [2022-07-13 03:30:08,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:30:08,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167938 states and 241666 transitions. [2022-07-13 03:30:09,319 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 167936 [2022-07-13 03:30:10,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167938 states to 167938 states and 241666 transitions. [2022-07-13 03:30:10,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167938 [2022-07-13 03:30:10,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167938 [2022-07-13 03:30:10,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167938 states and 241666 transitions. [2022-07-13 03:30:10,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:30:10,202 INFO L369 hiAutomatonCegarLoop]: Abstraction has 167938 states and 241666 transitions. [2022-07-13 03:30:10,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167938 states and 241666 transitions. [2022-07-13 03:30:11,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167938 to 167938. [2022-07-13 03:30:11,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167938 states, 167938 states have (on average 1.4390191618335337) internal successors, (241666), 167937 states have internal predecessors, (241666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:12,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167938 states to 167938 states and 241666 transitions. [2022-07-13 03:30:12,617 INFO L392 hiAutomatonCegarLoop]: Abstraction has 167938 states and 241666 transitions. [2022-07-13 03:30:12,617 INFO L374 stractBuchiCegarLoop]: Abstraction has 167938 states and 241666 transitions. [2022-07-13 03:30:12,617 INFO L287 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-13 03:30:12,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167938 states and 241666 transitions. [2022-07-13 03:30:13,073 INFO L131 ngComponentsAnalysis]: Automaton has 4096 accepting balls. 167936 [2022-07-13 03:30:13,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:13,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:13,075 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:13,075 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:13,075 INFO L752 eck$LassoCheckResult]: Stem: 512052#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 512037#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 512038#L225-1 [2022-07-13 03:30:13,075 INFO L754 eck$LassoCheckResult]: Loop: 512038#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 512371#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 512369#L93 assume !(0 != main_~p1~0#1); 512367#L93-2 assume !(0 != main_~p2~0#1); 512366#L97-1 assume !(0 != main_~p3~0#1); 512364#L101-1 assume !(0 != main_~p4~0#1); 512362#L105-1 assume !(0 != main_~p5~0#1); 512360#L109-1 assume !(0 != main_~p6~0#1); 512358#L113-1 assume !(0 != main_~p7~0#1); 512356#L117-1 assume !(0 != main_~p8~0#1); 512354#L121-1 assume !(0 != main_~p9~0#1); 512352#L125-1 assume !(0 != main_~p10~0#1); 512351#L129-1 assume !(0 != main_~p11~0#1); 512349#L133-1 assume !(0 != main_~p12~0#1); 512345#L137-1 assume !(0 != main_~p13~0#1); 512343#L141-1 assume !(0 != main_~p14~0#1); 512340#L145-1 assume 0 != main_~p15~0#1;main_~lk15~0#1 := 1; 512336#L149-1 assume !(0 != main_~p1~0#1); 512330#L155-1 assume !(0 != main_~p2~0#1); 512325#L160-1 assume !(0 != main_~p3~0#1); 512318#L165-1 assume !(0 != main_~p4~0#1); 512312#L170-1 assume !(0 != main_~p5~0#1); 512306#L175-1 assume !(0 != main_~p6~0#1); 512300#L180-1 assume !(0 != main_~p7~0#1); 512294#L185-1 assume !(0 != main_~p8~0#1); 512288#L190-1 assume !(0 != main_~p9~0#1); 512282#L195-1 assume !(0 != main_~p10~0#1); 512277#L200-1 assume !(0 != main_~p11~0#1); 512270#L205-1 assume !(0 != main_~p12~0#1); 512261#L210-1 assume !(0 != main_~p13~0#1); 512262#L215-1 assume !(0 != main_~p14~0#1); 512373#L220-1 assume !(0 != main_~p15~0#1); 512038#L225-1 [2022-07-13 03:30:13,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:13,076 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 13 times [2022-07-13 03:30:13,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:13,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113962256] [2022-07-13 03:30:13,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:13,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:13,081 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:13,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:13,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:13,085 INFO L85 PathProgramCache]: Analyzing trace with hash -970126646, now seen corresponding path program 1 times [2022-07-13 03:30:13,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:13,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871086978] [2022-07-13 03:30:13,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:13,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:30:13,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:30:13,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:30:13,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871086978] [2022-07-13 03:30:13,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871086978] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:30:13,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:30:13,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 03:30:13,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889942367] [2022-07-13 03:30:13,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:30:13,101 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:30:13,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:30:13,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:30:13,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:30:13,102 INFO L87 Difference]: Start difference. First operand 167938 states and 241666 transitions. cyclomatic complexity: 77824 Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:14,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:30:14,390 INFO L93 Difference]: Finished difference Result 331778 states and 471042 transitions. [2022-07-13 03:30:14,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:30:14,391 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 331778 states and 471042 transitions. [2022-07-13 03:30:16,241 INFO L131 ngComponentsAnalysis]: Automaton has 8192 accepting balls. 331776 [2022-07-13 03:30:16,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 331778 states to 331778 states and 471042 transitions. [2022-07-13 03:30:16,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 331778 [2022-07-13 03:30:17,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 331778 [2022-07-13 03:30:17,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 331778 states and 471042 transitions. [2022-07-13 03:30:17,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:30:17,246 INFO L369 hiAutomatonCegarLoop]: Abstraction has 331778 states and 471042 transitions. [2022-07-13 03:30:17,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331778 states and 471042 transitions. [2022-07-13 03:30:20,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331778 to 331778. [2022-07-13 03:30:20,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331778 states, 331778 states have (on average 1.419750556094738) internal successors, (471042), 331777 states have internal predecessors, (471042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:30:22,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331778 states to 331778 states and 471042 transitions. [2022-07-13 03:30:22,040 INFO L392 hiAutomatonCegarLoop]: Abstraction has 331778 states and 471042 transitions. [2022-07-13 03:30:22,040 INFO L374 stractBuchiCegarLoop]: Abstraction has 331778 states and 471042 transitions. [2022-07-13 03:30:22,041 INFO L287 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-07-13 03:30:22,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 331778 states and 471042 transitions. [2022-07-13 03:30:23,106 INFO L131 ngComponentsAnalysis]: Automaton has 8192 accepting balls. 331776 [2022-07-13 03:30:23,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:30:23,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:30:23,109 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:30:23,110 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:30:23,110 INFO L752 eck$LassoCheckResult]: Stem: 1011773#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); 1011759#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~p15~0#1, main_~lk15~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;main_~p15~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~lk15~0#1;havoc main_~cond~0#1; 1011760#L225-1 [2022-07-13 03:30:23,110 INFO L754 eck$LassoCheckResult]: Loop: 1011760#L225-1 assume !false;main_~cond~0#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1; 1012553#L58 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0;main_~lk15~0#1 := 0; 1012551#L93 assume !(0 != main_~p1~0#1); 1012549#L93-2 assume !(0 != main_~p2~0#1); 1012548#L97-1 assume !(0 != main_~p3~0#1); 1012546#L101-1 assume !(0 != main_~p4~0#1); 1012544#L105-1 assume !(0 != main_~p5~0#1); 1012545#L109-1 assume !(0 != main_~p6~0#1); 1012707#L113-1 assume !(0 != main_~p7~0#1); 1012702#L117-1 assume !(0 != main_~p8~0#1); 1012697#L121-1 assume !(0 != main_~p9~0#1); 1012691#L125-1 assume !(0 != main_~p10~0#1); 1012687#L129-1 assume !(0 != main_~p11~0#1); 1012683#L133-1 assume !(0 != main_~p12~0#1); 1012678#L137-1 assume !(0 != main_~p13~0#1); 1012674#L141-1 assume !(0 != main_~p14~0#1); 1012668#L145-1 assume !(0 != main_~p15~0#1); 1012661#L149-1 assume !(0 != main_~p1~0#1); 1012653#L155-1 assume !(0 != main_~p2~0#1); 1012642#L160-1 assume !(0 != main_~p3~0#1); 1012638#L165-1 assume !(0 != main_~p4~0#1); 1012636#L170-1 assume !(0 != main_~p5~0#1); 1012632#L175-1 assume !(0 != main_~p6~0#1); 1012628#L180-1 assume !(0 != main_~p7~0#1); 1012624#L185-1 assume !(0 != main_~p8~0#1); 1012620#L190-1 assume !(0 != main_~p9~0#1); 1012616#L195-1 assume !(0 != main_~p10~0#1); 1012570#L200-1 assume !(0 != main_~p11~0#1); 1012560#L205-1 assume !(0 != main_~p12~0#1); 1012558#L210-1 assume !(0 != main_~p13~0#1); 1012556#L215-1 assume !(0 != main_~p14~0#1); 1012554#L220-1 assume !(0 != main_~p15~0#1); 1011760#L225-1 [2022-07-13 03:30:23,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:23,110 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 14 times [2022-07-13 03:30:23,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:23,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583521788] [2022-07-13 03:30:23,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:23,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:23,115 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:23,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:23,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:23,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1991195000, now seen corresponding path program 1 times [2022-07-13 03:30:23,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:23,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977300306] [2022-07-13 03:30:23,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:23,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:23,124 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:23,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:23,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:30:23,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1845576266, now seen corresponding path program 1 times [2022-07-13 03:30:23,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:30:23,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957974809] [2022-07-13 03:30:23,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:30:23,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:30:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:23,138 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:30:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:30:23,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:30:23,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.07 03:30:23 BoogieIcfgContainer [2022-07-13 03:30:23,559 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-13 03:30:23,560 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 03:30:23,560 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 03:30:23,560 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 03:30:23,560 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:29:58" (3/4) ... [2022-07-13 03:30:23,563 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-13 03:30:23,621 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 03:30:23,622 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 03:30:23,623 INFO L158 Benchmark]: Toolchain (without parser) took 25438.56ms. Allocated memory was 88.1MB in the beginning and 13.7GB in the end (delta: 13.6GB). Free memory was 52.0MB in the beginning and 10.6GB in the end (delta: -10.5GB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. [2022-07-13 03:30:23,623 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 88.1MB. Free memory was 68.4MB in the beginning and 68.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:30:23,623 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.54ms. Allocated memory is still 88.1MB. Free memory was 51.8MB in the beginning and 63.6MB in the end (delta: -11.8MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2022-07-13 03:30:23,624 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.00ms. Allocated memory is still 88.1MB. Free memory was 63.6MB in the beginning and 61.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:30:23,624 INFO L158 Benchmark]: Boogie Preprocessor took 43.91ms. Allocated memory is still 88.1MB. Free memory was 61.8MB in the beginning and 60.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:30:23,624 INFO L158 Benchmark]: RCFGBuilder took 403.82ms. Allocated memory is still 88.1MB. Free memory was 60.3MB in the beginning and 47.4MB in the end (delta: 13.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-13 03:30:23,624 INFO L158 Benchmark]: BuchiAutomizer took 24583.86ms. Allocated memory was 88.1MB in the beginning and 13.7GB in the end (delta: 13.6GB). Free memory was 47.1MB in the beginning and 10.6GB in the end (delta: -10.5GB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. [2022-07-13 03:30:23,625 INFO L158 Benchmark]: Witness Printer took 62.11ms. Allocated memory is still 13.7GB. Free memory was 10.6GB in the beginning and 10.6GB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 03:30:23,626 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 88.1MB. Free memory was 68.4MB in the beginning and 68.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.54ms. Allocated memory is still 88.1MB. Free memory was 51.8MB in the beginning and 63.6MB in the end (delta: -11.8MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.00ms. Allocated memory is still 88.1MB. Free memory was 63.6MB in the beginning and 61.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.91ms. Allocated memory is still 88.1MB. Free memory was 61.8MB in the beginning and 60.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 403.82ms. Allocated memory is still 88.1MB. Free memory was 60.3MB in the beginning and 47.4MB in the end (delta: 13.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 24583.86ms. Allocated memory was 88.1MB in the beginning and 13.7GB in the end (delta: 13.6GB). Free memory was 47.1MB in the beginning and 10.6GB in the end (delta: -10.5GB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. * Witness Printer took 62.11ms. Allocated memory is still 13.7GB. Free memory was 10.6GB in the beginning and 10.6GB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (13 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.13 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 331778 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 24.4s and 14 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.1s. Büchi inclusion checks took 2.4s. Highest rank in rank-based complementation 0. Minimization of det autom 13. Minimization of nondet autom 0. Automata minimization 10.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 6.7s Buchi closure took 0.3s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 799 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 799 mSDsluCounter, 2497 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 967 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 65 IncrementalHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 1530 mSDtfsCounter, 65 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI13 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 56]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {p11=0, p13=0, lk5=0, p1=0, NULL=0, p9=0, NULL=1, cond=4, p12=0, p10=0, p14=0, p8=0, lk6=0, lk15=0, p3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2f0663ac=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@33e52a0b=0, p15=0, \result=0, lk7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@23705360=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@787200a=0, lk14=0, p2=0, lk8=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6e48cf0c=4, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1fc23778=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@471d7542=0, lk13=0, lk9=0, lk12=0, p5=0, lk2=0, p4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ddfff11=0, lk11=0, lk1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6fcff511=0, lk3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1158e595=0, p7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@552ee624=0, lk10=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@51251922=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1da8f4c6=0, p6=0, lk4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@42530561=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3e08988a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@79a48d0c=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 56]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; Loop: [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 [L93] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L101] COND FALSE !(p3 != 0) [L105] COND FALSE !(p4 != 0) [L109] COND FALSE !(p5 != 0) [L113] COND FALSE !(p6 != 0) [L117] COND FALSE !(p7 != 0) [L121] COND FALSE !(p8 != 0) [L125] COND FALSE !(p9 != 0) [L129] COND FALSE !(p10 != 0) [L133] COND FALSE !(p11 != 0) [L137] COND FALSE !(p12 != 0) [L141] COND FALSE !(p13 != 0) [L145] COND FALSE !(p14 != 0) [L149] COND FALSE !(p15 != 0) [L155] COND FALSE !(p1 != 0) [L160] COND FALSE !(p2 != 0) [L165] COND FALSE !(p3 != 0) [L170] COND FALSE !(p4 != 0) [L175] COND FALSE !(p5 != 0) [L180] COND FALSE !(p6 != 0) [L185] COND FALSE !(p7 != 0) [L190] COND FALSE !(p8 != 0) [L195] COND FALSE !(p9 != 0) [L200] COND FALSE !(p10 != 0) [L205] COND FALSE !(p11 != 0) [L210] COND FALSE !(p12 != 0) [L215] COND FALSE !(p13 != 0) [L220] COND FALSE !(p14 != 0) [L225] COND FALSE !(p15 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-07-13 03:30:23,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)