./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/diff-alloca-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/array-memsafety/diff-alloca-2.i -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 5cc33a4b6801f9f06dbbb17ff694aba4439c76c6a2b62ec290c2132cc01ea0fe --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:35:05,203 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:35:05,204 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:35:05,236 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:35:05,237 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:35:05,237 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:35:05,238 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:35:05,239 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:35:05,240 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:35:05,241 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:35:05,242 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:35:05,244 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:35:05,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:35:05,250 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:35:05,252 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:35:05,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:35:05,253 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:35:05,254 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:35:05,255 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:35:05,256 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:35:05,257 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:35:05,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:35:05,262 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:35:05,262 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:35:05,264 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:35:05,264 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:35:05,264 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:35:05,265 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:35:05,267 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:35:05,267 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:35:05,269 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:35:05,270 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:35:05,270 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:35:05,271 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:35:05,272 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:35:05,272 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:35:05,273 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:35:05,273 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:35:05,274 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:35:05,274 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:35:05,275 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:35:05,276 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:35:05,311 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:35:05,312 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:35:05,312 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:35:05,312 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:35:05,313 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:35:05,313 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:35:05,313 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:35:05,313 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:35:05,314 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:35:05,314 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:35:05,314 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:35:05,314 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:35:05,314 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:35:05,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:35:05,315 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:35:05,315 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:35:05,315 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:35:05,315 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:35:05,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:35:05,316 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:35:05,316 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:35:05,316 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:35:05,316 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:35:05,316 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:35:05,316 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:35:05,316 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:35:05,317 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:35:05,317 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:35:05,317 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:35:05,317 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:35:05,317 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:35:05,318 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:35:05,319 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 -> 5cc33a4b6801f9f06dbbb17ff694aba4439c76c6a2b62ec290c2132cc01ea0fe [2022-02-21 04:35:05,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:35:05,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:35:05,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:35:05,553 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:35:05,554 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:35:05,554 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/diff-alloca-2.i [2022-02-21 04:35:05,595 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d372a8b1/168405b04f3c41edabd280c854e8c026/FLAG9aeaa75f8 [2022-02-21 04:35:05,982 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:35:05,983 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/diff-alloca-2.i [2022-02-21 04:35:05,993 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d372a8b1/168405b04f3c41edabd280c854e8c026/FLAG9aeaa75f8 [2022-02-21 04:35:06,357 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d372a8b1/168405b04f3c41edabd280c854e8c026 [2022-02-21 04:35:06,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:35:06,362 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:35:06,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:35:06,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:35:06,366 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:35:06,367 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:35:06" (1/1) ... [2022-02-21 04:35:06,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a851f72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:06, skipping insertion in model container [2022-02-21 04:35:06,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:35:06" (1/1) ... [2022-02-21 04:35:06,374 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:35:06,409 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:35:06,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:35:06,630 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:35:06,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:35:06,703 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:35:06,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:06 WrapperNode [2022-02-21 04:35:06,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:35:06,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:35:06,706 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:35:06,706 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:35:06,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:06" (1/1) ... [2022-02-21 04:35:06,732 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:06" (1/1) ... [2022-02-21 04:35:06,763 INFO L137 Inliner]: procedures = 116, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95 [2022-02-21 04:35:06,764 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:35:06,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:35:06,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:35:06,766 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:35:06,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:06" (1/1) ... [2022-02-21 04:35:06,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:06" (1/1) ... [2022-02-21 04:35:06,787 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:06" (1/1) ... [2022-02-21 04:35:06,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:06" (1/1) ... [2022-02-21 04:35:06,792 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:06" (1/1) ... [2022-02-21 04:35:06,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:06" (1/1) ... [2022-02-21 04:35:06,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:06" (1/1) ... [2022-02-21 04:35:06,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:35:06,811 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:35:06,811 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:35:06,811 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:35:06,812 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:06" (1/1) ... [2022-02-21 04:35:06,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:06,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:06,851 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-02-21 04:35:06,856 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-02-21 04:35:06,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 04:35:06,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 04:35:06,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 04:35:06,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 04:35:06,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:35:06,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:35:06,984 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:35:06,985 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:35:07,284 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:35:07,291 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:35:07,292 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-21 04:35:07,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:07 BoogieIcfgContainer [2022-02-21 04:35:07,294 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:35:07,295 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:35:07,295 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:35:07,298 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:35:07,299 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:07,299 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:35:06" (1/3) ... [2022-02-21 04:35:07,300 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40a55607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:07, skipping insertion in model container [2022-02-21 04:35:07,300 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:07,300 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:35:06" (2/3) ... [2022-02-21 04:35:07,301 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40a55607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:35:07, skipping insertion in model container [2022-02-21 04:35:07,301 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:35:07,301 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:35:07" (3/3) ... [2022-02-21 04:35:07,303 INFO L388 chiAutomizerObserver]: Analyzing ICFG diff-alloca-2.i [2022-02-21 04:35:07,340 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:35:07,340 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:35:07,341 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:35:07,341 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:35:07,341 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:35:07,341 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:35:07,341 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:35:07,341 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:35:07,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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-02-21 04:35:07,372 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 04:35:07,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:07,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:07,377 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:35:07,377 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:07,377 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:35:07,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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-02-21 04:35:07,381 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 04:35:07,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:07,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:07,382 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:35:07,382 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:07,388 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet14#1, main_#t~post13#1, main_~i~1#1, main_#t~nondet16#1, main_#t~post15#1, main_~i~2#1, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 4#L539true assume !(main_~Alen~0#1 < 1 || main_~Alen~0#1 % 4294967296 >= 536870911); 20#L539-2true assume !(main_~Blen~0#1 < 1 || main_~Blen~0#1 % 4294967296 >= 536870911); 7#L542-1true call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~i~1#1 := 0; 8#L549-3true [2022-02-21 04:35:07,388 INFO L793 eck$LassoCheckResult]: Loop: 8#L549-3true assume !!(main_~i~1#1 < main_~Alen~0#1);call write~int(main_#t~nondet14#1, main_~A~0#1.base, main_~A~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet14#1; 18#L549-2true main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 8#L549-3true [2022-02-21 04:35:07,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:07,393 INFO L85 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2022-02-21 04:35:07,401 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:07,402 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122042266] [2022-02-21 04:35:07,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:07,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:07,499 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:07,529 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:07,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:07,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2022-02-21 04:35:07,532 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:07,533 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308089245] [2022-02-21 04:35:07,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:07,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:07,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:07,543 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:07,549 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:07,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:07,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2022-02-21 04:35:07,551 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:07,551 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105402598] [2022-02-21 04:35:07,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:07,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:07,579 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:07,624 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:08,179 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:08,180 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:08,180 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:08,181 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:08,181 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:08,181 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:08,181 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:08,181 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:08,181 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration1_Lasso [2022-02-21 04:35:08,182 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:08,182 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:08,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:08,933 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:08,936 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:08,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:08,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:08,952 INFO L229 MonitoredProcess]: Starting monitored process 2 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-02-21 04:35:08,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 04:35:08,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:08,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:08,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:08,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:08,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:08,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:08,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:08,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:08,971 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:08,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:08,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:08,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:08,990 INFO L229 MonitoredProcess]: Starting monitored process 3 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-02-21 04:35:08,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 04:35:08,992 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:08,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:08,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:08,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:08,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:09,011 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:09,011 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:09,020 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:09,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:09,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:09,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:09,038 INFO L229 MonitoredProcess]: Starting monitored process 4 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-02-21 04:35:09,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 04:35:09,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:09,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:09,046 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:09,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:09,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:09,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:09,047 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:09,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:09,056 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:09,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:09,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:09,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:09,076 INFO L229 MonitoredProcess]: Starting monitored process 5 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-02-21 04:35:09,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 04:35:09,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:09,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:09,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:09,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:09,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:09,087 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:09,087 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:09,102 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:09,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:09,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:09,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:09,120 INFO L229 MonitoredProcess]: Starting monitored process 6 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-02-21 04:35:09,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 04:35:09,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:09,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:09,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:09,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:09,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:09,130 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:09,130 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:09,145 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:09,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:09,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:09,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:09,165 INFO L229 MonitoredProcess]: Starting monitored process 7 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-02-21 04:35:09,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 04:35:09,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:09,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:09,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:09,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:09,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:09,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:09,176 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:09,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:09,177 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:09,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:09,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:09,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:09,201 INFO L229 MonitoredProcess]: Starting monitored process 8 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-02-21 04:35:09,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 04:35:09,204 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:09,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:09,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:09,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:09,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:09,214 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:09,214 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:09,226 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:09,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:09,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:09,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:09,245 INFO L229 MonitoredProcess]: Starting monitored process 9 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-02-21 04:35:09,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 04:35:09,248 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:09,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:09,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:09,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:09,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:09,258 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:09,258 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:09,283 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:09,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:09,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:09,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:09,323 INFO L229 MonitoredProcess]: Starting monitored process 10 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-02-21 04:35:09,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 04:35:09,326 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:09,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:09,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:09,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:09,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:09,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:09,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:09,349 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:09,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:09,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:09,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:09,387 INFO L229 MonitoredProcess]: Starting monitored process 11 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-02-21 04:35:09,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:09,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:09,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:09,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:09,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:09,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:09,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:09,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:09,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 04:35:09,418 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:09,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:09,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:09,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:09,437 INFO L229 MonitoredProcess]: Starting monitored process 12 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-02-21 04:35:09,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 04:35:09,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:09,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:09,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:09,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:09,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:09,448 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:09,448 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:09,457 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:09,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-02-21 04:35:09,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:09,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:09,474 INFO L229 MonitoredProcess]: Starting monitored process 13 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-02-21 04:35:09,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 04:35:09,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:09,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:09,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:09,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:09,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:09,503 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:09,503 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:09,517 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:09,574 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2022-02-21 04:35:09,574 INFO L444 ModelExtractionUtils]: 5 out of 25 variables were initially zero. Simplification set additionally 16 variables to zero. [2022-02-21 04:35:09,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:09,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:09,577 INFO L229 MonitoredProcess]: Starting monitored process 14 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-02-21 04:35:09,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 04:35:09,579 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:09,628 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-02-21 04:35:09,628 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:09,628 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, v_rep(select #length ULTIMATE.start_main_~A~0#1.base)_1) = -4*ULTIMATE.start_main_~i~1#1 + 1*v_rep(select #length ULTIMATE.start_main_~A~0#1.base)_1 Supporting invariants [1*ULTIMATE.start_main_~A~0#1.offset >= 0] [2022-02-21 04:35:09,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:09,706 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2022-02-21 04:35:09,714 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~1#1 < main_~Alen~0#1);call write~int(main_#t~nondet14#1, main_~A~0#1.base, main_~A~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet14#1;" "main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;" [2022-02-21 04:35:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:09,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:09,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:35:09,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:09,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:09,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {30#unseeded} is VALID [2022-02-21 04:35:09,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet14#1, main_#t~post13#1, main_~i~1#1, main_#t~nondet16#1, main_#t~post15#1, main_~i~2#1, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {30#unseeded} is VALID [2022-02-21 04:35:09,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#unseeded} assume !(main_~Alen~0#1 < 1 || main_~Alen~0#1 % 4294967296 >= 536870911); {30#unseeded} is VALID [2022-02-21 04:35:09,815 INFO L290 TraceCheckUtils]: 3: Hoare triple {30#unseeded} assume !(main_~Blen~0#1 < 1 || main_~Blen~0#1 % 4294967296 >= 536870911); {30#unseeded} is VALID [2022-02-21 04:35:09,816 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#unseeded} call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~i~1#1 := 0; {99#(and (>= |ULTIMATE.start_main_~A~0#1.offset| 0) unseeded)} is VALID [2022-02-21 04:35:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:09,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 04:35:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:09,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:09,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {100#(and (>= |ULTIMATE.start_main_~A~0#1.offset| 0) (>= oldRank0 (+ (* (- 4) |ULTIMATE.start_main_~i~1#1|) (select |#length| |ULTIMATE.start_main_~A~0#1.base|))))} assume !!(main_~i~1#1 < main_~Alen~0#1);call write~int(main_#t~nondet14#1, main_~A~0#1.base, main_~A~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet14#1; {120#(and (>= |ULTIMATE.start_main_~A~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~A~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~A~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~A~0#1.base|) (* |ULTIMATE.start_main_~i~1#1| (- 4)))))} is VALID [2022-02-21 04:35:09,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {120#(and (>= |ULTIMATE.start_main_~A~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~A~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 4) (select |#length| |ULTIMATE.start_main_~A~0#1.base|)) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~A~0#1.base|) (* |ULTIMATE.start_main_~i~1#1| (- 4)))))} main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {102#(and (>= |ULTIMATE.start_main_~A~0#1.offset| 0) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 4) |ULTIMATE.start_main_~i~1#1|) (select |#length| |ULTIMATE.start_main_~A~0#1.base|)))) unseeded))} is VALID [2022-02-21 04:35:09,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:09,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-02-21 04:35:09,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:09,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:09,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:09,891 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:35:09,892 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-02-21 04:35:10,035 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Result 48 states and 75 transitions. Complement of second has 7 states. [2022-02-21 04:35:10,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:10,035 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:10,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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-02-21 04:35:10,037 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 04:35:10,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:10,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:10,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-02-21 04:35:10,041 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:10,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:10,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:10,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 75 transitions. [2022-02-21 04:35:10,042 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 04:35:10,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:10,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:10,060 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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-02-21 04:35:10,062 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 04:35:10,063 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2022-02-21 04:35:10,064 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-02-21 04:35:10,065 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 04:35:10,066 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 04:35:10,066 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 48 states and 75 transitions. cyclomatic complexity: 34 [2022-02-21 04:35:10,067 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 04:35:10,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:10,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:10,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 75 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:10,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:10,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:10,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 75 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:10,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:10,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:10,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 75 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:10,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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) Stem has 48 letters. Loop has 48 letters. [2022-02-21 04:35:10,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 48 letters. Loop has 48 letters. [2022-02-21 04:35:10,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 75 transitions. cyclomatic complexity: 34 Stem has 48 letters. Loop has 48 letters. [2022-02-21 04:35:10,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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) Stem has 20 letters. Loop has 20 letters. [2022-02-21 04:35:10,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 20 letters. Loop has 20 letters. [2022-02-21 04:35:10,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 75 transitions. cyclomatic complexity: 34 Stem has 20 letters. Loop has 20 letters. [2022-02-21 04:35:10,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:10,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:10,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 75 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:35:10,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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) Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:35:10,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:35:10,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 75 transitions. cyclomatic complexity: 34 Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:35:10,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:10,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:10,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 75 transitions. cyclomatic complexity: 34 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:10,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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) Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:35:10,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:35:10,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 75 transitions. cyclomatic complexity: 34 Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:35:10,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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) Stem has 11 letters. Loop has 4 letters. [2022-02-21 04:35:10,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 11 letters. Loop has 4 letters. [2022-02-21 04:35:10,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 75 transitions. cyclomatic complexity: 34 Stem has 11 letters. Loop has 4 letters. [2022-02-21 04:35:10,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:35:10,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:35:10,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 75 transitions. cyclomatic complexity: 34 Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:35:10,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:10,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:10,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 75 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:10,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:10,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:10,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 75 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:10,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:10,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:10,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 75 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:10,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:10,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:10,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 75 transitions. cyclomatic complexity: 34 Stem has 6 letters. Loop has 2 letters. [2022-02-21 04:35:10,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:10,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:10,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 75 transitions. cyclomatic complexity: 34 Stem has 2 letters. Loop has 1 letters. [2022-02-21 04:35:10,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:10,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:10,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 75 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:10,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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) Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:35:10,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:35:10,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 75 transitions. cyclomatic complexity: 34 Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:35:10,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:10,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:10,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 75 transitions. cyclomatic complexity: 34 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:10,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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) Stem has 11 letters. Loop has 4 letters. [2022-02-21 04:35:10,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 11 letters. Loop has 4 letters. [2022-02-21 04:35:10,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 75 transitions. cyclomatic complexity: 34 Stem has 11 letters. Loop has 4 letters. [2022-02-21 04:35:10,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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) Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:35:10,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:35:10,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 75 transitions. cyclomatic complexity: 34 Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:35:10,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:35:10,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:35:10,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 75 transitions. cyclomatic complexity: 34 Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:35:10,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:10,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:10,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 75 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:10,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 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) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:10,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:10,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 75 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 2 letters. [2022-02-21 04:35:10,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,086 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:10,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-02-21 04:35:10,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-02-21 04:35:10,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 04:35:10,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 04:35:10,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 04:35:10,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:10,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 75 transitions. cyclomatic complexity: 34 [2022-02-21 04:35:10,094 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 04:35:10,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 17 states and 25 transitions. [2022-02-21 04:35:10,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 04:35:10,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-02-21 04:35:10,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 25 transitions. [2022-02-21 04:35:10,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:10,099 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2022-02-21 04:35:10,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 25 transitions. [2022-02-21 04:35:10,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-21 04:35:10,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:10,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 25 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-02-21 04:35:10,116 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 25 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-02-21 04:35:10,117 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-02-21 04:35:10,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:10,120 INFO L93 Difference]: Finished difference Result 17 states and 25 transitions. [2022-02-21 04:35:10,120 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 25 transitions. [2022-02-21 04:35:10,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:10,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:10,121 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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 17 states and 25 transitions. [2022-02-21 04:35:10,121 INFO L87 Difference]: Start difference. First operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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 17 states and 25 transitions. [2022-02-21 04:35:10,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:10,122 INFO L93 Difference]: Finished difference Result 17 states and 25 transitions. [2022-02-21 04:35:10,122 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 25 transitions. [2022-02-21 04:35:10,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:10,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:10,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:10,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:10,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-02-21 04:35:10,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2022-02-21 04:35:10,123 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2022-02-21 04:35:10,123 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2022-02-21 04:35:10,123 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:35:10,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2022-02-21 04:35:10,124 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 04:35:10,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:10,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:10,124 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:10,124 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:10,124 INFO L791 eck$LassoCheckResult]: Stem: 185#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 186#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet14#1, main_#t~post13#1, main_~i~1#1, main_#t~nondet16#1, main_#t~post15#1, main_~i~2#1, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 183#L539 assume !(main_~Alen~0#1 < 1 || main_~Alen~0#1 % 4294967296 >= 536870911); 184#L539-2 assume !(main_~Blen~0#1 < 1 || main_~Blen~0#1 % 4294967296 >= 536870911); 191#L542-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~i~1#1 := 0; 187#L549-3 assume !(main_~i~1#1 < main_~Alen~0#1); 188#L549-4 main_~i~2#1 := 0; 192#L554-3 [2022-02-21 04:35:10,125 INFO L793 eck$LassoCheckResult]: Loop: 192#L554-3 assume !!(main_~i~2#1 < main_~Blen~0#1);call write~int(main_#t~nondet16#1, main_~B~0#1.base, main_~B~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~nondet16#1; 199#L554-2 main_#t~post15#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; 192#L554-3 [2022-02-21 04:35:10,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:10,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2022-02-21 04:35:10,125 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:10,125 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71073073] [2022-02-21 04:35:10,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:10,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:10,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {237#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {237#true} is VALID [2022-02-21 04:35:10,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {237#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet14#1, main_#t~post13#1, main_~i~1#1, main_#t~nondet16#1, main_#t~post15#1, main_~i~2#1, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {237#true} is VALID [2022-02-21 04:35:10,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {237#true} assume !(main_~Alen~0#1 < 1 || main_~Alen~0#1 % 4294967296 >= 536870911); {239#(<= 1 |ULTIMATE.start_main_~Alen~0#1|)} is VALID [2022-02-21 04:35:10,184 INFO L290 TraceCheckUtils]: 3: Hoare triple {239#(<= 1 |ULTIMATE.start_main_~Alen~0#1|)} assume !(main_~Blen~0#1 < 1 || main_~Blen~0#1 % 4294967296 >= 536870911); {239#(<= 1 |ULTIMATE.start_main_~Alen~0#1|)} is VALID [2022-02-21 04:35:10,185 INFO L290 TraceCheckUtils]: 4: Hoare triple {239#(<= 1 |ULTIMATE.start_main_~Alen~0#1|)} call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~i~1#1 := 0; {240#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~Alen~0#1|))} is VALID [2022-02-21 04:35:10,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {240#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~Alen~0#1|))} assume !(main_~i~1#1 < main_~Alen~0#1); {238#false} is VALID [2022-02-21 04:35:10,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {238#false} main_~i~2#1 := 0; {238#false} is VALID [2022-02-21 04:35:10,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:10,186 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:10,186 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71073073] [2022-02-21 04:35:10,187 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71073073] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:10,187 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:10,187 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:35:10,187 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905515231] [2022-02-21 04:35:10,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:10,188 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:35:10,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:10,189 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2022-02-21 04:35:10,189 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:10,189 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212075098] [2022-02-21 04:35:10,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:10,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:10,207 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:10,211 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:10,257 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:10,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:35:10,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:35:10,260 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-02-21 04:35:10,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:10,333 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-02-21 04:35:10,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 04:35:10,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-02-21 04:35:10,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:10,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. [2022-02-21 04:35:10,341 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 04:35:10,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 25 transitions. [2022-02-21 04:35:10,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-02-21 04:35:10,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-02-21 04:35:10,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2022-02-21 04:35:10,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:10,342 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 04:35:10,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2022-02-21 04:35:10,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-02-21 04:35:10,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:10,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 25 transitions. Second operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:10,343 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 25 transitions. Second operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:10,343 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:10,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:10,344 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-02-21 04:35:10,344 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2022-02-21 04:35:10,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:10,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:10,344 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states and 25 transitions. [2022-02-21 04:35:10,344 INFO L87 Difference]: Start difference. First operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states and 25 transitions. [2022-02-21 04:35:10,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:10,345 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-02-21 04:35:10,347 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2022-02-21 04:35:10,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:10,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:10,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:10,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:10,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:35:10,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2022-02-21 04:35:10,348 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2022-02-21 04:35:10,348 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2022-02-21 04:35:10,348 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:35:10,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2022-02-21 04:35:10,349 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 04:35:10,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:10,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:10,349 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:10,349 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 04:35:10,349 INFO L791 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 264#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet14#1, main_#t~post13#1, main_~i~1#1, main_#t~nondet16#1, main_#t~post15#1, main_~i~2#1, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 261#L539 assume !(main_~Alen~0#1 < 1 || main_~Alen~0#1 % 4294967296 >= 536870911); 262#L539-2 assume !(main_~Blen~0#1 < 1 || main_~Blen~0#1 % 4294967296 >= 536870911); 265#L542-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~i~1#1 := 0; 266#L549-3 assume !!(main_~i~1#1 < main_~Alen~0#1);call write~int(main_#t~nondet14#1, main_~A~0#1.base, main_~A~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet14#1; 267#L549-2 main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 268#L549-3 assume !(main_~i~1#1 < main_~Alen~0#1); 269#L549-4 main_~i~2#1 := 0; 270#L554-3 [2022-02-21 04:35:10,349 INFO L793 eck$LassoCheckResult]: Loop: 270#L554-3 assume !!(main_~i~2#1 < main_~Blen~0#1);call write~int(main_#t~nondet16#1, main_~B~0#1.base, main_~B~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~nondet16#1; 277#L554-2 main_#t~post15#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; 270#L554-3 [2022-02-21 04:35:10,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:10,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1298440016, now seen corresponding path program 1 times [2022-02-21 04:35:10,349 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:10,350 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448375252] [2022-02-21 04:35:10,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:10,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:10,378 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:10,409 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:10,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:10,411 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 2 times [2022-02-21 04:35:10,411 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:10,411 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129516518] [2022-02-21 04:35:10,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:10,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:10,425 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:10,429 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:10,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:10,429 INFO L85 PathProgramCache]: Analyzing trace with hash -2034626574, now seen corresponding path program 1 times [2022-02-21 04:35:10,430 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:10,430 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224185000] [2022-02-21 04:35:10,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:10,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:10,460 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:10,481 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:11,117 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:11,117 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:11,117 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:11,117 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:11,118 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:11,118 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:11,118 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:11,119 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:11,119 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration3_Lasso [2022-02-21 04:35:11,119 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:11,119 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:11,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:11,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:11,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:11,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:11,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:11,443 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 04:35:11,446 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 04:35:11,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:11,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:11,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:11,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:11,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:11,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:11,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:11,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:11,929 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:35:11,929 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:35:11,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:11,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:11,942 INFO L229 MonitoredProcess]: Starting monitored process 15 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-02-21 04:35:11,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 04:35:11,949 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:11,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:11,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:11,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:11,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:11,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:11,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:11,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:11,962 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:11,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:11,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:11,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:11,989 INFO L229 MonitoredProcess]: Starting monitored process 16 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-02-21 04:35:11,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 04:35:11,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:11,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:11,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:11,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:11,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:11,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:11,999 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:11,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:12,011 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:12,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:12,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:12,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:12,030 INFO L229 MonitoredProcess]: Starting monitored process 17 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-02-21 04:35:12,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 04:35:12,032 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:12,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:12,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:12,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:12,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:12,060 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:12,060 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:12,076 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:12,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:12,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:12,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:12,109 INFO L229 MonitoredProcess]: Starting monitored process 18 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-02-21 04:35:12,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 04:35:12,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:12,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:12,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:12,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:12,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:12,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:12,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:12,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:12,133 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:12,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:12,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:12,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:12,186 INFO L229 MonitoredProcess]: Starting monitored process 19 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-02-21 04:35:12,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 04:35:12,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:12,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:12,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:12,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:12,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:12,200 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:12,200 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:12,212 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:12,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:12,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:12,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:12,239 INFO L229 MonitoredProcess]: Starting monitored process 20 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-02-21 04:35:12,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 04:35:12,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:12,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:12,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:12,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:12,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:12,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:12,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:12,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:12,298 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:12,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-02-21 04:35:12,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:12,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:12,316 INFO L229 MonitoredProcess]: Starting monitored process 21 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-02-21 04:35:12,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 04:35:12,319 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:12,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:12,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:12,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:12,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:12,327 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:12,328 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:12,334 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:12,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:12,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:12,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:12,353 INFO L229 MonitoredProcess]: Starting monitored process 22 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-02-21 04:35:12,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 04:35:12,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:12,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:12,362 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:35:12,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:12,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:12,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:12,362 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:35:12,362 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:35:12,367 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:12,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:12,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:12,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:12,387 INFO L229 MonitoredProcess]: Starting monitored process 23 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-02-21 04:35:12,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 04:35:12,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:12,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:12,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:12,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:12,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:12,398 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:12,398 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:12,400 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:12,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:12,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:12,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:12,418 INFO L229 MonitoredProcess]: Starting monitored process 24 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-02-21 04:35:12,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 04:35:12,425 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:12,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:12,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:12,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:12,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:12,434 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:12,434 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:12,451 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:12,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-02-21 04:35:12,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:12,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:12,475 INFO L229 MonitoredProcess]: Starting monitored process 25 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-02-21 04:35:12,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 04:35:12,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:12,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:12,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:12,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:12,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:12,501 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:12,501 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:12,516 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:35:12,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-02-21 04:35:12,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:12,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:12,540 INFO L229 MonitoredProcess]: Starting monitored process 26 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-02-21 04:35:12,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 04:35:12,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:35:12,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:35:12,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:35:12,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:35:12,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:35:12,565 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 04:35:12,566 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 04:35:12,594 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:35:12,611 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-02-21 04:35:12,611 INFO L444 ModelExtractionUtils]: 9 out of 43 variables were initially zero. Simplification set additionally 31 variables to zero. [2022-02-21 04:35:12,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:12,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:35:12,616 INFO L229 MonitoredProcess]: Starting monitored process 27 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-02-21 04:35:12,619 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:35:12,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 04:35:12,641 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 04:35:12,642 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:35:12,642 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2#1, ULTIMATE.start_main_~Blen~0#1) = -1*ULTIMATE.start_main_~i~2#1 + 1*ULTIMATE.start_main_~Blen~0#1 Supporting invariants [] [2022-02-21 04:35:12,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-02-21 04:35:12,718 INFO L297 tatePredicateManager]: 14 out of 14 supporting invariants were superfluous and have been removed [2022-02-21 04:35:12,721 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~2#1 < main_~Blen~0#1);call write~int(main_#t~nondet16#1, main_~B~0#1.base, main_~B~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~nondet16#1;" "main_#t~post15#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1;" [2022-02-21 04:35:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:12,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:12,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:35:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:12,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:12,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {323#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {323#unseeded} is VALID [2022-02-21 04:35:12,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {323#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet14#1, main_#t~post13#1, main_~i~1#1, main_#t~nondet16#1, main_#t~post15#1, main_~i~2#1, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {323#unseeded} is VALID [2022-02-21 04:35:12,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {323#unseeded} assume !(main_~Alen~0#1 < 1 || main_~Alen~0#1 % 4294967296 >= 536870911); {323#unseeded} is VALID [2022-02-21 04:35:12,782 INFO L290 TraceCheckUtils]: 3: Hoare triple {323#unseeded} assume !(main_~Blen~0#1 < 1 || main_~Blen~0#1 % 4294967296 >= 536870911); {323#unseeded} is VALID [2022-02-21 04:35:12,782 INFO L290 TraceCheckUtils]: 4: Hoare triple {323#unseeded} call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~i~1#1 := 0; {323#unseeded} is VALID [2022-02-21 04:35:12,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {323#unseeded} assume !!(main_~i~1#1 < main_~Alen~0#1);call write~int(main_#t~nondet14#1, main_~A~0#1.base, main_~A~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet14#1; {323#unseeded} is VALID [2022-02-21 04:35:12,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {323#unseeded} main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {323#unseeded} is VALID [2022-02-21 04:35:12,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {323#unseeded} assume !(main_~i~1#1 < main_~Alen~0#1); {323#unseeded} is VALID [2022-02-21 04:35:12,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {323#unseeded} main_~i~2#1 := 0; {323#unseeded} is VALID [2022-02-21 04:35:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:12,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:35:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:12,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:35:12,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {326#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~2#1|) |ULTIMATE.start_main_~Blen~0#1|))} assume !!(main_~i~2#1 < main_~Blen~0#1);call write~int(main_#t~nondet16#1, main_~B~0#1.base, main_~B~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~nondet16#1; {435#(and (< |ULTIMATE.start_main_~i~2#1| |ULTIMATE.start_main_~Blen~0#1|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~2#1|) |ULTIMATE.start_main_~Blen~0#1|)))} is VALID [2022-02-21 04:35:12,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {435#(and (< |ULTIMATE.start_main_~i~2#1| |ULTIMATE.start_main_~Blen~0#1|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~2#1|) |ULTIMATE.start_main_~Blen~0#1|)))} main_#t~post15#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {406#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~2#1|) |ULTIMATE.start_main_~Blen~0#1|))) unseeded)} is VALID [2022-02-21 04:35:12,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:12,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-02-21 04:35:12,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:12,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:12,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,821 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:35:12,821 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-02-21 04:35:12,875 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Result 25 states and 39 transitions. Complement of second has 6 states. [2022-02-21 04:35:12,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:35:12,876 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:12,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. cyclomatic complexity: 10 [2022-02-21 04:35:12,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:12,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:12,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-02-21 04:35:12,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:12,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:12,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:12,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 39 transitions. [2022-02-21 04:35:12,878 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:35:12,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:12,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:12,878 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 24 transitions. cyclomatic complexity: 10 [2022-02-21 04:35:12,879 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 04:35:12,879 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-02-21 04:35:12,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:35:12,880 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:35:12,880 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 39 transitions. cyclomatic complexity: 18 [2022-02-21 04:35:12,881 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 04:35:12,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:12,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:12,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:12,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:12,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:12,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:12,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 4 letters. [2022-02-21 04:35:12,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Stem has 11 letters. Loop has 4 letters. [2022-02-21 04:35:12,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 11 letters. Loop has 4 letters. [2022-02-21 04:35:12,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 25 letters. Loop has 25 letters. [2022-02-21 04:35:12,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Stem has 25 letters. Loop has 25 letters. [2022-02-21 04:35:12,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 25 letters. Loop has 25 letters. [2022-02-21 04:35:12,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 17 letters. [2022-02-21 04:35:12,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Stem has 17 letters. Loop has 17 letters. [2022-02-21 04:35:12,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 17 letters. [2022-02-21 04:35:12,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:12,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:12,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:35:12,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:12,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:12,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:12,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:35:12,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:35:12,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:35:12,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:35:12,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:35:12,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:35:12,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:35:12,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:35:12,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:35:12,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 4 letters. [2022-02-21 04:35:12,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Stem has 11 letters. Loop has 4 letters. [2022-02-21 04:35:12,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 11 letters. Loop has 4 letters. [2022-02-21 04:35:12,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:12,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:12,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 2 letters. [2022-02-21 04:35:12,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:12,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:12,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:12,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:12,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:12,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:35:12,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:12,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:12,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 2 letters. [2022-02-21 04:35:12,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:35:12,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:35:12,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:35:12,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:35:12,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:35:12,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 2 letters. [2022-02-21 04:35:12,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:35:12,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:35:12,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:35:12,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 4 letters. [2022-02-21 04:35:12,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Stem has 11 letters. Loop has 4 letters. [2022-02-21 04:35:12,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 39 transitions. cyclomatic complexity: 18 Stem has 11 letters. Loop has 4 letters. [2022-02-21 04:35:12,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,894 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:35:12,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-02-21 04:35:12,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-02-21 04:35:12,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 9 letters. Loop has 2 letters. [2022-02-21 04:35:12,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 11 letters. Loop has 2 letters. [2022-02-21 04:35:12,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:35:12,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:35:12,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 39 transitions. cyclomatic complexity: 18 [2022-02-21 04:35:12,897 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:35:12,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 26 transitions. [2022-02-21 04:35:12,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-02-21 04:35:12,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 04:35:12,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2022-02-21 04:35:12,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:12,898 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2022-02-21 04:35:12,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2022-02-21 04:35:12,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-21 04:35:12,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:12,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-02-21 04:35:12,899 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-02-21 04:35:12,899 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-02-21 04:35:12,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:12,900 INFO L93 Difference]: Finished difference Result 18 states and 26 transitions. [2022-02-21 04:35:12,900 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 26 transitions. [2022-02-21 04:35:12,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:12,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:12,901 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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 18 states and 26 transitions. [2022-02-21 04:35:12,901 INFO L87 Difference]: Start difference. First operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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 18 states and 26 transitions. [2022-02-21 04:35:12,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:12,901 INFO L93 Difference]: Finished difference Result 18 states and 26 transitions. [2022-02-21 04:35:12,902 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 26 transitions. [2022-02-21 04:35:12,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:12,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:12,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:12,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:12,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-02-21 04:35:12,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2022-02-21 04:35:12,903 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2022-02-21 04:35:12,903 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2022-02-21 04:35:12,903 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:35:12,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2022-02-21 04:35:12,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:35:12,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:12,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:12,904 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:12,904 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 04:35:12,904 INFO L791 eck$LassoCheckResult]: Stem: 475#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 476#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet14#1, main_#t~post13#1, main_~i~1#1, main_#t~nondet16#1, main_#t~post15#1, main_~i~2#1, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 473#L539 assume !(main_~Alen~0#1 < 1 || main_~Alen~0#1 % 4294967296 >= 536870911); 474#L539-2 assume !(main_~Blen~0#1 < 1 || main_~Blen~0#1 % 4294967296 >= 536870911); 477#L542-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~i~1#1 := 0; 478#L549-3 assume !!(main_~i~1#1 < main_~Alen~0#1);call write~int(main_#t~nondet14#1, main_~A~0#1.base, main_~A~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet14#1; 479#L549-2 main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 480#L549-3 assume !(main_~i~1#1 < main_~Alen~0#1); 481#L549-4 main_~i~2#1 := 0; 482#L554-3 assume !(main_~i~2#1 < main_~Blen~0#1); 485#L554-4 assume { :begin_inline_diff } true;diff_#in~A#1.base, diff_#in~A#1.offset, diff_#in~Alen#1, diff_#in~B#1.base, diff_#in~B#1.offset, diff_#in~Blen#1, diff_#in~D#1.base, diff_#in~D#1.offset := main_~A~0#1.base, main_~A~0#1.offset, main_~Alen~0#1, main_~B~0#1.base, main_~B~0#1.offset, main_~Blen~0#1, main_~D~0#1.base, main_~D~0#1.offset;havoc diff_#t~mem2#1, diff_#t~mem3#1, diff_#t~post4#1, diff_#t~mem5#1, diff_#t~post6#1, diff_#t~post7#1, diff_~j~0#1, diff_~A#1.base, diff_~A#1.offset, diff_~Alen#1, diff_~B#1.base, diff_~B#1.offset, diff_~Blen#1, diff_~D#1.base, diff_~D#1.offset, diff_~k~0#1, diff_~i~0#1, diff_~l1~0#1, diff_~l2~0#1, diff_~found~0#1;diff_~A#1.base, diff_~A#1.offset := diff_#in~A#1.base, diff_#in~A#1.offset;diff_~Alen#1 := diff_#in~Alen#1;diff_~B#1.base, diff_~B#1.offset := diff_#in~B#1.base, diff_#in~B#1.offset;diff_~Blen#1 := diff_#in~Blen#1;diff_~D#1.base, diff_~D#1.offset := diff_#in~D#1.base, diff_#in~D#1.offset;diff_~k~0#1 := 0;diff_~i~0#1 := 0;diff_~l1~0#1 := diff_~Alen#1;diff_~l2~0#1 := diff_~Blen#1;havoc diff_~found~0#1; 483#L519-2 [2022-02-21 04:35:12,904 INFO L793 eck$LassoCheckResult]: Loop: 483#L519-2 assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; 484#L523-2 assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); 486#L522-2 assume 0 == diff_~found~0#1;call diff_#t~mem5#1 := read~int(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call write~int(diff_#t~mem5#1, diff_~D#1.base, diff_~D#1.offset + 4 * diff_~k~0#1, 4);havoc diff_#t~mem5#1;diff_#t~post6#1 := diff_~k~0#1;diff_~k~0#1 := 1 + diff_#t~post6#1;havoc diff_#t~post6#1; 487#L529-1 diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; 483#L519-2 [2022-02-21 04:35:12,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:12,905 INFO L85 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2022-02-21 04:35:12,905 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:12,905 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085876009] [2022-02-21 04:35:12,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:12,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:12,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {530#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {530#true} is VALID [2022-02-21 04:35:12,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {530#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet14#1, main_#t~post13#1, main_~i~1#1, main_#t~nondet16#1, main_#t~post15#1, main_~i~2#1, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {530#true} is VALID [2022-02-21 04:35:12,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {530#true} assume !(main_~Alen~0#1 < 1 || main_~Alen~0#1 % 4294967296 >= 536870911); {530#true} is VALID [2022-02-21 04:35:12,940 INFO L290 TraceCheckUtils]: 3: Hoare triple {530#true} assume !(main_~Blen~0#1 < 1 || main_~Blen~0#1 % 4294967296 >= 536870911); {532#(<= 1 |ULTIMATE.start_main_~Blen~0#1|)} is VALID [2022-02-21 04:35:12,940 INFO L290 TraceCheckUtils]: 4: Hoare triple {532#(<= 1 |ULTIMATE.start_main_~Blen~0#1|)} call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~i~1#1 := 0; {532#(<= 1 |ULTIMATE.start_main_~Blen~0#1|)} is VALID [2022-02-21 04:35:12,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {532#(<= 1 |ULTIMATE.start_main_~Blen~0#1|)} assume !!(main_~i~1#1 < main_~Alen~0#1);call write~int(main_#t~nondet14#1, main_~A~0#1.base, main_~A~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet14#1; {532#(<= 1 |ULTIMATE.start_main_~Blen~0#1|)} is VALID [2022-02-21 04:35:12,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {532#(<= 1 |ULTIMATE.start_main_~Blen~0#1|)} main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {532#(<= 1 |ULTIMATE.start_main_~Blen~0#1|)} is VALID [2022-02-21 04:35:12,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {532#(<= 1 |ULTIMATE.start_main_~Blen~0#1|)} assume !(main_~i~1#1 < main_~Alen~0#1); {532#(<= 1 |ULTIMATE.start_main_~Blen~0#1|)} is VALID [2022-02-21 04:35:12,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {532#(<= 1 |ULTIMATE.start_main_~Blen~0#1|)} main_~i~2#1 := 0; {533#(and (<= 1 |ULTIMATE.start_main_~Blen~0#1|) (= |ULTIMATE.start_main_~i~2#1| 0))} is VALID [2022-02-21 04:35:12,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {533#(and (<= 1 |ULTIMATE.start_main_~Blen~0#1|) (= |ULTIMATE.start_main_~i~2#1| 0))} assume !(main_~i~2#1 < main_~Blen~0#1); {531#false} is VALID [2022-02-21 04:35:12,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {531#false} assume { :begin_inline_diff } true;diff_#in~A#1.base, diff_#in~A#1.offset, diff_#in~Alen#1, diff_#in~B#1.base, diff_#in~B#1.offset, diff_#in~Blen#1, diff_#in~D#1.base, diff_#in~D#1.offset := main_~A~0#1.base, main_~A~0#1.offset, main_~Alen~0#1, main_~B~0#1.base, main_~B~0#1.offset, main_~Blen~0#1, main_~D~0#1.base, main_~D~0#1.offset;havoc diff_#t~mem2#1, diff_#t~mem3#1, diff_#t~post4#1, diff_#t~mem5#1, diff_#t~post6#1, diff_#t~post7#1, diff_~j~0#1, diff_~A#1.base, diff_~A#1.offset, diff_~Alen#1, diff_~B#1.base, diff_~B#1.offset, diff_~Blen#1, diff_~D#1.base, diff_~D#1.offset, diff_~k~0#1, diff_~i~0#1, diff_~l1~0#1, diff_~l2~0#1, diff_~found~0#1;diff_~A#1.base, diff_~A#1.offset := diff_#in~A#1.base, diff_#in~A#1.offset;diff_~Alen#1 := diff_#in~Alen#1;diff_~B#1.base, diff_~B#1.offset := diff_#in~B#1.base, diff_#in~B#1.offset;diff_~Blen#1 := diff_#in~Blen#1;diff_~D#1.base, diff_~D#1.offset := diff_#in~D#1.base, diff_#in~D#1.offset;diff_~k~0#1 := 0;diff_~i~0#1 := 0;diff_~l1~0#1 := diff_~Alen#1;diff_~l2~0#1 := diff_~Blen#1;havoc diff_~found~0#1; {531#false} is VALID [2022-02-21 04:35:12,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 04:35:12,943 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:12,943 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085876009] [2022-02-21 04:35:12,943 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085876009] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:12,943 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:12,943 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:35:12,943 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442563087] [2022-02-21 04:35:12,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:12,944 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:35:12,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:12,944 INFO L85 PathProgramCache]: Analyzing trace with hash 2531692, now seen corresponding path program 1 times [2022-02-21 04:35:12,944 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:12,944 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122509563] [2022-02-21 04:35:12,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:12,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:12,951 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:12,955 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:13,067 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:13,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:35:13,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:35:13,068 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-02-21 04:35:13,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:13,117 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2022-02-21 04:35:13,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 04:35:13,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-02-21 04:35:13,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:13,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2022-02-21 04:35:13,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:35:13,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 26 transitions. [2022-02-21 04:35:13,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 04:35:13,128 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 04:35:13,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2022-02-21 04:35:13,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:13,128 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-02-21 04:35:13,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2022-02-21 04:35:13,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-02-21 04:35:13,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:13,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 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-02-21 04:35:13,130 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 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-02-21 04:35:13,130 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 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-02-21 04:35:13,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:13,131 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2022-02-21 04:35:13,131 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2022-02-21 04:35:13,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:13,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:13,131 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 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 19 states and 26 transitions. [2022-02-21 04:35:13,131 INFO L87 Difference]: Start difference. First operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 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 19 states and 26 transitions. [2022-02-21 04:35:13,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:13,132 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2022-02-21 04:35:13,132 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2022-02-21 04:35:13,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:13,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:13,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:13,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:13,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 17 states have internal predecessors, (25), 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-02-21 04:35:13,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2022-02-21 04:35:13,133 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 04:35:13,133 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2022-02-21 04:35:13,133 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:35:13,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2022-02-21 04:35:13,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:35:13,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:13,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:13,134 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:13,134 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 04:35:13,134 INFO L791 eck$LassoCheckResult]: Stem: 557#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 558#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet14#1, main_#t~post13#1, main_~i~1#1, main_#t~nondet16#1, main_#t~post15#1, main_~i~2#1, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 555#L539 assume !(main_~Alen~0#1 < 1 || main_~Alen~0#1 % 4294967296 >= 536870911); 556#L539-2 assume !(main_~Blen~0#1 < 1 || main_~Blen~0#1 % 4294967296 >= 536870911); 559#L542-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~i~1#1 := 0; 560#L549-3 assume !!(main_~i~1#1 < main_~Alen~0#1);call write~int(main_#t~nondet14#1, main_~A~0#1.base, main_~A~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet14#1; 561#L549-2 main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 562#L549-3 assume !(main_~i~1#1 < main_~Alen~0#1); 563#L549-4 main_~i~2#1 := 0; 564#L554-3 assume !!(main_~i~2#1 < main_~Blen~0#1);call write~int(main_#t~nondet16#1, main_~B~0#1.base, main_~B~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~nondet16#1; 571#L554-2 main_#t~post15#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; 572#L554-3 assume !(main_~i~2#1 < main_~Blen~0#1); 567#L554-4 assume { :begin_inline_diff } true;diff_#in~A#1.base, diff_#in~A#1.offset, diff_#in~Alen#1, diff_#in~B#1.base, diff_#in~B#1.offset, diff_#in~Blen#1, diff_#in~D#1.base, diff_#in~D#1.offset := main_~A~0#1.base, main_~A~0#1.offset, main_~Alen~0#1, main_~B~0#1.base, main_~B~0#1.offset, main_~Blen~0#1, main_~D~0#1.base, main_~D~0#1.offset;havoc diff_#t~mem2#1, diff_#t~mem3#1, diff_#t~post4#1, diff_#t~mem5#1, diff_#t~post6#1, diff_#t~post7#1, diff_~j~0#1, diff_~A#1.base, diff_~A#1.offset, diff_~Alen#1, diff_~B#1.base, diff_~B#1.offset, diff_~Blen#1, diff_~D#1.base, diff_~D#1.offset, diff_~k~0#1, diff_~i~0#1, diff_~l1~0#1, diff_~l2~0#1, diff_~found~0#1;diff_~A#1.base, diff_~A#1.offset := diff_#in~A#1.base, diff_#in~A#1.offset;diff_~Alen#1 := diff_#in~Alen#1;diff_~B#1.base, diff_~B#1.offset := diff_#in~B#1.base, diff_#in~B#1.offset;diff_~Blen#1 := diff_#in~Blen#1;diff_~D#1.base, diff_~D#1.offset := diff_#in~D#1.base, diff_#in~D#1.offset;diff_~k~0#1 := 0;diff_~i~0#1 := 0;diff_~l1~0#1 := diff_~Alen#1;diff_~l2~0#1 := diff_~Blen#1;havoc diff_~found~0#1; 565#L519-2 [2022-02-21 04:35:13,134 INFO L793 eck$LassoCheckResult]: Loop: 565#L519-2 assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; 566#L523-2 assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); 568#L522-2 assume 0 == diff_~found~0#1;call diff_#t~mem5#1 := read~int(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call write~int(diff_#t~mem5#1, diff_~D#1.base, diff_~D#1.offset + 4 * diff_~k~0#1, 4);havoc diff_#t~mem5#1;diff_#t~post6#1 := diff_~k~0#1;diff_~k~0#1 := 1 + diff_#t~post6#1;havoc diff_#t~post6#1; 569#L529-1 diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; 565#L519-2 [2022-02-21 04:35:13,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:13,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2022-02-21 04:35:13,135 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:13,136 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811170638] [2022-02-21 04:35:13,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:13,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:13,157 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:13,173 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:13,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:13,174 INFO L85 PathProgramCache]: Analyzing trace with hash 2531692, now seen corresponding path program 2 times [2022-02-21 04:35:13,174 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:13,174 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136416786] [2022-02-21 04:35:13,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:13,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:13,181 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:13,184 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:13,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:13,184 INFO L85 PathProgramCache]: Analyzing trace with hash -796463931, now seen corresponding path program 1 times [2022-02-21 04:35:13,185 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:13,185 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543115263] [2022-02-21 04:35:13,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:13,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:13,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {618#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {618#true} is VALID [2022-02-21 04:35:13,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {618#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet14#1, main_#t~post13#1, main_~i~1#1, main_#t~nondet16#1, main_#t~post15#1, main_~i~2#1, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {618#true} is VALID [2022-02-21 04:35:13,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {618#true} assume !(main_~Alen~0#1 < 1 || main_~Alen~0#1 % 4294967296 >= 536870911); {618#true} is VALID [2022-02-21 04:35:13,238 INFO L290 TraceCheckUtils]: 3: Hoare triple {618#true} assume !(main_~Blen~0#1 < 1 || main_~Blen~0#1 % 4294967296 >= 536870911); {620#(<= 1 |ULTIMATE.start_main_~Blen~0#1|)} is VALID [2022-02-21 04:35:13,238 INFO L290 TraceCheckUtils]: 4: Hoare triple {620#(<= 1 |ULTIMATE.start_main_~Blen~0#1|)} call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~i~1#1 := 0; {620#(<= 1 |ULTIMATE.start_main_~Blen~0#1|)} is VALID [2022-02-21 04:35:13,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {620#(<= 1 |ULTIMATE.start_main_~Blen~0#1|)} assume !!(main_~i~1#1 < main_~Alen~0#1);call write~int(main_#t~nondet14#1, main_~A~0#1.base, main_~A~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet14#1; {620#(<= 1 |ULTIMATE.start_main_~Blen~0#1|)} is VALID [2022-02-21 04:35:13,239 INFO L290 TraceCheckUtils]: 6: Hoare triple {620#(<= 1 |ULTIMATE.start_main_~Blen~0#1|)} main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {620#(<= 1 |ULTIMATE.start_main_~Blen~0#1|)} is VALID [2022-02-21 04:35:13,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {620#(<= 1 |ULTIMATE.start_main_~Blen~0#1|)} assume !(main_~i~1#1 < main_~Alen~0#1); {620#(<= 1 |ULTIMATE.start_main_~Blen~0#1|)} is VALID [2022-02-21 04:35:13,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {620#(<= 1 |ULTIMATE.start_main_~Blen~0#1|)} main_~i~2#1 := 0; {620#(<= 1 |ULTIMATE.start_main_~Blen~0#1|)} is VALID [2022-02-21 04:35:13,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {620#(<= 1 |ULTIMATE.start_main_~Blen~0#1|)} assume !!(main_~i~2#1 < main_~Blen~0#1);call write~int(main_#t~nondet16#1, main_~B~0#1.base, main_~B~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~nondet16#1; {620#(<= 1 |ULTIMATE.start_main_~Blen~0#1|)} is VALID [2022-02-21 04:35:13,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {620#(<= 1 |ULTIMATE.start_main_~Blen~0#1|)} main_#t~post15#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {620#(<= 1 |ULTIMATE.start_main_~Blen~0#1|)} is VALID [2022-02-21 04:35:13,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {620#(<= 1 |ULTIMATE.start_main_~Blen~0#1|)} assume !(main_~i~2#1 < main_~Blen~0#1); {620#(<= 1 |ULTIMATE.start_main_~Blen~0#1|)} is VALID [2022-02-21 04:35:13,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {620#(<= 1 |ULTIMATE.start_main_~Blen~0#1|)} assume { :begin_inline_diff } true;diff_#in~A#1.base, diff_#in~A#1.offset, diff_#in~Alen#1, diff_#in~B#1.base, diff_#in~B#1.offset, diff_#in~Blen#1, diff_#in~D#1.base, diff_#in~D#1.offset := main_~A~0#1.base, main_~A~0#1.offset, main_~Alen~0#1, main_~B~0#1.base, main_~B~0#1.offset, main_~Blen~0#1, main_~D~0#1.base, main_~D~0#1.offset;havoc diff_#t~mem2#1, diff_#t~mem3#1, diff_#t~post4#1, diff_#t~mem5#1, diff_#t~post6#1, diff_#t~post7#1, diff_~j~0#1, diff_~A#1.base, diff_~A#1.offset, diff_~Alen#1, diff_~B#1.base, diff_~B#1.offset, diff_~Blen#1, diff_~D#1.base, diff_~D#1.offset, diff_~k~0#1, diff_~i~0#1, diff_~l1~0#1, diff_~l2~0#1, diff_~found~0#1;diff_~A#1.base, diff_~A#1.offset := diff_#in~A#1.base, diff_#in~A#1.offset;diff_~Alen#1 := diff_#in~Alen#1;diff_~B#1.base, diff_~B#1.offset := diff_#in~B#1.base, diff_#in~B#1.offset;diff_~Blen#1 := diff_#in~Blen#1;diff_~D#1.base, diff_~D#1.offset := diff_#in~D#1.base, diff_#in~D#1.offset;diff_~k~0#1 := 0;diff_~i~0#1 := 0;diff_~l1~0#1 := diff_~Alen#1;diff_~l2~0#1 := diff_~Blen#1;havoc diff_~found~0#1; {621#(<= 1 |ULTIMATE.start_diff_~l2~0#1|)} is VALID [2022-02-21 04:35:13,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {621#(<= 1 |ULTIMATE.start_diff_~l2~0#1|)} assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; {622#(and (<= 1 |ULTIMATE.start_diff_~l2~0#1|) (= |ULTIMATE.start_diff_~found~0#1| 0) (= |ULTIMATE.start_diff_~j~0#1| 0))} is VALID [2022-02-21 04:35:13,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {622#(and (<= 1 |ULTIMATE.start_diff_~l2~0#1|) (= |ULTIMATE.start_diff_~found~0#1| 0) (= |ULTIMATE.start_diff_~j~0#1| 0))} assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); {619#false} is VALID [2022-02-21 04:35:13,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {619#false} assume 0 == diff_~found~0#1;call diff_#t~mem5#1 := read~int(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call write~int(diff_#t~mem5#1, diff_~D#1.base, diff_~D#1.offset + 4 * diff_~k~0#1, 4);havoc diff_#t~mem5#1;diff_#t~post6#1 := diff_~k~0#1;diff_~k~0#1 := 1 + diff_#t~post6#1;havoc diff_#t~post6#1; {619#false} is VALID [2022-02-21 04:35:13,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {619#false} diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; {619#false} is VALID [2022-02-21 04:35:13,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 04:35:13,246 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:13,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543115263] [2022-02-21 04:35:13,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543115263] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:13,246 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:13,246 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:35:13,246 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290157082] [2022-02-21 04:35:13,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:13,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 04:35:13,504 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:13,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:35:13,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:35:13,505 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-02-21 04:35:13,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:13,586 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2022-02-21 04:35:13,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:35:13,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-02-21 04:35:13,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:13,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 28 transitions. [2022-02-21 04:35:13,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 04:35:13,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 28 transitions. [2022-02-21 04:35:13,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-02-21 04:35:13,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-02-21 04:35:13,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2022-02-21 04:35:13,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:13,605 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2022-02-21 04:35:13,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2022-02-21 04:35:13,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-02-21 04:35:13,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:13,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 28 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 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-02-21 04:35:13,608 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 28 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 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-02-21 04:35:13,608 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 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-02-21 04:35:13,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:13,609 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2022-02-21 04:35:13,609 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2022-02-21 04:35:13,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:13,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:13,609 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 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 20 states and 28 transitions. [2022-02-21 04:35:13,609 INFO L87 Difference]: Start difference. First operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 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 20 states and 28 transitions. [2022-02-21 04:35:13,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:13,610 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2022-02-21 04:35:13,610 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2022-02-21 04:35:13,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:13,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:13,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:13,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:13,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 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-02-21 04:35:13,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2022-02-21 04:35:13,612 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-02-21 04:35:13,612 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-02-21 04:35:13,612 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 04:35:13,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2022-02-21 04:35:13,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 04:35:13,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:13,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:13,613 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:13,613 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 04:35:13,613 INFO L791 eck$LassoCheckResult]: Stem: 649#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 650#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet14#1, main_#t~post13#1, main_~i~1#1, main_#t~nondet16#1, main_#t~post15#1, main_~i~2#1, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 647#L539 assume !(main_~Alen~0#1 < 1 || main_~Alen~0#1 % 4294967296 >= 536870911); 648#L539-2 assume !(main_~Blen~0#1 < 1 || main_~Blen~0#1 % 4294967296 >= 536870911); 651#L542-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~i~1#1 := 0; 652#L549-3 assume !!(main_~i~1#1 < main_~Alen~0#1);call write~int(main_#t~nondet14#1, main_~A~0#1.base, main_~A~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet14#1; 653#L549-2 main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 654#L549-3 assume !(main_~i~1#1 < main_~Alen~0#1); 655#L549-4 main_~i~2#1 := 0; 656#L554-3 assume !!(main_~i~2#1 < main_~Blen~0#1);call write~int(main_#t~nondet16#1, main_~B~0#1.base, main_~B~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~nondet16#1; 664#L554-2 main_#t~post15#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; 665#L554-3 assume !(main_~i~2#1 < main_~Blen~0#1); 659#L554-4 assume { :begin_inline_diff } true;diff_#in~A#1.base, diff_#in~A#1.offset, diff_#in~Alen#1, diff_#in~B#1.base, diff_#in~B#1.offset, diff_#in~Blen#1, diff_#in~D#1.base, diff_#in~D#1.offset := main_~A~0#1.base, main_~A~0#1.offset, main_~Alen~0#1, main_~B~0#1.base, main_~B~0#1.offset, main_~Blen~0#1, main_~D~0#1.base, main_~D~0#1.offset;havoc diff_#t~mem2#1, diff_#t~mem3#1, diff_#t~post4#1, diff_#t~mem5#1, diff_#t~post6#1, diff_#t~post7#1, diff_~j~0#1, diff_~A#1.base, diff_~A#1.offset, diff_~Alen#1, diff_~B#1.base, diff_~B#1.offset, diff_~Blen#1, diff_~D#1.base, diff_~D#1.offset, diff_~k~0#1, diff_~i~0#1, diff_~l1~0#1, diff_~l2~0#1, diff_~found~0#1;diff_~A#1.base, diff_~A#1.offset := diff_#in~A#1.base, diff_#in~A#1.offset;diff_~Alen#1 := diff_#in~Alen#1;diff_~B#1.base, diff_~B#1.offset := diff_#in~B#1.base, diff_#in~B#1.offset;diff_~Blen#1 := diff_#in~Blen#1;diff_~D#1.base, diff_~D#1.offset := diff_#in~D#1.base, diff_#in~D#1.offset;diff_~k~0#1 := 0;diff_~i~0#1 := 0;diff_~l1~0#1 := diff_~Alen#1;diff_~l2~0#1 := diff_~Blen#1;havoc diff_~found~0#1; 657#L519-2 [2022-02-21 04:35:13,614 INFO L793 eck$LassoCheckResult]: Loop: 657#L519-2 assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; 658#L523-2 assume !!(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1);call diff_#t~mem2#1 := read~int(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call diff_#t~mem3#1 := read~int(diff_~B#1.base, diff_~B#1.offset + 4 * diff_~j~0#1, 4); 662#L523 assume diff_#t~mem2#1 == diff_#t~mem3#1;havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_~found~0#1 := 1; 663#L523-2 assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); 660#L522-2 assume 0 == diff_~found~0#1;call diff_#t~mem5#1 := read~int(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call write~int(diff_#t~mem5#1, diff_~D#1.base, diff_~D#1.offset + 4 * diff_~k~0#1, 4);havoc diff_#t~mem5#1;diff_#t~post6#1 := diff_~k~0#1;diff_~k~0#1 := 1 + diff_#t~post6#1;havoc diff_#t~post6#1; 661#L529-1 diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; 657#L519-2 [2022-02-21 04:35:13,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:13,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 2 times [2022-02-21 04:35:13,614 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:13,615 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525353340] [2022-02-21 04:35:13,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:13,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:13,637 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:13,653 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:13,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:13,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1860447319, now seen corresponding path program 1 times [2022-02-21 04:35:13,664 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:13,664 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155684828] [2022-02-21 04:35:13,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:13,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:35:13,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {711#true} assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; {711#true} is VALID [2022-02-21 04:35:13,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {711#true} assume !!(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1);call diff_#t~mem2#1 := read~int(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call diff_#t~mem3#1 := read~int(diff_~B#1.base, diff_~B#1.offset + 4 * diff_~j~0#1, 4); {713#(<= (+ |ULTIMATE.start_diff_~j~0#1| 1) |ULTIMATE.start_diff_~l2~0#1|)} is VALID [2022-02-21 04:35:13,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {713#(<= (+ |ULTIMATE.start_diff_~j~0#1| 1) |ULTIMATE.start_diff_~l2~0#1|)} assume diff_#t~mem2#1 == diff_#t~mem3#1;havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_~found~0#1 := 1; {713#(<= (+ |ULTIMATE.start_diff_~j~0#1| 1) |ULTIMATE.start_diff_~l2~0#1|)} is VALID [2022-02-21 04:35:13,694 INFO L290 TraceCheckUtils]: 3: Hoare triple {713#(<= (+ |ULTIMATE.start_diff_~j~0#1| 1) |ULTIMATE.start_diff_~l2~0#1|)} assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); {714#(not (= |ULTIMATE.start_diff_~found~0#1| 0))} is VALID [2022-02-21 04:35:13,694 INFO L290 TraceCheckUtils]: 4: Hoare triple {714#(not (= |ULTIMATE.start_diff_~found~0#1| 0))} assume 0 == diff_~found~0#1;call diff_#t~mem5#1 := read~int(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call write~int(diff_#t~mem5#1, diff_~D#1.base, diff_~D#1.offset + 4 * diff_~k~0#1, 4);havoc diff_#t~mem5#1;diff_#t~post6#1 := diff_~k~0#1;diff_~k~0#1 := 1 + diff_#t~post6#1;havoc diff_#t~post6#1; {712#false} is VALID [2022-02-21 04:35:13,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {712#false} diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; {712#false} is VALID [2022-02-21 04:35:13,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:35:13,695 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:35:13,695 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155684828] [2022-02-21 04:35:13,695 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155684828] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:35:13,696 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:35:13,696 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:35:13,696 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363677158] [2022-02-21 04:35:13,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:35:13,696 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:35:13,697 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:35:13,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:35:13,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:35:13,697 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-02-21 04:35:13,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:13,759 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-02-21 04:35:13,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:35:13,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-02-21 04:35:13,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:35:13,766 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2022-02-21 04:35:13,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-02-21 04:35:13,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 32 transitions. [2022-02-21 04:35:13,769 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-02-21 04:35:13,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-02-21 04:35:13,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2022-02-21 04:35:13,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:35:13,770 INFO L681 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-02-21 04:35:13,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2022-02-21 04:35:13,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-02-21 04:35:13,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:35:13,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 32 transitions. Second operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 states have internal predecessors, (28), 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-02-21 04:35:13,772 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 32 transitions. Second operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 states have internal predecessors, (28), 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-02-21 04:35:13,772 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 states have internal predecessors, (28), 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-02-21 04:35:13,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:13,773 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-02-21 04:35:13,773 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-21 04:35:13,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:13,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:13,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 states have internal predecessors, (28), 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 25 states and 32 transitions. [2022-02-21 04:35:13,773 INFO L87 Difference]: Start difference. First operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 states have internal predecessors, (28), 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 25 states and 32 transitions. [2022-02-21 04:35:13,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:35:13,774 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-02-21 04:35:13,774 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-21 04:35:13,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:35:13,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:35:13,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:35:13,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:35:13,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 20 states have internal predecessors, (28), 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-02-21 04:35:13,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2022-02-21 04:35:13,776 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2022-02-21 04:35:13,776 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2022-02-21 04:35:13,776 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 04:35:13,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2022-02-21 04:35:13,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 04:35:13,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:35:13,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:35:13,777 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:35:13,777 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 04:35:13,777 INFO L791 eck$LassoCheckResult]: Stem: 744#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 745#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~nondet14#1, main_#t~post13#1, main_~i~1#1, main_#t~nondet16#1, main_#t~post15#1, main_~i~2#1, main_~Alen~0#1, main_~Blen~0#1, main_~A~0#1.base, main_~A~0#1.offset, main_~B~0#1.base, main_~B~0#1.offset, main_~D~0#1.base, main_~D~0#1.offset;main_~Alen~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;main_~Blen~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; 742#L539 assume !(main_~Alen~0#1 < 1 || main_~Alen~0#1 % 4294967296 >= 536870911); 743#L539-2 assume !(main_~Blen~0#1 < 1 || main_~Blen~0#1 % 4294967296 >= 536870911); 746#L542-1 call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~A~0#1.base, main_~A~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnStack(4 * main_~Blen~0#1);main_~B~0#1.base, main_~B~0#1.offset := main_#t~malloc11#1.base, main_#t~malloc11#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnStack(4 * main_~Alen~0#1);main_~D~0#1.base, main_~D~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;main_~i~1#1 := 0; 747#L549-3 assume !!(main_~i~1#1 < main_~Alen~0#1);call write~int(main_#t~nondet14#1, main_~A~0#1.base, main_~A~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet14#1; 748#L549-2 main_#t~post13#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; 749#L549-3 assume !(main_~i~1#1 < main_~Alen~0#1); 750#L549-4 main_~i~2#1 := 0; 751#L554-3 assume !!(main_~i~2#1 < main_~Blen~0#1);call write~int(main_#t~nondet16#1, main_~B~0#1.base, main_~B~0#1.offset + 4 * main_~i~2#1, 4);havoc main_#t~nondet16#1; 760#L554-2 main_#t~post15#1 := main_~i~2#1;main_~i~2#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; 761#L554-3 assume !(main_~i~2#1 < main_~Blen~0#1); 754#L554-4 assume { :begin_inline_diff } true;diff_#in~A#1.base, diff_#in~A#1.offset, diff_#in~Alen#1, diff_#in~B#1.base, diff_#in~B#1.offset, diff_#in~Blen#1, diff_#in~D#1.base, diff_#in~D#1.offset := main_~A~0#1.base, main_~A~0#1.offset, main_~Alen~0#1, main_~B~0#1.base, main_~B~0#1.offset, main_~Blen~0#1, main_~D~0#1.base, main_~D~0#1.offset;havoc diff_#t~mem2#1, diff_#t~mem3#1, diff_#t~post4#1, diff_#t~mem5#1, diff_#t~post6#1, diff_#t~post7#1, diff_~j~0#1, diff_~A#1.base, diff_~A#1.offset, diff_~Alen#1, diff_~B#1.base, diff_~B#1.offset, diff_~Blen#1, diff_~D#1.base, diff_~D#1.offset, diff_~k~0#1, diff_~i~0#1, diff_~l1~0#1, diff_~l2~0#1, diff_~found~0#1;diff_~A#1.base, diff_~A#1.offset := diff_#in~A#1.base, diff_#in~A#1.offset;diff_~Alen#1 := diff_#in~Alen#1;diff_~B#1.base, diff_~B#1.offset := diff_#in~B#1.base, diff_#in~B#1.offset;diff_~Blen#1 := diff_#in~Blen#1;diff_~D#1.base, diff_~D#1.offset := diff_#in~D#1.base, diff_#in~D#1.offset;diff_~k~0#1 := 0;diff_~i~0#1 := 0;diff_~l1~0#1 := diff_~Alen#1;diff_~l2~0#1 := diff_~Blen#1;havoc diff_~found~0#1; 752#L519-2 [2022-02-21 04:35:13,777 INFO L793 eck$LassoCheckResult]: Loop: 752#L519-2 assume !!(diff_~i~0#1 < diff_~l1~0#1);diff_~j~0#1 := 0;diff_~found~0#1 := 0; 753#L523-2 assume !!(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1);call diff_#t~mem2#1 := read~int(diff_~A#1.base, diff_~A#1.offset + 4 * diff_~i~0#1, 4);call diff_#t~mem3#1 := read~int(diff_~B#1.base, diff_~B#1.offset + 4 * diff_~j~0#1, 4); 757#L523 assume diff_#t~mem2#1 == diff_#t~mem3#1;havoc diff_#t~mem2#1;havoc diff_#t~mem3#1;diff_~found~0#1 := 1; 758#L523-2 assume !(diff_~j~0#1 < diff_~l2~0#1 && 0 == diff_~found~0#1); 755#L522-2 assume !(0 == diff_~found~0#1); 756#L529-1 diff_#t~post7#1 := diff_~i~0#1;diff_~i~0#1 := 1 + diff_#t~post7#1;havoc diff_#t~post7#1; 752#L519-2 [2022-02-21 04:35:13,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:13,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 3 times [2022-02-21 04:35:13,778 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:13,778 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033528760] [2022-02-21 04:35:13,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:13,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:13,805 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:13,819 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:13,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:13,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1860447257, now seen corresponding path program 1 times [2022-02-21 04:35:13,819 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:13,819 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964963512] [2022-02-21 04:35:13,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:13,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:13,825 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:13,828 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:13,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:35:13,829 INFO L85 PathProgramCache]: Analyzing trace with hash -896094976, now seen corresponding path program 1 times [2022-02-21 04:35:13,829 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:35:13,829 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850313660] [2022-02-21 04:35:13,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:35:13,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:35:13,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:13,848 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:35:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:35:13,863 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:35:14,758 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:35:14,758 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:35:14,758 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:35:14,758 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:35:14,758 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:35:14,758 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:35:14,759 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:35:14,759 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:35:14,759 INFO L133 ssoRankerPreferences]: Filename of dumped script: diff-alloca-2.i_Iteration7_Lasso [2022-02-21 04:35:14,759 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:35:14,759 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:35:14,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:14,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:14,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:14,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:14,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:14,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:14,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:14,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:14,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:14,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:14,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:14,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:14,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:35:14,898 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: v_rep(select (select #memory_int ULTIMATE.start_diff_~A#1.base) (+ ULTIMATE.start_diff_~A#1.offset (* ULTIMATE.start_diff_~i~0#1 4)))_1 was not added to the transformula! at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:509) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-21 04:35:14,901 INFO L158 Benchmark]: Toolchain (without parser) took 8538.85ms. Allocated memory was 104.9MB in the beginning and 186.6MB in the end (delta: 81.8MB). Free memory was 81.1MB in the beginning and 86.5MB in the end (delta: -5.4MB). Peak memory consumption was 112.5MB. Max. memory is 16.1GB. [2022-02-21 04:35:14,901 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:35:14,901 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.06ms. Allocated memory is still 104.9MB. Free memory was 80.7MB in the beginning and 71.2MB in the end (delta: 9.5MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2022-02-21 04:35:14,901 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.83ms. Allocated memory is still 104.9MB. Free memory was 71.2MB in the beginning and 69.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:14,901 INFO L158 Benchmark]: Boogie Preprocessor took 45.01ms. Allocated memory is still 104.9MB. Free memory was 69.1MB in the beginning and 67.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:35:14,902 INFO L158 Benchmark]: RCFGBuilder took 482.82ms. Allocated memory is still 104.9MB. Free memory was 67.5MB in the beginning and 52.5MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-21 04:35:14,902 INFO L158 Benchmark]: BuchiAutomizer took 7604.82ms. Allocated memory was 104.9MB in the beginning and 186.6MB in the end (delta: 81.8MB). Free memory was 52.3MB in the beginning and 86.5MB in the end (delta: -34.2MB). Peak memory consumption was 84.7MB. Max. memory is 16.1GB. [2022-02-21 04:35:14,903 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.06ms. Allocated memory is still 104.9MB. Free memory was 80.7MB in the beginning and 71.2MB in the end (delta: 9.5MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.83ms. Allocated memory is still 104.9MB. Free memory was 71.2MB in the beginning and 69.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.01ms. Allocated memory is still 104.9MB. Free memory was 69.1MB in the beginning and 67.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 482.82ms. Allocated memory is still 104.9MB. Free memory was 67.5MB in the beginning and 52.5MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 7604.82ms. Allocated memory was 104.9MB in the beginning and 186.6MB in the end (delta: 81.8MB). Free memory was 52.3MB in the beginning and 86.5MB in the end (delta: -34.2MB). Peak memory consumption was 84.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_diff_~A#1.base) (+ ULTIMATE.start_diff_~A#1.offset (* ULTIMATE.start_diff_~i~0#1 4)))_1 was not added to the transformula! de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_diff_~A#1.base) (+ ULTIMATE.start_diff_~A#1.offset (* ULTIMATE.start_diff_~i~0#1 4)))_1 was not added to the transformula!: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 04:35:14,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_diff_~A#1.base) (+ ULTIMATE.start_diff_~A#1.offset (* ULTIMATE.start_diff_~i~0#1 4)))_1 was not added to the transformula!