./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/twisted-alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/twisted-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash e028c51cfa02b345902e1292d1a644c7ee4a15183825ee6e2ec2fc316df147e6 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:33:33,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:33:33,948 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:33:33,980 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:33:33,984 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:33:33,985 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:33:33,986 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:33:33,987 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:33:33,988 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:33:33,989 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:33:33,990 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:33:33,991 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:33:33,992 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:33:33,993 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:33:33,993 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:33:33,994 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:33:33,995 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:33:33,995 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:33:33,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:33:33,998 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:33:34,005 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:33:34,010 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:33:34,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:33:34,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:33:34,014 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:33:34,021 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:33:34,022 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:33:34,023 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:33:34,023 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:33:34,024 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:33:34,024 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:33:34,025 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:33:34,025 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:33:34,026 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:33:34,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:33:34,027 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:33:34,027 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:33:34,027 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:33:34,028 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:33:34,028 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:33:34,029 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:33:34,031 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:33:34,050 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:33:34,052 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:33:34,053 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:33:34,053 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:33:34,055 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:33:34,055 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:33:34,055 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:33:34,056 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:33:34,056 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:33:34,056 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:33:34,057 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:33:34,057 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:33:34,057 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:33:34,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:33:34,057 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:33:34,058 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:33:34,058 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:33:34,058 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:33:34,058 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:33:34,058 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:33:34,059 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:33:34,059 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:33:34,059 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:33:34,059 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:33:34,059 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:33:34,059 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:33:34,060 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:33:34,060 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:33:34,061 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:33:34,061 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e028c51cfa02b345902e1292d1a644c7ee4a15183825ee6e2ec2fc316df147e6 [2022-02-21 03:33:34,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:33:34,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:33:34,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:33:34,334 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:33:34,335 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:33:34,336 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/twisted-alloca.i [2022-02-21 03:33:34,380 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0af914109/6c0ec2df8d56469bb252437633396426/FLAGc51699783 [2022-02-21 03:33:34,718 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:33:34,719 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/twisted-alloca.i [2022-02-21 03:33:34,738 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0af914109/6c0ec2df8d56469bb252437633396426/FLAGc51699783 [2022-02-21 03:33:35,103 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0af914109/6c0ec2df8d56469bb252437633396426 [2022-02-21 03:33:35,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:33:35,107 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:33:35,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:33:35,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:33:35,126 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:33:35,127 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:33:35" (1/1) ... [2022-02-21 03:33:35,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3948726d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:35, skipping insertion in model container [2022-02-21 03:33:35,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:33:35" (1/1) ... [2022-02-21 03:33:35,134 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:33:35,174 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:33:35,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:33:35,418 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:33:35,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:33:35,465 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:33:35,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:35 WrapperNode [2022-02-21 03:33:35,465 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:33:35,466 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:33:35,466 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:33:35,466 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:33:35,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:35" (1/1) ... [2022-02-21 03:33:35,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:35" (1/1) ... [2022-02-21 03:33:35,514 INFO L137 Inliner]: procedures = 111, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2022-02-21 03:33:35,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:33:35,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:33:35,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:33:35,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:33:35,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:35" (1/1) ... [2022-02-21 03:33:35,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:35" (1/1) ... [2022-02-21 03:33:35,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:35" (1/1) ... [2022-02-21 03:33:35,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:35" (1/1) ... [2022-02-21 03:33:35,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:35" (1/1) ... [2022-02-21 03:33:35,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:35" (1/1) ... [2022-02-21 03:33:35,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:35" (1/1) ... [2022-02-21 03:33:35,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:33:35,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:33:35,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:33:35,569 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:33:35,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:35" (1/1) ... [2022-02-21 03:33:35,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:35,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:35,613 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 03:33:35,616 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 03:33:35,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:33:35,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:33:35,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:33:35,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:33:35,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:33:35,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:33:35,729 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:33:35,731 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:33:35,948 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:33:35,966 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:33:35,966 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:33:35,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:33:35 BoogieIcfgContainer [2022-02-21 03:33:35,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:33:35,969 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:33:35,969 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:33:35,971 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:33:35,972 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:33:35,972 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:33:35" (1/3) ... [2022-02-21 03:33:35,974 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28978a4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:33:35, skipping insertion in model container [2022-02-21 03:33:35,975 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:33:35,975 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:33:35" (2/3) ... [2022-02-21 03:33:35,976 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28978a4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:33:35, skipping insertion in model container [2022-02-21 03:33:35,976 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:33:35,976 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:33:35" (3/3) ... [2022-02-21 03:33:35,977 INFO L388 chiAutomizerObserver]: Analyzing ICFG twisted-alloca.i [2022-02-21 03:33:36,038 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:33:36,039 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:33:36,039 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:33:36,039 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:33:36,039 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:33:36,039 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:33:36,039 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:33:36,039 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:33:36,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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 03:33:36,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:33:36,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:36,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:36,091 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:33:36,091 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:33:36,091 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:33:36,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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 03:33:36,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:33:36,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:36,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:36,097 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:33:36,097 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:33:36,102 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; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;assume { :begin_inline_f } true;f_#in~k#1, f_#in~l#1 := main_#t~nondet17#1, main_#t~nondet18#1;havoc f_#res#1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~mem8#1, f_#t~post9#1, f_#t~mem10#1, f_#t~mem6#1, f_#t~mem7#1, f_#t~mem12#1, f_#t~post13#1, f_#t~mem14#1, f_#t~mem11#1, f_#t~mem15#1, f_#t~mem16#1, f_~k#1, f_~l#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, f_~i~0#1.base, f_~i~0#1.offset, f_~j~0#1.base, f_~j~0#1.offset;f_~k#1 := f_#in~k#1;f_~l#1 := f_#in~l#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~k_ref~0#1.base, f_~k_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~l_ref~0#1.base, f_~l_ref~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~i~0#1.base, f_~i~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~j~0#1.base, f_~j~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call write~int(f_~k#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);call write~int(f_~l#1, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, 4);call write~int(0, f_~i~0#1.base, f_~i~0#1.offset, 4);call write~int(0, f_~j~0#1.base, f_~j~0#1.offset, 4); 3#L569true [2022-02-21 03:33:36,103 INFO L793 eck$LassoCheckResult]: Loop: 3#L569true assume !true; 13#L564true goto; 12#L567true call f_#t~mem11#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4); 8#L564-1true assume !!(f_#t~mem11#1 < 1);havoc f_#t~mem11#1;call f_#t~mem12#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);f_#t~post13#1 := f_#t~mem12#1;call write~int(1 + f_#t~post13#1, f_~j~0#1.base, f_~j~0#1.offset, 4);havoc f_#t~mem12#1;havoc f_#t~post13#1;call f_#t~mem14#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 10#L566true assume !(0 != (if f_#t~mem14#1 < 0 && 0 != f_#t~mem14#1 % 2 then f_#t~mem14#1 % 2 - 2 else f_#t~mem14#1 % 2));havoc f_#t~mem14#1; 3#L569true [2022-02-21 03:33:36,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:36,108 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:33:36,115 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:36,115 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115895692] [2022-02-21 03:33:36,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:36,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:36,254 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:36,294 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:36,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:36,300 INFO L85 PathProgramCache]: Analyzing trace with hash 46885240, now seen corresponding path program 1 times [2022-02-21 03:33:36,300 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:36,301 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315736025] [2022-02-21 03:33:36,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:36,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:36,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-02-21 03:33:36,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#false} goto; {22#false} is VALID [2022-02-21 03:33:36,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#false} call f_#t~mem11#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4); {22#false} is VALID [2022-02-21 03:33:36,366 INFO L290 TraceCheckUtils]: 3: Hoare triple {22#false} assume !!(f_#t~mem11#1 < 1);havoc f_#t~mem11#1;call f_#t~mem12#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);f_#t~post13#1 := f_#t~mem12#1;call write~int(1 + f_#t~post13#1, f_~j~0#1.base, f_~j~0#1.offset, 4);havoc f_#t~mem12#1;havoc f_#t~post13#1;call f_#t~mem14#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); {22#false} is VALID [2022-02-21 03:33:36,366 INFO L290 TraceCheckUtils]: 4: Hoare triple {22#false} assume !(0 != (if f_#t~mem14#1 < 0 && 0 != f_#t~mem14#1 % 2 then f_#t~mem14#1 % 2 - 2 else f_#t~mem14#1 % 2));havoc f_#t~mem14#1; {22#false} is VALID [2022-02-21 03:33:36,367 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 03:33:36,367 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:33:36,368 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315736025] [2022-02-21 03:33:36,368 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315736025] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:33:36,368 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:33:36,368 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-02-21 03:33:36,369 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557354436] [2022-02-21 03:33:36,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:33:36,374 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:33:36,375 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:33:36,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:33:36,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:33:36,401 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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 2 states, 2 states have (on average 2.5) internal successors, (5), 1 states have internal predecessors, (5), 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 03:33:36,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:33:36,429 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2022-02-21 03:33:36,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:33:36,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.5) internal successors, (5), 1 states have internal predecessors, (5), 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 03:33:36,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:33:36,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2022-02-21 03:33:36,451 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:33:36,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 10 states and 13 transitions. [2022-02-21 03:33:36,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 03:33:36,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 03:33:36,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2022-02-21 03:33:36,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:33:36,456 INFO L681 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-02-21 03:33:36,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2022-02-21 03:33:36,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-02-21 03:33:36,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:33:36,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states and 13 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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 03:33:36,474 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states and 13 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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 03:33:36,475 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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 03:33:36,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:33:36,477 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2022-02-21 03:33:36,477 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2022-02-21 03:33:36,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:36,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:36,478 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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 10 states and 13 transitions. [2022-02-21 03:33:36,479 INFO L87 Difference]: Start difference. First operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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 10 states and 13 transitions. [2022-02-21 03:33:36,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:33:36,480 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2022-02-21 03:33:36,481 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2022-02-21 03:33:36,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:36,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:36,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:33:36,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:33:36,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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 03:33:36,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2022-02-21 03:33:36,492 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-02-21 03:33:36,493 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-02-21 03:33:36,493 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:33:36,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2022-02-21 03:33:36,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:33:36,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:36,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:36,497 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:33:36,497 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:33:36,497 INFO L791 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 41#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;assume { :begin_inline_f } true;f_#in~k#1, f_#in~l#1 := main_#t~nondet17#1, main_#t~nondet18#1;havoc f_#res#1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~mem8#1, f_#t~post9#1, f_#t~mem10#1, f_#t~mem6#1, f_#t~mem7#1, f_#t~mem12#1, f_#t~post13#1, f_#t~mem14#1, f_#t~mem11#1, f_#t~mem15#1, f_#t~mem16#1, f_~k#1, f_~l#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, f_~i~0#1.base, f_~i~0#1.offset, f_~j~0#1.base, f_~j~0#1.offset;f_~k#1 := f_#in~k#1;f_~l#1 := f_#in~l#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~k_ref~0#1.base, f_~k_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~l_ref~0#1.base, f_~l_ref~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~i~0#1.base, f_~i~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~j~0#1.base, f_~j~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call write~int(f_~k#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);call write~int(f_~l#1, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, 4);call write~int(0, f_~i~0#1.base, f_~i~0#1.offset, 4);call write~int(0, f_~j~0#1.base, f_~j~0#1.offset, 4); 38#L569 [2022-02-21 03:33:36,497 INFO L793 eck$LassoCheckResult]: Loop: 38#L569 goto; 39#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 44#L557-1 assume !(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1; 43#L564 goto; 45#L567 call f_#t~mem11#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4); 46#L564-1 assume !!(f_#t~mem11#1 < 1);havoc f_#t~mem11#1;call f_#t~mem12#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);f_#t~post13#1 := f_#t~mem12#1;call write~int(1 + f_#t~post13#1, f_~j~0#1.base, f_~j~0#1.offset, 4);havoc f_#t~mem12#1;havoc f_#t~post13#1;call f_#t~mem14#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 47#L566 assume !(0 != (if f_#t~mem14#1 < 0 && 0 != f_#t~mem14#1 % 2 then f_#t~mem14#1 % 2 - 2 else f_#t~mem14#1 % 2));havoc f_#t~mem14#1; 38#L569 [2022-02-21 03:33:36,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:36,498 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-02-21 03:33:36,498 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:36,498 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307510948] [2022-02-21 03:33:36,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:36,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:36,555 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:36,582 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:36,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:36,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1311753714, now seen corresponding path program 1 times [2022-02-21 03:33:36,587 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:36,587 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94805088] [2022-02-21 03:33:36,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:36,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:36,626 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:36,653 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:36,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:36,654 INFO L85 PathProgramCache]: Analyzing trace with hash 234543116, now seen corresponding path program 1 times [2022-02-21 03:33:36,654 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:36,654 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342581404] [2022-02-21 03:33:36,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:36,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:36,756 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:36,792 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:38,798 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:33:38,799 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:33:38,799 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:33:38,799 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:33:38,799 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:33:38,799 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:38,799 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:33:38,800 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:33:38,800 INFO L133 ssoRankerPreferences]: Filename of dumped script: twisted-alloca.i_Iteration2_Lasso [2022-02-21 03:33:38,800 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:33:38,800 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:33:38,831 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 03:33:38,836 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 03:33:38,838 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 03:33:38,841 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 03:33:38,844 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 03:33:38,847 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 03:33:38,849 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 03:33:38,860 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 03:33:39,813 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 03:33:39,816 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 03:33:39,818 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 03:33:39,820 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 03:33:39,823 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 03:33:39,825 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 03:33:39,827 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 03:33:39,829 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 03:33:39,831 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 03:33:39,833 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 03:33:39,834 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 03:33:39,836 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 03:33:39,838 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 03:33:39,840 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 03:33:39,842 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 03:33:40,490 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:33:40,493 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:33:40,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:40,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:40,496 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 03:33:40,497 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 03:33:40,500 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 03:33:40,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:40,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:40,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:40,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:40,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:40,509 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:40,509 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:40,526 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:40,557 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 03:33:40,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:40,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:40,559 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 03:33:40,562 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 03:33:40,562 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 03:33:40,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:40,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:40,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:40,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:40,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:40,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:40,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:40,570 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:40,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-02-21 03:33:40,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:40,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:40,598 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 03:33:40,599 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 03:33:40,600 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 03:33:40,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:40,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:40,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:40,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:40,610 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:40,610 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:40,625 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:40,649 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 03:33:40,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:40,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:40,651 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 03:33:40,652 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 03:33:40,653 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 03:33:40,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:40,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:40,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:40,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:40,663 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:40,663 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:40,691 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:40,715 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 03:33:40,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:40,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:40,720 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 03:33:40,725 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 03:33:40,726 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 03:33:40,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:40,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:40,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:40,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:40,739 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:40,739 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:40,753 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:40,769 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 03:33:40,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:40,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:40,772 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 03:33:40,773 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 03:33:40,774 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 03:33:40,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:40,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:40,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:40,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:40,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:40,780 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:40,780 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:40,790 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:40,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-02-21 03:33:40,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:40,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:40,807 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 03:33:40,808 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 03:33:40,810 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 03:33:40,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:40,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:40,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:40,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:40,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:40,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:40,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:40,819 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:40,843 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 03:33:40,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:40,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:40,845 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 03:33:40,846 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 03:33:40,848 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 03:33:40,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:40,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:40,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:40,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:40,878 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:40,878 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:40,891 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:40,930 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 03:33:40,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:40,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:40,945 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 03:33:40,946 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 03:33:40,946 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 03:33:40,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:40,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:40,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:40,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:40,959 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:40,959 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:40,969 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:40,986 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 03:33:40,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:40,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:40,988 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 03:33:40,994 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 03:33:41,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:41,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:41,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:41,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:41,012 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:41,012 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:41,023 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 03:33:41,034 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:41,059 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 03:33:41,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:41,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:41,061 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 03:33:41,077 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 03:33:41,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:41,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:41,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:41,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:41,109 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:41,109 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:41,120 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 03:33:41,131 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:41,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:41,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:41,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:41,155 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 03:33:41,156 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 03:33:41,212 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 03:33:41,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:41,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:41,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:41,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:41,224 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:41,224 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:41,230 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:41,247 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 03:33:41,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:41,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:41,248 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 03:33:41,249 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 03:33:41,251 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 03:33:41,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:41,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:41,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:41,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:41,286 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:41,286 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:41,290 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:41,309 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 03:33:41,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:41,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:41,310 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 03:33:41,311 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 03:33:41,313 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 03:33:41,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:41,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:41,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:41,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:41,320 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:41,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:41,335 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:41,372 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 03:33:41,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:41,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:41,374 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 03:33:41,375 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 03:33:41,376 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 03:33:41,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:41,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:41,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:41,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:41,385 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:41,385 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:41,396 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:41,416 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 03:33:41,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:41,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:41,418 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 03:33:41,418 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 03:33:41,421 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 03:33:41,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:41,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:41,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:41,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:41,429 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:41,429 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:41,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:41,477 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 03:33:41,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:41,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:41,478 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 03:33:41,483 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 03:33:41,484 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 03:33:41,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:41,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:41,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:41,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:41,493 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:41,493 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:41,512 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:33:41,560 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-02-21 03:33:41,560 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2022-02-21 03:33:41,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:41,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:41,571 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 03:33:41,607 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 03:33:41,608 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:33:41,628 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:33:41,628 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:33:41,629 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~j~0#1.base) ULTIMATE.start_f_~j~0#1.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_f_~j~0#1.base) ULTIMATE.start_f_~j~0#1.offset)_1 + 1 Supporting invariants [] [2022-02-21 03:33:41,675 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 03:33:41,961 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2022-02-21 03:33:41,968 INFO L390 LassoCheck]: Loop: "goto;" "call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);" "assume !(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;" "goto;" "call f_#t~mem11#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);" "assume !!(f_#t~mem11#1 < 1);havoc f_#t~mem11#1;call f_#t~mem12#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);f_#t~post13#1 := f_#t~mem12#1;call write~int(1 + f_#t~post13#1, f_~j~0#1.base, f_~j~0#1.offset, 4);havoc f_#t~mem12#1;havoc f_#t~post13#1;call f_#t~mem14#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);" "assume !(0 != (if f_#t~mem14#1 < 0 && 0 != f_#t~mem14#1 % 2 then f_#t~mem14#1 % 2 - 2 else f_#t~mem14#1 % 2));havoc f_#t~mem14#1;" [2022-02-21 03:33:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:42,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:42,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:33:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:42,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:42,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {77#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {77#unseeded} is VALID [2022-02-21 03:33:42,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {77#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;assume { :begin_inline_f } true;f_#in~k#1, f_#in~l#1 := main_#t~nondet17#1, main_#t~nondet18#1;havoc f_#res#1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~mem8#1, f_#t~post9#1, f_#t~mem10#1, f_#t~mem6#1, f_#t~mem7#1, f_#t~mem12#1, f_#t~post13#1, f_#t~mem14#1, f_#t~mem11#1, f_#t~mem15#1, f_#t~mem16#1, f_~k#1, f_~l#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, f_~i~0#1.base, f_~i~0#1.offset, f_~j~0#1.base, f_~j~0#1.offset;f_~k#1 := f_#in~k#1;f_~l#1 := f_#in~l#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~k_ref~0#1.base, f_~k_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~l_ref~0#1.base, f_~l_ref~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~i~0#1.base, f_~i~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~j~0#1.base, f_~j~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call write~int(f_~k#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);call write~int(f_~l#1, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, 4);call write~int(0, f_~i~0#1.base, f_~i~0#1.offset, 4);call write~int(0, f_~j~0#1.base, f_~j~0#1.offset, 4); {77#unseeded} is VALID [2022-02-21 03:33:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:42,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:33:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:42,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:42,127 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 03:33:42,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-02-21 03:33:42,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {80#(>= oldRank0 (+ (* (- 2) (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|)) 1))} goto; {80#(>= oldRank0 (+ (* (- 2) (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|)) 1))} is VALID [2022-02-21 03:33:42,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {80#(>= oldRank0 (+ (* (- 2) (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|)) 1))} call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); {80#(>= oldRank0 (+ (* (- 2) (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|)) 1))} is VALID [2022-02-21 03:33:42,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {80#(>= oldRank0 (+ (* (- 2) (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|)) 1))} assume !(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1; {80#(>= oldRank0 (+ (* (- 2) (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|)) 1))} is VALID [2022-02-21 03:33:42,321 INFO L290 TraceCheckUtils]: 3: Hoare triple {80#(>= oldRank0 (+ (* (- 2) (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|)) 1))} goto; {80#(>= oldRank0 (+ (* (- 2) (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|)) 1))} is VALID [2022-02-21 03:33:42,321 INFO L290 TraceCheckUtils]: 4: Hoare triple {80#(>= oldRank0 (+ (* (- 2) (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|)) 1))} call f_#t~mem11#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4); {315#(and (>= oldRank0 (+ (* (- 2) (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|)) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|) |ULTIMATE.start_f_#t~mem11#1|))} is VALID [2022-02-21 03:33:42,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {315#(and (>= oldRank0 (+ (* (- 2) (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|)) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|) |ULTIMATE.start_f_#t~mem11#1|))} assume !!(f_#t~mem11#1 < 1);havoc f_#t~mem11#1;call f_#t~mem12#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);f_#t~post13#1 := f_#t~mem12#1;call write~int(1 + f_#t~post13#1, f_~j~0#1.base, f_~j~0#1.offset, 4);havoc f_#t~mem12#1;havoc f_#t~post13#1;call f_#t~mem14#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); {319#(and (<= (+ (div (+ (- 1) oldRank0) (- 2)) 1) (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|)) (< (div (+ (- 1) oldRank0) (- 2)) 1))} is VALID [2022-02-21 03:33:42,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {319#(and (<= (+ (div (+ (- 1) oldRank0) (- 2)) 1) (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|)) (< (div (+ (- 1) oldRank0) (- 2)) 1))} assume !(0 != (if f_#t~mem14#1 < 0 && 0 != f_#t~mem14#1 % 2 then f_#t~mem14#1 % 2 - 2 else f_#t~mem14#1 % 2));havoc f_#t~mem14#1; {295#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|)) 1))))} is VALID [2022-02-21 03:33:42,324 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 03:33:42,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 03:33:42,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:33:42,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 7 letters. [2022-02-21 03:33:42,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,337 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:33:42,338 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 03:33:42,408 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 20 states and 27 transitions. Complement of second has 6 states. [2022-02-21 03:33:42,409 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 03:33:42,409 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:33:42,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. cyclomatic complexity: 4 [2022-02-21 03:33:42,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:42,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:42,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 03:33:42,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:42,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:42,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:42,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2022-02-21 03:33:42,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:42,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:42,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:42,419 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 13 transitions. cyclomatic complexity: 4 [2022-02-21 03:33:42,420 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:33:42,421 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 03:33:42,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:42,423 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:33:42,423 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 27 transitions. cyclomatic complexity: 9 [2022-02-21 03:33:42,425 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:33:42,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 7 letters. [2022-02-21 03:33:42,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 7 letters. [2022-02-21 03:33:42,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 7 letters. [2022-02-21 03:33:42,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:33:42,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 3 letters. [2022-02-21 03:33:42,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:33:42,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:33:42,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 3 letters. [2022-02-21 03:33:42,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:33:42,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:33:42,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 03:33:42,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:33:42,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:33:42,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 10 letters. [2022-02-21 03:33:42,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:33:42,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:33:42,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 03:33:42,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:33:42,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 7 letters. [2022-02-21 03:33:42,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 7 letters. [2022-02-21 03:33:42,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 7 letters. [2022-02-21 03:33:42,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:33:42,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 3 letters. Loop has 3 letters. [2022-02-21 03:33:42,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:33:42,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:33:42,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 3 letters. [2022-02-21 03:33:42,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:33:42,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 7 letters. [2022-02-21 03:33:42,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 7 letters. [2022-02-21 03:33:42,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 7 letters. [2022-02-21 03:33:42,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:33:42,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 3 letters. [2022-02-21 03:33:42,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:33:42,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:33:42,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 3 letters. [2022-02-21 03:33:42,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:33:42,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:33:42,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 3 letters. [2022-02-21 03:33:42,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:33:42,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:33:42,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 3 letters. [2022-02-21 03:33:42,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:33:42,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:33:42,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 3 letters. [2022-02-21 03:33:42,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:33:42,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:33:42,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 3 letters. [2022-02-21 03:33:42,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:33:42,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:33:42,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 3 letters. [2022-02-21 03:33:42,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:33:42,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:33:42,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 3 letters. [2022-02-21 03:33:42,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:33:42,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,451 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:33:42,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 03:33:42,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2022-02-21 03:33:42,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 2 letters. Loop has 7 letters. [2022-02-21 03:33:42,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 7 letters. [2022-02-21 03:33:42,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 2 letters. Loop has 14 letters. [2022-02-21 03:33:42,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:42,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. cyclomatic complexity: 9 [2022-02-21 03:33:42,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:42,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 21 transitions. [2022-02-21 03:33:42,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-02-21 03:33:42,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 03:33:42,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2022-02-21 03:33:42,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:33:42,458 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2022-02-21 03:33:42,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2022-02-21 03:33:42,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-02-21 03:33:42,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:33:42,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 21 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 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 03:33:42,462 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 21 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 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 03:33:42,463 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 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 03:33:42,463 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:33:42,466 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2022-02-21 03:33:42,466 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2022-02-21 03:33:42,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:42,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:42,467 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 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 16 states and 21 transitions. [2022-02-21 03:33:42,467 INFO L87 Difference]: Start difference. First operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 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 16 states and 21 transitions. [2022-02-21 03:33:42,468 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:33:42,469 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2022-02-21 03:33:42,469 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2022-02-21 03:33:42,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:42,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:42,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:33:42,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:33:42,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 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 03:33:42,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2022-02-21 03:33:42,471 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2022-02-21 03:33:42,471 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2022-02-21 03:33:42,471 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:33:42,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2022-02-21 03:33:42,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:42,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:42,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:42,472 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:33:42,472 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:33:42,472 INFO L791 eck$LassoCheckResult]: Stem: 356#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 357#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;assume { :begin_inline_f } true;f_#in~k#1, f_#in~l#1 := main_#t~nondet17#1, main_#t~nondet18#1;havoc f_#res#1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~mem8#1, f_#t~post9#1, f_#t~mem10#1, f_#t~mem6#1, f_#t~mem7#1, f_#t~mem12#1, f_#t~post13#1, f_#t~mem14#1, f_#t~mem11#1, f_#t~mem15#1, f_#t~mem16#1, f_~k#1, f_~l#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, f_~i~0#1.base, f_~i~0#1.offset, f_~j~0#1.base, f_~j~0#1.offset;f_~k#1 := f_#in~k#1;f_~l#1 := f_#in~l#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~k_ref~0#1.base, f_~k_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~l_ref~0#1.base, f_~l_ref~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~i~0#1.base, f_~i~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~j~0#1.base, f_~j~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call write~int(f_~k#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);call write~int(f_~l#1, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, 4);call write~int(0, f_~i~0#1.base, f_~i~0#1.offset, 4);call write~int(0, f_~j~0#1.base, f_~j~0#1.offset, 4); 366#L569 goto; 353#L560 [2022-02-21 03:33:42,473 INFO L793 eck$LassoCheckResult]: Loop: 353#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 361#L557-1 assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 358#L559 assume 0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2);havoc f_#t~mem10#1; 353#L560 [2022-02-21 03:33:42,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:42,474 INFO L85 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2022-02-21 03:33:42,474 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:42,474 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726699790] [2022-02-21 03:33:42,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:42,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:42,523 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:42,564 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:42,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:42,564 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2022-02-21 03:33:42,565 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:42,565 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499979471] [2022-02-21 03:33:42,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:42,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:42,578 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:42,585 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:42,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:42,589 INFO L85 PathProgramCache]: Analyzing trace with hash 889536583, now seen corresponding path program 1 times [2022-02-21 03:33:42,590 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:42,590 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445640490] [2022-02-21 03:33:42,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:42,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:42,629 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:42,644 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:44,630 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:33:44,630 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:33:44,630 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:33:44,630 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:33:44,630 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:33:44,630 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:44,630 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:33:44,630 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:33:44,630 INFO L133 ssoRankerPreferences]: Filename of dumped script: twisted-alloca.i_Iteration3_Lasso [2022-02-21 03:33:44,631 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:33:44,631 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:33:44,632 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 03:33:44,636 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 03:33:44,638 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 03:33:44,639 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 03:33:44,641 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 03:33:44,642 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 03:33:44,691 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 03:33:46,579 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 03:33:46,582 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 03:33:46,583 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 03:33:46,585 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 03:33:46,587 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 03:33:46,589 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 03:33:46,591 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 03:33:46,592 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 03:33:46,594 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 03:33:46,596 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 03:33:46,598 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 03:33:46,599 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 03:33:46,601 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 03:33:46,603 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 03:33:47,188 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:33:47,188 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:33:47,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:47,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:47,192 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 03:33:47,199 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 03:33:47,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:47,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:47,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:47,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:47,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:47,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:47,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:47,209 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 03:33:47,215 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:47,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:47,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:47,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:47,233 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 03:33:47,236 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 03:33:47,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:47,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:47,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:47,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:47,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:47,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:47,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:47,251 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 03:33:47,259 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:47,277 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 03:33:47,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:47,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:47,278 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 03:33:47,280 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 03:33:47,281 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 03:33:47,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:47,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:47,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:47,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:47,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:47,288 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:47,303 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:47,320 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 03:33:47,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:47,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:47,322 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 03:33:47,324 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 03:33:47,325 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 03:33:47,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:47,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:47,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:47,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:47,332 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:47,332 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:47,355 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:47,372 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 03:33:47,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:47,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:47,374 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 03:33:47,375 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 03:33:47,376 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 03:33:47,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:47,382 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:47,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:47,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:47,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:47,382 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:47,382 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:47,397 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:47,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:47,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:47,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:47,425 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 03:33:47,426 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 03:33:47,449 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 03:33:47,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:47,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:47,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:47,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:47,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:47,455 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:47,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:47,463 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:47,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:47,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:47,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:47,486 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 03:33:47,487 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 03:33:47,488 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 03:33:47,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:47,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:47,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:47,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:47,496 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:47,496 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:47,512 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:47,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:47,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:47,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:47,532 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 03:33:47,541 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 03:33:47,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:47,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:47,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:47,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:47,555 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 03:33:47,561 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:47,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:47,590 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:47,607 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 03:33:47,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:47,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:47,609 INFO L229 MonitoredProcess]: Starting monitored process 28 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 03:33:47,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 03:33:47,613 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 03:33:47,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:47,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:47,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:47,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:47,619 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:47,619 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:47,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:47,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:47,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:47,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:47,656 INFO L229 MonitoredProcess]: Starting monitored process 29 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 03:33:47,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 03:33:47,668 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 03:33:47,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:47,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:47,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:47,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:47,684 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:47,684 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:47,697 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:47,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:47,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:47,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:47,718 INFO L229 MonitoredProcess]: Starting monitored process 30 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 03:33:47,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 03:33:47,721 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 03:33:47,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:47,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:47,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:47,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:47,736 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:47,736 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:47,751 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:47,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:47,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:47,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:47,770 INFO L229 MonitoredProcess]: Starting monitored process 31 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 03:33:47,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 03:33:47,772 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 03:33:47,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:47,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:47,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:47,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:47,779 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:47,779 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:47,795 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:47,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:47,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:47,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:47,814 INFO L229 MonitoredProcess]: Starting monitored process 32 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 03:33:47,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 03:33:47,816 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 03:33:47,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:47,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:47,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:47,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:47,825 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:47,825 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:47,841 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:47,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:47,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:47,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:47,860 INFO L229 MonitoredProcess]: Starting monitored process 33 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 03:33:47,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 03:33:47,862 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 03:33:47,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:47,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:47,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:47,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:47,872 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:47,872 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:47,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:47,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:47,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:47,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:47,924 INFO L229 MonitoredProcess]: Starting monitored process 34 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 03:33:47,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-02-21 03:33:47,926 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 03:33:47,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:47,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:47,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:47,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:47,950 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:47,951 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:47,968 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:33:48,004 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-02-21 03:33:48,005 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-02-21 03:33:48,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:48,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:48,007 INFO L229 MonitoredProcess]: Starting monitored process 35 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 03:33:48,012 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:33:48,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-02-21 03:33:48,030 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-02-21 03:33:48,030 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:33:48,031 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~i~0#1.base) ULTIMATE.start_f_~i~0#1.offset)_2, ULTIMATE.start_f_~k#1) = -1*v_rep(select (select #memory_int ULTIMATE.start_f_~i~0#1.base) ULTIMATE.start_f_~i~0#1.offset)_2 + 1*ULTIMATE.start_f_~k#1 Supporting invariants [1*ULTIMATE.start_f_~k#1 - 1*v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0#1.base) ULTIMATE.start_f_~k_ref~0#1.offset)_2 >= 0] [2022-02-21 03:33:48,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:48,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:48,362 INFO L297 tatePredicateManager]: 36 out of 37 supporting invariants were superfluous and have been removed [2022-02-21 03:33:48,370 INFO L390 LassoCheck]: Loop: "call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);" "assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);" "assume 0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2);havoc f_#t~mem10#1;" [2022-02-21 03:33:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:48,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:48,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 41 conjunts are in the unsatisfiable core [2022-02-21 03:33:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:48,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:48,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-02-21 03:33:48,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:33:48,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:33:48,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:33:48,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:33:48,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:33:48,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:33:48,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2022-02-21 03:33:48,704 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-02-21 03:33:48,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 46 [2022-02-21 03:33:48,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {442#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {442#unseeded} is VALID [2022-02-21 03:33:48,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {442#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;assume { :begin_inline_f } true;f_#in~k#1, f_#in~l#1 := main_#t~nondet17#1, main_#t~nondet18#1;havoc f_#res#1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~mem8#1, f_#t~post9#1, f_#t~mem10#1, f_#t~mem6#1, f_#t~mem7#1, f_#t~mem12#1, f_#t~post13#1, f_#t~mem14#1, f_#t~mem11#1, f_#t~mem15#1, f_#t~mem16#1, f_~k#1, f_~l#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, f_~i~0#1.base, f_~i~0#1.offset, f_~j~0#1.base, f_~j~0#1.offset;f_~k#1 := f_#in~k#1;f_~l#1 := f_#in~l#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~k_ref~0#1.base, f_~k_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~l_ref~0#1.base, f_~l_ref~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~i~0#1.base, f_~i~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~j~0#1.base, f_~j~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call write~int(f_~k#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);call write~int(f_~l#1, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, 4);call write~int(0, f_~i~0#1.base, f_~i~0#1.offset, 4);call write~int(0, f_~j~0#1.base, f_~j~0#1.offset, 4); {653#(and unseeded (= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) |ULTIMATE.start_f_~k#1|))} is VALID [2022-02-21 03:33:48,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {653#(and unseeded (= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) |ULTIMATE.start_f_~k#1|))} goto; {641#(and (>= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|)) |ULTIMATE.start_f_~k#1|) 0) unseeded)} is VALID [2022-02-21 03:33:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:48,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 03:33:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:48,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:49,061 INFO L356 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-02-21 03:33:49,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 40 [2022-02-21 03:33:49,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {642#(and (>= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|)) |ULTIMATE.start_f_~k#1|) 0) (>= oldRank0 (+ |ULTIMATE.start_f_~k#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|)))))} call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); {657#(and (<= |ULTIMATE.start_f_#t~mem7#1| (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|)) (>= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|)) |ULTIMATE.start_f_~k#1|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) |ULTIMATE.start_f_#t~mem6#1|) (>= oldRank0 (+ (* (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) (- 1)) |ULTIMATE.start_f_~k#1|)))} is VALID [2022-02-21 03:33:49,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {657#(and (<= |ULTIMATE.start_f_#t~mem7#1| (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|)) (>= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|)) |ULTIMATE.start_f_~k#1|) 0) (<= (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) |ULTIMATE.start_f_#t~mem6#1|) (>= oldRank0 (+ (* (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) (- 1)) |ULTIMATE.start_f_~k#1|)))} assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); {661#(and (or (not (= |ULTIMATE.start_f_~k_ref~0#1.offset| |ULTIMATE.start_f_~i~0#1.offset|)) (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~i~0#1.base|))) (<= (+ |ULTIMATE.start_f_~k#1| 1) (+ (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) oldRank0)) (< |ULTIMATE.start_f_~k#1| (+ oldRank0 (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) |ULTIMATE.start_f_~k#1|))} is VALID [2022-02-21 03:33:49,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {661#(and (or (not (= |ULTIMATE.start_f_~k_ref~0#1.offset| |ULTIMATE.start_f_~i~0#1.offset|)) (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~i~0#1.base|))) (<= (+ |ULTIMATE.start_f_~k#1| 1) (+ (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) oldRank0)) (< |ULTIMATE.start_f_~k#1| (+ oldRank0 (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) |ULTIMATE.start_f_~k#1|))} assume 0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2);havoc f_#t~mem10#1; {644#(and (>= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|)) |ULTIMATE.start_f_~k#1|) 0) (or (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_f_~k#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|))))) unseeded))} is VALID [2022-02-21 03:33:49,145 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 03:33:49,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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 03:33:49,155 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 03:33:49,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:33:49,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,156 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-02-21 03:33:49,156 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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 03:33:49,229 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 7. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Result 34 states and 43 transitions. Complement of second has 8 states. [2022-02-21 03:33:49,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:33:49,229 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:33:49,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. cyclomatic complexity: 7 [2022-02-21 03:33:49,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:49,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:49,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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 03:33:49,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:49,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:49,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:49,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2022-02-21 03:33:49,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:49,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:49,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:49,231 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 20 transitions. cyclomatic complexity: 7 [2022-02-21 03:33:49,231 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:33:49,231 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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 03:33:49,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:49,232 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:33:49,232 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 34 states and 43 transitions. cyclomatic complexity: 13 [2022-02-21 03:33:49,232 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:33:49,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:33:49,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:33:49,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 43 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:33:49,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:33:49,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:33:49,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 43 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:33:49,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:33:49,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:33:49,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 43 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:33:49,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 7 Stem has 34 letters. Loop has 34 letters. [2022-02-21 03:33:49,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 34 letters. Loop has 34 letters. [2022-02-21 03:33:49,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 43 transitions. cyclomatic complexity: 13 Stem has 34 letters. Loop has 34 letters. [2022-02-21 03:33:49,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:33:49,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:33:49,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 43 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:33:49,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:33:49,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:33:49,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 43 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:33:49,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:33:49,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:33:49,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 43 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:33:49,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:33:49,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:33:49,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 43 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:33:49,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:33:49,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:33:49,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 43 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:33:49,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:33:49,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:33:49,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 43 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:33:49,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:33:49,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:33:49,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 43 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:33:49,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 7 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:33:49,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:33:49,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 43 transitions. cyclomatic complexity: 13 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:33:49,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:33:49,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:33:49,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 43 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:33:49,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,238 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:33:49,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 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 03:33:49,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2022-02-21 03:33:49,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:33:49,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:33:49,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:33:49,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:49,239 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 43 transitions. cyclomatic complexity: 13 [2022-02-21 03:33:49,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:49,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 24 states and 31 transitions. [2022-02-21 03:33:49,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 03:33:49,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-02-21 03:33:49,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2022-02-21 03:33:49,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:33:49,241 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-02-21 03:33:49,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2022-02-21 03:33:49,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2022-02-21 03:33:49,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:33:49,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states and 31 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 03:33:49,242 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states and 31 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 03:33:49,243 INFO L87 Difference]: Start difference. First operand 24 states and 31 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 03:33:49,243 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:33:49,244 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2022-02-21 03:33:49,244 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2022-02-21 03:33:49,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:49,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:49,244 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 24 states and 31 transitions. [2022-02-21 03:33:49,244 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 24 states and 31 transitions. [2022-02-21 03:33:49,244 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:33:49,245 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2022-02-21 03:33:49,245 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2022-02-21 03:33:49,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:49,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:49,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:33:49,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:33:49,246 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 03:33:49,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2022-02-21 03:33:49,246 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2022-02-21 03:33:49,246 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2022-02-21 03:33:49,246 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:33:49,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2022-02-21 03:33:49,247 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:49,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:49,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:49,247 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:33:49,247 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:33:49,247 INFO L791 eck$LassoCheckResult]: Stem: 716#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 717#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;assume { :begin_inline_f } true;f_#in~k#1, f_#in~l#1 := main_#t~nondet17#1, main_#t~nondet18#1;havoc f_#res#1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~mem8#1, f_#t~post9#1, f_#t~mem10#1, f_#t~mem6#1, f_#t~mem7#1, f_#t~mem12#1, f_#t~post13#1, f_#t~mem14#1, f_#t~mem11#1, f_#t~mem15#1, f_#t~mem16#1, f_~k#1, f_~l#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, f_~i~0#1.base, f_~i~0#1.offset, f_~j~0#1.base, f_~j~0#1.offset;f_~k#1 := f_#in~k#1;f_~l#1 := f_#in~l#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~k_ref~0#1.base, f_~k_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~l_ref~0#1.base, f_~l_ref~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~i~0#1.base, f_~i~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~j~0#1.base, f_~j~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call write~int(f_~k#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);call write~int(f_~l#1, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, 4);call write~int(0, f_~i~0#1.base, f_~i~0#1.offset, 4);call write~int(0, f_~j~0#1.base, f_~j~0#1.offset, 4); 712#L569 goto; 713#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 729#L557-1 assume !(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1; 721#L564 goto; 728#L567 call f_#t~mem11#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4); 724#L564-1 assume !!(f_#t~mem11#1 < 1);havoc f_#t~mem11#1;call f_#t~mem12#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);f_#t~post13#1 := f_#t~mem12#1;call write~int(1 + f_#t~post13#1, f_~j~0#1.base, f_~j~0#1.offset, 4);havoc f_#t~mem12#1;havoc f_#t~post13#1;call f_#t~mem14#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 725#L566 assume !(0 != (if f_#t~mem14#1 < 0 && 0 != f_#t~mem14#1 % 2 then f_#t~mem14#1 % 2 - 2 else f_#t~mem14#1 % 2));havoc f_#t~mem14#1; 730#L569 goto; 719#L560 [2022-02-21 03:33:49,247 INFO L793 eck$LassoCheckResult]: Loop: 719#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 726#L557-1 assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 718#L559 assume 0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2);havoc f_#t~mem10#1; 719#L560 [2022-02-21 03:33:49,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:49,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1319097990, now seen corresponding path program 2 times [2022-02-21 03:33:49,248 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:49,248 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87722758] [2022-02-21 03:33:49,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:49,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:49,288 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:49,315 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:49,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:49,316 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 2 times [2022-02-21 03:33:49,316 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:49,316 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570793760] [2022-02-21 03:33:49,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:49,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:49,343 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:49,350 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:49,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:49,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1702545424, now seen corresponding path program 1 times [2022-02-21 03:33:49,351 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:49,351 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613399407] [2022-02-21 03:33:49,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:49,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:49,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {833#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {833#true} is VALID [2022-02-21 03:33:49,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {833#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;assume { :begin_inline_f } true;f_#in~k#1, f_#in~l#1 := main_#t~nondet17#1, main_#t~nondet18#1;havoc f_#res#1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~mem8#1, f_#t~post9#1, f_#t~mem10#1, f_#t~mem6#1, f_#t~mem7#1, f_#t~mem12#1, f_#t~post13#1, f_#t~mem14#1, f_#t~mem11#1, f_#t~mem15#1, f_#t~mem16#1, f_~k#1, f_~l#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, f_~i~0#1.base, f_~i~0#1.offset, f_~j~0#1.base, f_~j~0#1.offset;f_~k#1 := f_#in~k#1;f_~l#1 := f_#in~l#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~k_ref~0#1.base, f_~k_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~l_ref~0#1.base, f_~l_ref~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~i~0#1.base, f_~i~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~j~0#1.base, f_~j~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call write~int(f_~k#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);call write~int(f_~l#1, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, 4);call write~int(0, f_~i~0#1.base, f_~i~0#1.offset, 4);call write~int(0, f_~j~0#1.base, f_~j~0#1.offset, 4); {835#(and (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~j~0#1.base|)) (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) 0))} is VALID [2022-02-21 03:33:49,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {835#(and (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~j~0#1.base|)) (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) 0))} goto; {835#(and (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~j~0#1.base|)) (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) 0))} is VALID [2022-02-21 03:33:49,484 INFO L290 TraceCheckUtils]: 3: Hoare triple {835#(and (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~j~0#1.base|)) (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) 0))} call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); {836#(and (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~j~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) |ULTIMATE.start_f_#t~mem7#1|) (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= |ULTIMATE.start_f_#t~mem6#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) 0))} is VALID [2022-02-21 03:33:49,485 INFO L290 TraceCheckUtils]: 4: Hoare triple {836#(and (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~j~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) |ULTIMATE.start_f_#t~mem7#1|) (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= |ULTIMATE.start_f_#t~mem6#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) 0))} assume !(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1; {837#(and (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~j~0#1.base|)) (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) 0) (= (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) 0))} is VALID [2022-02-21 03:33:49,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {837#(and (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~j~0#1.base|)) (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) 0) (= (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) 0))} goto; {837#(and (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~j~0#1.base|)) (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) 0) (= (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) 0))} is VALID [2022-02-21 03:33:49,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {837#(and (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~j~0#1.base|)) (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) 0) (= (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) 0))} call f_#t~mem11#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4); {837#(and (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~j~0#1.base|)) (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) 0) (= (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) 0))} is VALID [2022-02-21 03:33:49,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {837#(and (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~j~0#1.base|)) (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) 0) (= (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) 0))} assume !!(f_#t~mem11#1 < 1);havoc f_#t~mem11#1;call f_#t~mem12#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);f_#t~post13#1 := f_#t~mem12#1;call write~int(1 + f_#t~post13#1, f_~j~0#1.base, f_~j~0#1.offset, 4);havoc f_#t~mem12#1;havoc f_#t~post13#1;call f_#t~mem14#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); {838#(and (<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) 0) (= (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) 0))} is VALID [2022-02-21 03:33:49,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {838#(and (<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) 0) (= (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) 0))} assume !(0 != (if f_#t~mem14#1 < 0 && 0 != f_#t~mem14#1 % 2 then f_#t~mem14#1 % 2 - 2 else f_#t~mem14#1 % 2));havoc f_#t~mem14#1; {838#(and (<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) 0) (= (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) 0))} is VALID [2022-02-21 03:33:49,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {838#(and (<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) 0) (= (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) 0))} goto; {838#(and (<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) 0) (= (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) 0))} is VALID [2022-02-21 03:33:49,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {838#(and (<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) 0) (= (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) 0))} call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); {839#(and (<= |ULTIMATE.start_f_#t~mem7#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) 0) (= (+ (* (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) (- 1)) |ULTIMATE.start_f_#t~mem6#1|) 0))} is VALID [2022-02-21 03:33:49,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {839#(and (<= |ULTIMATE.start_f_#t~mem7#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) 0) (= (+ (* (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) (- 1)) |ULTIMATE.start_f_#t~mem6#1|) 0))} assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); {834#false} is VALID [2022-02-21 03:33:49,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {834#false} assume 0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2);havoc f_#t~mem10#1; {834#false} is VALID [2022-02-21 03:33:49,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:33:49,490 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:33:49,490 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613399407] [2022-02-21 03:33:49,491 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613399407] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:33:49,491 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992876203] [2022-02-21 03:33:49,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:49,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:33:49,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:49,492 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:33:49,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-02-21 03:33:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:49,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-21 03:33:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:49,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:49,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-02-21 03:33:49,784 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-21 03:33:49,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 23 [2022-02-21 03:33:49,949 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 03:33:49,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2022-02-21 03:33:50,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {833#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {833#true} is VALID [2022-02-21 03:33:50,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {833#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;assume { :begin_inline_f } true;f_#in~k#1, f_#in~l#1 := main_#t~nondet17#1, main_#t~nondet18#1;havoc f_#res#1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~mem8#1, f_#t~post9#1, f_#t~mem10#1, f_#t~mem6#1, f_#t~mem7#1, f_#t~mem12#1, f_#t~post13#1, f_#t~mem14#1, f_#t~mem11#1, f_#t~mem15#1, f_#t~mem16#1, f_~k#1, f_~l#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, f_~i~0#1.base, f_~i~0#1.offset, f_~j~0#1.base, f_~j~0#1.offset;f_~k#1 := f_#in~k#1;f_~l#1 := f_#in~l#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~k_ref~0#1.base, f_~k_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~l_ref~0#1.base, f_~l_ref~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~i~0#1.base, f_~i~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~j~0#1.base, f_~j~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call write~int(f_~k#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);call write~int(f_~l#1, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, 4);call write~int(0, f_~i~0#1.base, f_~i~0#1.offset, 4);call write~int(0, f_~j~0#1.base, f_~j~0#1.offset, 4); {846#(and (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~j~0#1.base|)) (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)))} is VALID [2022-02-21 03:33:50,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {846#(and (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~j~0#1.base|)) (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)))} goto; {846#(and (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~j~0#1.base|)) (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)))} is VALID [2022-02-21 03:33:50,115 INFO L290 TraceCheckUtils]: 3: Hoare triple {846#(and (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~j~0#1.base|)) (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)))} call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); {853#(and (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~j~0#1.base|)) (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) |ULTIMATE.start_f_#t~mem7#1|) (<= |ULTIMATE.start_f_#t~mem6#1| (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|)))} is VALID [2022-02-21 03:33:50,124 INFO L290 TraceCheckUtils]: 4: Hoare triple {853#(and (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~j~0#1.base|)) (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) |ULTIMATE.start_f_#t~mem7#1|) (<= |ULTIMATE.start_f_#t~mem6#1| (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|)))} assume !(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1; {857#(and (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~j~0#1.base|)) (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|)))} is VALID [2022-02-21 03:33:50,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {857#(and (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~j~0#1.base|)) (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|)))} goto; {857#(and (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~j~0#1.base|)) (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|)))} is VALID [2022-02-21 03:33:50,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {857#(and (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~j~0#1.base|)) (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|)))} call f_#t~mem11#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4); {857#(and (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~j~0#1.base|)) (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|)))} is VALID [2022-02-21 03:33:50,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {857#(and (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~j~0#1.base|)) (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|)))} assume !!(f_#t~mem11#1 < 1);havoc f_#t~mem11#1;call f_#t~mem12#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);f_#t~post13#1 := f_#t~mem12#1;call write~int(1 + f_#t~post13#1, f_~j~0#1.base, f_~j~0#1.offset, 4);havoc f_#t~mem12#1;havoc f_#t~post13#1;call f_#t~mem14#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); {867#(<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|))} is VALID [2022-02-21 03:33:50,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {867#(<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|))} assume !(0 != (if f_#t~mem14#1 < 0 && 0 != f_#t~mem14#1 % 2 then f_#t~mem14#1 % 2 - 2 else f_#t~mem14#1 % 2));havoc f_#t~mem14#1; {867#(<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|))} is VALID [2022-02-21 03:33:50,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {867#(<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|))} goto; {867#(<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|))} is VALID [2022-02-21 03:33:50,127 INFO L290 TraceCheckUtils]: 10: Hoare triple {867#(<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|))} call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); {877#(<= |ULTIMATE.start_f_#t~mem7#1| |ULTIMATE.start_f_#t~mem6#1|)} is VALID [2022-02-21 03:33:50,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {877#(<= |ULTIMATE.start_f_#t~mem7#1| |ULTIMATE.start_f_#t~mem6#1|)} assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); {834#false} is VALID [2022-02-21 03:33:50,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {834#false} assume 0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2);havoc f_#t~mem10#1; {834#false} is VALID [2022-02-21 03:33:50,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:33:50,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:33:50,366 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-02-21 03:33:50,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 53 [2022-02-21 03:33:50,388 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 03:33:50,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2022-02-21 03:33:50,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {834#false} assume 0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2);havoc f_#t~mem10#1; {834#false} is VALID [2022-02-21 03:33:50,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {877#(<= |ULTIMATE.start_f_#t~mem7#1| |ULTIMATE.start_f_#t~mem6#1|)} assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); {834#false} is VALID [2022-02-21 03:33:50,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {867#(<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|))} call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); {877#(<= |ULTIMATE.start_f_#t~mem7#1| |ULTIMATE.start_f_#t~mem6#1|)} is VALID [2022-02-21 03:33:50,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {867#(<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|))} goto; {867#(<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|))} is VALID [2022-02-21 03:33:50,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {867#(<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|))} assume !(0 != (if f_#t~mem14#1 < 0 && 0 != f_#t~mem14#1 % 2 then f_#t~mem14#1 % 2 - 2 else f_#t~mem14#1 % 2));havoc f_#t~mem14#1; {867#(<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|))} is VALID [2022-02-21 03:33:50,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {899#(forall ((v_ArrVal_491 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_f_~j~0#1.base| v_ArrVal_491) |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) (select (select (store |#memory_int| |ULTIMATE.start_f_~j~0#1.base| v_ArrVal_491) |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|)))} assume !!(f_#t~mem11#1 < 1);havoc f_#t~mem11#1;call f_#t~mem12#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);f_#t~post13#1 := f_#t~mem12#1;call write~int(1 + f_#t~post13#1, f_~j~0#1.base, f_~j~0#1.offset, 4);havoc f_#t~mem12#1;havoc f_#t~post13#1;call f_#t~mem14#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); {867#(<= (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|))} is VALID [2022-02-21 03:33:50,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {899#(forall ((v_ArrVal_491 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_f_~j~0#1.base| v_ArrVal_491) |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) (select (select (store |#memory_int| |ULTIMATE.start_f_~j~0#1.base| v_ArrVal_491) |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|)))} call f_#t~mem11#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4); {899#(forall ((v_ArrVal_491 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_f_~j~0#1.base| v_ArrVal_491) |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) (select (select (store |#memory_int| |ULTIMATE.start_f_~j~0#1.base| v_ArrVal_491) |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|)))} is VALID [2022-02-21 03:33:50,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {899#(forall ((v_ArrVal_491 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_f_~j~0#1.base| v_ArrVal_491) |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) (select (select (store |#memory_int| |ULTIMATE.start_f_~j~0#1.base| v_ArrVal_491) |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|)))} goto; {899#(forall ((v_ArrVal_491 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_f_~j~0#1.base| v_ArrVal_491) |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) (select (select (store |#memory_int| |ULTIMATE.start_f_~j~0#1.base| v_ArrVal_491) |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|)))} is VALID [2022-02-21 03:33:50,551 INFO L290 TraceCheckUtils]: 4: Hoare triple {909#(or (< |ULTIMATE.start_f_#t~mem6#1| |ULTIMATE.start_f_#t~mem7#1|) (forall ((v_ArrVal_491 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_f_~j~0#1.base| v_ArrVal_491) |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) (select (select (store |#memory_int| |ULTIMATE.start_f_~j~0#1.base| v_ArrVal_491) |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|))))} assume !(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1; {899#(forall ((v_ArrVal_491 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_f_~j~0#1.base| v_ArrVal_491) |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) (select (select (store |#memory_int| |ULTIMATE.start_f_~j~0#1.base| v_ArrVal_491) |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|)))} is VALID [2022-02-21 03:33:50,552 INFO L290 TraceCheckUtils]: 3: Hoare triple {846#(and (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~j~0#1.base|)) (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)))} call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); {909#(or (< |ULTIMATE.start_f_#t~mem6#1| |ULTIMATE.start_f_#t~mem7#1|) (forall ((v_ArrVal_491 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_f_~j~0#1.base| v_ArrVal_491) |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) (select (select (store |#memory_int| |ULTIMATE.start_f_~j~0#1.base| v_ArrVal_491) |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|))))} is VALID [2022-02-21 03:33:50,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {846#(and (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~j~0#1.base|)) (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)))} goto; {846#(and (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~j~0#1.base|)) (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)))} is VALID [2022-02-21 03:33:50,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {833#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;assume { :begin_inline_f } true;f_#in~k#1, f_#in~l#1 := main_#t~nondet17#1, main_#t~nondet18#1;havoc f_#res#1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~mem8#1, f_#t~post9#1, f_#t~mem10#1, f_#t~mem6#1, f_#t~mem7#1, f_#t~mem12#1, f_#t~post13#1, f_#t~mem14#1, f_#t~mem11#1, f_#t~mem15#1, f_#t~mem16#1, f_~k#1, f_~l#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, f_~i~0#1.base, f_~i~0#1.offset, f_~j~0#1.base, f_~j~0#1.offset;f_~k#1 := f_#in~k#1;f_~l#1 := f_#in~l#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~k_ref~0#1.base, f_~k_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~l_ref~0#1.base, f_~l_ref~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~i~0#1.base, f_~i~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~j~0#1.base, f_~j~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call write~int(f_~k#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);call write~int(f_~l#1, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, 4);call write~int(0, f_~i~0#1.base, f_~i~0#1.offset, 4);call write~int(0, f_~j~0#1.base, f_~j~0#1.offset, 4); {846#(and (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~j~0#1.base|)) (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)))} is VALID [2022-02-21 03:33:50,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {833#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {833#true} is VALID [2022-02-21 03:33:50,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:33:50,554 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992876203] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:33:50,554 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:33:50,554 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-02-21 03:33:50,554 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894334859] [2022-02-21 03:33:50,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:33:50,611 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:33:50,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-21 03:33:50,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=134, Unknown=2, NotChecked=0, Total=182 [2022-02-21 03:33:50,612 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. cyclomatic complexity: 10 Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 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 03:33:50,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:33:50,874 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-02-21 03:33:50,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 03:33:50,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 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 03:33:50,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:33:50,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 52 transitions. [2022-02-21 03:33:50,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:50,920 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 20 states and 24 transitions. [2022-02-21 03:33:50,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 03:33:50,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-02-21 03:33:50,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2022-02-21 03:33:50,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:33:50,921 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-02-21 03:33:50,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2022-02-21 03:33:50,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2022-02-21 03:33:50,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:33:50,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 24 transitions. Second operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 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 03:33:50,922 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 24 transitions. Second operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 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 03:33:50,922 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 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 03:33:50,923 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:33:50,924 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-02-21 03:33:50,924 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-02-21 03:33:50,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:50,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:50,925 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 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 24 transitions. [2022-02-21 03:33:50,925 INFO L87 Difference]: Start difference. First operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 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 24 transitions. [2022-02-21 03:33:50,926 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:33:50,927 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-02-21 03:33:50,927 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-02-21 03:33:50,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:50,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:50,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:33:50,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:33:50,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 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 03:33:50,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2022-02-21 03:33:50,929 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2022-02-21 03:33:50,929 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2022-02-21 03:33:50,929 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:33:50,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2022-02-21 03:33:50,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:50,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:50,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:50,933 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:33:50,933 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:33:50,934 INFO L791 eck$LassoCheckResult]: Stem: 971#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 972#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;assume { :begin_inline_f } true;f_#in~k#1, f_#in~l#1 := main_#t~nondet17#1, main_#t~nondet18#1;havoc f_#res#1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~mem8#1, f_#t~post9#1, f_#t~mem10#1, f_#t~mem6#1, f_#t~mem7#1, f_#t~mem12#1, f_#t~post13#1, f_#t~mem14#1, f_#t~mem11#1, f_#t~mem15#1, f_#t~mem16#1, f_~k#1, f_~l#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, f_~i~0#1.base, f_~i~0#1.offset, f_~j~0#1.base, f_~j~0#1.offset;f_~k#1 := f_#in~k#1;f_~l#1 := f_#in~l#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~k_ref~0#1.base, f_~k_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~l_ref~0#1.base, f_~l_ref~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~i~0#1.base, f_~i~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~j~0#1.base, f_~j~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call write~int(f_~k#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);call write~int(f_~l#1, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, 4);call write~int(0, f_~i~0#1.base, f_~i~0#1.offset, 4);call write~int(0, f_~j~0#1.base, f_~j~0#1.offset, 4); 968#L569 goto; 969#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 978#L557-1 assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 975#L559 assume !(0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2));havoc f_#t~mem10#1; 976#L564 goto; 979#L567 call f_#t~mem11#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4); 980#L564-1 assume !!(f_#t~mem11#1 < 1);havoc f_#t~mem11#1;call f_#t~mem12#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);f_#t~post13#1 := f_#t~mem12#1;call write~int(1 + f_#t~post13#1, f_~j~0#1.base, f_~j~0#1.offset, 4);havoc f_#t~mem12#1;havoc f_#t~post13#1;call f_#t~mem14#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 981#L566 assume !(0 != (if f_#t~mem14#1 < 0 && 0 != f_#t~mem14#1 % 2 then f_#t~mem14#1 % 2 - 2 else f_#t~mem14#1 % 2));havoc f_#t~mem14#1; 982#L569 goto; 974#L560 [2022-02-21 03:33:50,934 INFO L793 eck$LassoCheckResult]: Loop: 974#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 977#L557-1 assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 973#L559 assume 0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2);havoc f_#t~mem10#1; 974#L560 [2022-02-21 03:33:50,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:50,934 INFO L85 PathProgramCache]: Analyzing trace with hash -635175977, now seen corresponding path program 1 times [2022-02-21 03:33:50,934 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:50,934 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044186225] [2022-02-21 03:33:50,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:50,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:51,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {1084#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1084#true} is VALID [2022-02-21 03:33:51,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {1084#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;assume { :begin_inline_f } true;f_#in~k#1, f_#in~l#1 := main_#t~nondet17#1, main_#t~nondet18#1;havoc f_#res#1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~mem8#1, f_#t~post9#1, f_#t~mem10#1, f_#t~mem6#1, f_#t~mem7#1, f_#t~mem12#1, f_#t~post13#1, f_#t~mem14#1, f_#t~mem11#1, f_#t~mem15#1, f_#t~mem16#1, f_~k#1, f_~l#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, f_~i~0#1.base, f_~i~0#1.offset, f_~j~0#1.base, f_~j~0#1.offset;f_~k#1 := f_#in~k#1;f_~l#1 := f_#in~l#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~k_ref~0#1.base, f_~k_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~l_ref~0#1.base, f_~l_ref~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~i~0#1.base, f_~i~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~j~0#1.base, f_~j~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call write~int(f_~k#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);call write~int(f_~l#1, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, 4);call write~int(0, f_~i~0#1.base, f_~i~0#1.offset, 4);call write~int(0, f_~j~0#1.base, f_~j~0#1.offset, 4); {1086#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) 0))} is VALID [2022-02-21 03:33:51,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {1086#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) 0))} goto; {1086#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) 0))} is VALID [2022-02-21 03:33:51,053 INFO L290 TraceCheckUtils]: 3: Hoare triple {1086#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) 0))} call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); {1086#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) 0))} is VALID [2022-02-21 03:33:51,054 INFO L290 TraceCheckUtils]: 4: Hoare triple {1086#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) 0))} assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); {1087#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (not (= (+ (* (- 2) (div |ULTIMATE.start_f_#t~mem10#1| 2)) |ULTIMATE.start_f_#t~mem10#1|) 0)))} is VALID [2022-02-21 03:33:51,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {1087#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (not (= (+ (* (- 2) (div |ULTIMATE.start_f_#t~mem10#1| 2)) |ULTIMATE.start_f_#t~mem10#1|) 0)))} assume !(0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2));havoc f_#t~mem10#1; {1085#false} is VALID [2022-02-21 03:33:51,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {1085#false} goto; {1085#false} is VALID [2022-02-21 03:33:51,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {1085#false} call f_#t~mem11#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4); {1085#false} is VALID [2022-02-21 03:33:51,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {1085#false} assume !!(f_#t~mem11#1 < 1);havoc f_#t~mem11#1;call f_#t~mem12#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);f_#t~post13#1 := f_#t~mem12#1;call write~int(1 + f_#t~post13#1, f_~j~0#1.base, f_~j~0#1.offset, 4);havoc f_#t~mem12#1;havoc f_#t~post13#1;call f_#t~mem14#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); {1085#false} is VALID [2022-02-21 03:33:51,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {1085#false} assume !(0 != (if f_#t~mem14#1 < 0 && 0 != f_#t~mem14#1 % 2 then f_#t~mem14#1 % 2 - 2 else f_#t~mem14#1 % 2));havoc f_#t~mem14#1; {1085#false} is VALID [2022-02-21 03:33:51,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {1085#false} goto; {1085#false} is VALID [2022-02-21 03:33:51,055 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 03:33:51,055 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:33:51,055 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044186225] [2022-02-21 03:33:51,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044186225] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:33:51,056 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:33:51,056 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:33:51,056 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095098996] [2022-02-21 03:33:51,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:33:51,056 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:33:51,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:51,056 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 3 times [2022-02-21 03:33:51,056 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:51,056 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620495794] [2022-02-21 03:33:51,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:51,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:51,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:51,063 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:51,067 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:51,131 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:33:51,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:33:51,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:33:51,132 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. cyclomatic complexity: 5 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 03:33:51,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:33:51,175 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-02-21 03:33:51,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:33:51,175 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 03:33:51,187 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 03:33:51,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2022-02-21 03:33:51,188 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:51,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2022-02-21 03:33:51,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 03:33:51,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-02-21 03:33:51,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2022-02-21 03:33:51,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:33:51,189 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-02-21 03:33:51,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2022-02-21 03:33:51,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-21 03:33:51,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:33:51,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 21 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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 03:33:51,190 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 21 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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 03:33:51,190 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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 03:33:51,190 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:33:51,191 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-02-21 03:33:51,191 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-21 03:33:51,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:51,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:51,191 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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 21 transitions. [2022-02-21 03:33:51,191 INFO L87 Difference]: Start difference. First operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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 21 transitions. [2022-02-21 03:33:51,192 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:33:51,192 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-02-21 03:33:51,192 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-21 03:33:51,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:51,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:51,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:33:51,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:33:51,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 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 03:33:51,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-02-21 03:33:51,193 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-02-21 03:33:51,193 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-02-21 03:33:51,193 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:33:51,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2022-02-21 03:33:51,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:51,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:51,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:51,194 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:33:51,194 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:33:51,194 INFO L791 eck$LassoCheckResult]: Stem: 1112#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1113#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;assume { :begin_inline_f } true;f_#in~k#1, f_#in~l#1 := main_#t~nondet17#1, main_#t~nondet18#1;havoc f_#res#1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~mem8#1, f_#t~post9#1, f_#t~mem10#1, f_#t~mem6#1, f_#t~mem7#1, f_#t~mem12#1, f_#t~post13#1, f_#t~mem14#1, f_#t~mem11#1, f_#t~mem15#1, f_#t~mem16#1, f_~k#1, f_~l#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, f_~i~0#1.base, f_~i~0#1.offset, f_~j~0#1.base, f_~j~0#1.offset;f_~k#1 := f_#in~k#1;f_~l#1 := f_#in~l#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~k_ref~0#1.base, f_~k_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~l_ref~0#1.base, f_~l_ref~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~i~0#1.base, f_~i~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~j~0#1.base, f_~j~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call write~int(f_~k#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);call write~int(f_~l#1, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, 4);call write~int(0, f_~i~0#1.base, f_~i~0#1.offset, 4);call write~int(0, f_~j~0#1.base, f_~j~0#1.offset, 4); 1123#L569 goto; 1117#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 1118#L557-1 assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 1115#L559 assume 0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2);havoc f_#t~mem10#1; 1111#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 1125#L557-1 assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 1124#L559 assume !(0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2));havoc f_#t~mem10#1; 1122#L564 goto; 1119#L567 call f_#t~mem11#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4); 1120#L564-1 assume !!(f_#t~mem11#1 < 1);havoc f_#t~mem11#1;call f_#t~mem12#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);f_#t~post13#1 := f_#t~mem12#1;call write~int(1 + f_#t~post13#1, f_~j~0#1.base, f_~j~0#1.offset, 4);havoc f_#t~mem12#1;havoc f_#t~post13#1;call f_#t~mem14#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 1121#L566 assume !(0 != (if f_#t~mem14#1 < 0 && 0 != f_#t~mem14#1 % 2 then f_#t~mem14#1 % 2 - 2 else f_#t~mem14#1 % 2));havoc f_#t~mem14#1; 1108#L569 goto; 1109#L560 [2022-02-21 03:33:51,194 INFO L793 eck$LassoCheckResult]: Loop: 1109#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 1116#L557-1 assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 1114#L559 assume 0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2);havoc f_#t~mem10#1; 1109#L560 [2022-02-21 03:33:51,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:51,194 INFO L85 PathProgramCache]: Analyzing trace with hash 184869755, now seen corresponding path program 1 times [2022-02-21 03:33:51,194 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:51,194 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827010406] [2022-02-21 03:33:51,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:51,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:51,225 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:51,240 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:51,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:51,240 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 4 times [2022-02-21 03:33:51,240 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:51,240 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043294578] [2022-02-21 03:33:51,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:51,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:51,248 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:51,252 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:51,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:51,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1306804847, now seen corresponding path program 2 times [2022-02-21 03:33:51,253 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:51,253 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824566738] [2022-02-21 03:33:51,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:51,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:51,285 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:33:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:33:51,301 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:33:54,033 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:33:54,033 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:33:54,033 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:33:54,033 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:33:54,033 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:33:54,034 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:54,034 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:33:54,034 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:33:54,034 INFO L133 ssoRankerPreferences]: Filename of dumped script: twisted-alloca.i_Iteration6_Lasso [2022-02-21 03:33:54,034 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:33:54,034 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:33:54,037 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 03:33:54,042 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 03:33:54,959 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 03:33:54,961 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 03:33:54,963 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 03:33:54,965 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 03:33:54,966 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 03:33:54,968 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 03:33:54,971 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 03:33:54,973 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 03:33:54,976 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 03:33:54,986 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 03:33:54,987 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 03:33:54,989 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 03:33:54,990 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 03:33:54,992 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 03:33:55,001 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 03:33:55,004 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 03:33:55,005 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 03:33:55,006 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 03:33:55,014 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 03:33:55,018 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 03:33:55,455 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:33:55,455 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:33:55,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:55,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:55,458 INFO L229 MonitoredProcess]: Starting monitored process 37 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 03:33:55,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-02-21 03:33:55,461 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 03:33:55,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:55,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:55,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:55,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:55,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:55,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:55,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:55,482 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:55,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-02-21 03:33:55,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:55,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:55,499 INFO L229 MonitoredProcess]: Starting monitored process 38 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 03:33:55,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-02-21 03:33:55,501 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 03:33:55,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:55,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:55,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:55,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:55,509 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:55,509 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:55,526 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:55,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:55,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:55,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:55,543 INFO L229 MonitoredProcess]: Starting monitored process 39 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 03:33:55,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-02-21 03:33:55,551 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 03:33:55,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:55,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:55,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:55,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:55,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:55,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:55,565 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:55,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-02-21 03:33:55,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:55,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:55,586 INFO L229 MonitoredProcess]: Starting monitored process 40 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 03:33:55,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-02-21 03:33:55,600 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 03:33:55,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:55,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:55,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:55,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:55,607 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:55,607 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:55,610 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:55,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:55,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:55,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:55,633 INFO L229 MonitoredProcess]: Starting monitored process 41 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 03:33:55,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-02-21 03:33:55,635 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 03:33:55,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:55,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:55,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:55,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:55,644 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:55,644 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:55,648 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:55,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:55,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:55,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:55,669 INFO L229 MonitoredProcess]: Starting monitored process 42 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 03:33:55,682 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 03:33:55,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-02-21 03:33:55,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:55,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:55,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:55,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:55,690 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:55,690 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:55,704 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:55,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-02-21 03:33:55,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:55,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:55,725 INFO L229 MonitoredProcess]: Starting monitored process 43 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 03:33:55,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-02-21 03:33:55,728 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 03:33:55,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:55,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:55,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:55,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:55,744 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:55,744 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:55,753 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:55,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:55,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:55,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:55,771 INFO L229 MonitoredProcess]: Starting monitored process 44 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 03:33:55,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-02-21 03:33:55,774 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 03:33:55,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:55,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:55,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:55,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:55,781 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:55,781 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:55,797 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:55,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:55,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:55,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:55,822 INFO L229 MonitoredProcess]: Starting monitored process 45 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 03:33:55,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-02-21 03:33:55,824 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 03:33:55,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:55,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:55,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:55,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:55,832 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:55,832 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:55,842 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:55,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:55,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:55,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:55,863 INFO L229 MonitoredProcess]: Starting monitored process 46 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 03:33:55,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-02-21 03:33:55,866 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 03:33:55,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:55,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:55,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:55,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:55,874 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:55,874 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:55,880 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:55,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:55,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:55,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:55,902 INFO L229 MonitoredProcess]: Starting monitored process 47 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 03:33:55,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-02-21 03:33:55,904 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 03:33:55,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:55,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:55,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:55,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:55,915 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:55,915 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:55,924 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:33:55,939 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-02-21 03:33:55,939 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-02-21 03:33:55,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:55,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:55,941 INFO L229 MonitoredProcess]: Starting monitored process 48 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 03:33:55,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-02-21 03:33:55,943 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:33:55,951 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:33:55,952 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:33:55,952 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0#1.base) ULTIMATE.start_f_~k_ref~0#1.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_f_~i~0#1.base) ULTIMATE.start_f_~i~0#1.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_f_~k_ref~0#1.base) ULTIMATE.start_f_~k_ref~0#1.offset)_3 - 1*v_rep(select (select #memory_int ULTIMATE.start_f_~i~0#1.base) ULTIMATE.start_f_~i~0#1.offset)_3 Supporting invariants [] [2022-02-21 03:33:55,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:56,146 INFO L297 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2022-02-21 03:33:56,149 INFO L390 LassoCheck]: Loop: "call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);" "assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);" "assume 0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2);havoc f_#t~mem10#1;" [2022-02-21 03:33:56,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:56,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:56,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:33:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:56,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:56,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {1241#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1241#unseeded} is VALID [2022-02-21 03:33:56,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {1241#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;assume { :begin_inline_f } true;f_#in~k#1, f_#in~l#1 := main_#t~nondet17#1, main_#t~nondet18#1;havoc f_#res#1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~mem8#1, f_#t~post9#1, f_#t~mem10#1, f_#t~mem6#1, f_#t~mem7#1, f_#t~mem12#1, f_#t~post13#1, f_#t~mem14#1, f_#t~mem11#1, f_#t~mem15#1, f_#t~mem16#1, f_~k#1, f_~l#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, f_~i~0#1.base, f_~i~0#1.offset, f_~j~0#1.base, f_~j~0#1.offset;f_~k#1 := f_#in~k#1;f_~l#1 := f_#in~l#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~k_ref~0#1.base, f_~k_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~l_ref~0#1.base, f_~l_ref~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~i~0#1.base, f_~i~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~j~0#1.base, f_~j~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call write~int(f_~k#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);call write~int(f_~l#1, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, 4);call write~int(0, f_~i~0#1.base, f_~i~0#1.offset, 4);call write~int(0, f_~j~0#1.base, f_~j~0#1.offset, 4); {1241#unseeded} is VALID [2022-02-21 03:33:56,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {1241#unseeded} goto; {1241#unseeded} is VALID [2022-02-21 03:33:56,250 INFO L290 TraceCheckUtils]: 3: Hoare triple {1241#unseeded} call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); {1241#unseeded} is VALID [2022-02-21 03:33:56,250 INFO L290 TraceCheckUtils]: 4: Hoare triple {1241#unseeded} assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); {1241#unseeded} is VALID [2022-02-21 03:33:56,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {1241#unseeded} assume 0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2);havoc f_#t~mem10#1; {1241#unseeded} is VALID [2022-02-21 03:33:56,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {1241#unseeded} call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); {1241#unseeded} is VALID [2022-02-21 03:33:56,251 INFO L290 TraceCheckUtils]: 7: Hoare triple {1241#unseeded} assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); {1241#unseeded} is VALID [2022-02-21 03:33:56,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {1241#unseeded} assume !(0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2));havoc f_#t~mem10#1; {1241#unseeded} is VALID [2022-02-21 03:33:56,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {1241#unseeded} goto; {1241#unseeded} is VALID [2022-02-21 03:33:56,253 INFO L290 TraceCheckUtils]: 10: Hoare triple {1241#unseeded} call f_#t~mem11#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4); {1241#unseeded} is VALID [2022-02-21 03:33:56,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {1241#unseeded} assume !!(f_#t~mem11#1 < 1);havoc f_#t~mem11#1;call f_#t~mem12#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);f_#t~post13#1 := f_#t~mem12#1;call write~int(1 + f_#t~post13#1, f_~j~0#1.base, f_~j~0#1.offset, 4);havoc f_#t~mem12#1;havoc f_#t~post13#1;call f_#t~mem14#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); {1241#unseeded} is VALID [2022-02-21 03:33:56,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {1241#unseeded} assume !(0 != (if f_#t~mem14#1 < 0 && 0 != f_#t~mem14#1 % 2 then f_#t~mem14#1 % 2 - 2 else f_#t~mem14#1 % 2));havoc f_#t~mem14#1; {1241#unseeded} is VALID [2022-02-21 03:33:56,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {1241#unseeded} goto; {1241#unseeded} is VALID [2022-02-21 03:33:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:56,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:33:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:56,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:56,423 INFO L356 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-02-21 03:33:56,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 37 [2022-02-21 03:33:56,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {1244#(>= oldRank0 (+ (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|))))} call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); {1478#(and (<= |ULTIMATE.start_f_#t~mem7#1| (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|)) (>= oldRank0 (+ (* (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) (- 1)) (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) |ULTIMATE.start_f_#t~mem6#1|))} is VALID [2022-02-21 03:33:56,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {1478#(and (<= |ULTIMATE.start_f_#t~mem7#1| (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|)) (>= oldRank0 (+ (* (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) (- 1)) (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) |ULTIMATE.start_f_#t~mem6#1|))} assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); {1482#(and (or (not (= |ULTIMATE.start_f_~k_ref~0#1.offset| |ULTIMATE.start_f_~i~0#1.offset|)) (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~i~0#1.base|))) (< 0 oldRank0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) 1) (+ (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) oldRank0)))} is VALID [2022-02-21 03:33:56,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {1482#(and (or (not (= |ULTIMATE.start_f_~k_ref~0#1.offset| |ULTIMATE.start_f_~i~0#1.offset|)) (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~i~0#1.base|))) (< 0 oldRank0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) 1) (+ (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) oldRank0)))} assume 0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2);havoc f_#t~mem10#1; {1434#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|))))))} is VALID [2022-02-21 03:33:56,488 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 03:33:56,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 03:33:56,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:33:56,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 3 letters. [2022-02-21 03:33:56,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,498 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:33:56,498 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 03:33:56,538 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 30 states and 35 transitions. Complement of second has 7 states. [2022-02-21 03:33:56,539 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 03:33:56,539 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:33:56,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. cyclomatic complexity: 5 [2022-02-21 03:33:56,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:56,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:56,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 03:33:56,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:56,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:56,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:56,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 35 transitions. [2022-02-21 03:33:56,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:56,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:56,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:56,544 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 21 transitions. cyclomatic complexity: 5 [2022-02-21 03:33:56,546 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:33:56,546 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 03:33:56,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:56,547 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:33:56,547 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 35 transitions. cyclomatic complexity: 8 [2022-02-21 03:33:56,550 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:33:56,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:33:56,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 3 letters. [2022-02-21 03:33:56,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:33:56,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:33:56,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 03:33:56,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:33:56,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:33:56,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 3 letters. [2022-02-21 03:33:56,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:33:56,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:33:56,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 30 letters. Loop has 30 letters. [2022-02-21 03:33:56,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:33:56,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:33:56,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 18 letters. Loop has 18 letters. [2022-02-21 03:33:56,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:33:56,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:33:56,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 03:33:56,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:33:56,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:33:56,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 3 letters. [2022-02-21 03:33:56,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:33:56,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:33:56,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 16 letters. Loop has 3 letters. [2022-02-21 03:33:56,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:33:56,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:33:56,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 letters. Loop has 3 letters. [2022-02-21 03:33:56,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:33:56,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:33:56,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 03:33:56,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:33:56,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:33:56,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 letters. Loop has 3 letters. [2022-02-21 03:33:56,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:33:56,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:33:56,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 16 letters. Loop has 3 letters. [2022-02-21 03:33:56,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:33:56,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:33:56,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 3 letters. [2022-02-21 03:33:56,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 35 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:33:56,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,563 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:33:56,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 03:33:56,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2022-02-21 03:33:56,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:33:56,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,567 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:33:56,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:56,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:56,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:33:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:56,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:56,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:56,694 INFO L290 TraceCheckUtils]: 0: Hoare triple {1241#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1241#unseeded} is VALID [2022-02-21 03:33:56,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {1241#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;assume { :begin_inline_f } true;f_#in~k#1, f_#in~l#1 := main_#t~nondet17#1, main_#t~nondet18#1;havoc f_#res#1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~mem8#1, f_#t~post9#1, f_#t~mem10#1, f_#t~mem6#1, f_#t~mem7#1, f_#t~mem12#1, f_#t~post13#1, f_#t~mem14#1, f_#t~mem11#1, f_#t~mem15#1, f_#t~mem16#1, f_~k#1, f_~l#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, f_~i~0#1.base, f_~i~0#1.offset, f_~j~0#1.base, f_~j~0#1.offset;f_~k#1 := f_#in~k#1;f_~l#1 := f_#in~l#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~k_ref~0#1.base, f_~k_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~l_ref~0#1.base, f_~l_ref~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~i~0#1.base, f_~i~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~j~0#1.base, f_~j~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call write~int(f_~k#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);call write~int(f_~l#1, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, 4);call write~int(0, f_~i~0#1.base, f_~i~0#1.offset, 4);call write~int(0, f_~j~0#1.base, f_~j~0#1.offset, 4); {1241#unseeded} is VALID [2022-02-21 03:33:56,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {1241#unseeded} goto; {1241#unseeded} is VALID [2022-02-21 03:33:56,695 INFO L290 TraceCheckUtils]: 3: Hoare triple {1241#unseeded} call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); {1241#unseeded} is VALID [2022-02-21 03:33:56,696 INFO L290 TraceCheckUtils]: 4: Hoare triple {1241#unseeded} assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); {1241#unseeded} is VALID [2022-02-21 03:33:56,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {1241#unseeded} assume 0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2);havoc f_#t~mem10#1; {1241#unseeded} is VALID [2022-02-21 03:33:56,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {1241#unseeded} call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); {1241#unseeded} is VALID [2022-02-21 03:33:56,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {1241#unseeded} assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); {1241#unseeded} is VALID [2022-02-21 03:33:56,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {1241#unseeded} assume !(0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2));havoc f_#t~mem10#1; {1241#unseeded} is VALID [2022-02-21 03:33:56,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {1241#unseeded} goto; {1241#unseeded} is VALID [2022-02-21 03:33:56,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {1241#unseeded} call f_#t~mem11#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4); {1241#unseeded} is VALID [2022-02-21 03:33:56,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {1241#unseeded} assume !!(f_#t~mem11#1 < 1);havoc f_#t~mem11#1;call f_#t~mem12#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);f_#t~post13#1 := f_#t~mem12#1;call write~int(1 + f_#t~post13#1, f_~j~0#1.base, f_~j~0#1.offset, 4);havoc f_#t~mem12#1;havoc f_#t~post13#1;call f_#t~mem14#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); {1241#unseeded} is VALID [2022-02-21 03:33:56,698 INFO L290 TraceCheckUtils]: 12: Hoare triple {1241#unseeded} assume !(0 != (if f_#t~mem14#1 < 0 && 0 != f_#t~mem14#1 % 2 then f_#t~mem14#1 % 2 - 2 else f_#t~mem14#1 % 2));havoc f_#t~mem14#1; {1241#unseeded} is VALID [2022-02-21 03:33:56,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {1241#unseeded} goto; {1241#unseeded} is VALID [2022-02-21 03:33:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:56,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:33:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:56,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:56,851 INFO L356 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-02-21 03:33:56,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 37 [2022-02-21 03:33:56,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {1244#(>= oldRank0 (+ (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|))))} call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); {1569#(and (<= |ULTIMATE.start_f_#t~mem7#1| (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|)) (>= oldRank0 (+ (* (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) (- 1)) (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) |ULTIMATE.start_f_#t~mem6#1|))} is VALID [2022-02-21 03:33:56,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {1569#(and (<= |ULTIMATE.start_f_#t~mem7#1| (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|)) (>= oldRank0 (+ (* (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) (- 1)) (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) |ULTIMATE.start_f_#t~mem6#1|))} assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); {1573#(and (or (not (= |ULTIMATE.start_f_~k_ref~0#1.offset| |ULTIMATE.start_f_~i~0#1.offset|)) (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~i~0#1.base|))) (< 0 oldRank0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) 1) (+ (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) oldRank0)))} is VALID [2022-02-21 03:33:56,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {1573#(and (or (not (= |ULTIMATE.start_f_~k_ref~0#1.offset| |ULTIMATE.start_f_~i~0#1.offset|)) (not (= |ULTIMATE.start_f_~k_ref~0#1.base| |ULTIMATE.start_f_~i~0#1.base|))) (< 0 oldRank0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) 1) (+ (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|) oldRank0)))} assume 0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2);havoc f_#t~mem10#1; {1434#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select (select |#memory_int| |ULTIMATE.start_f_~k_ref~0#1.base|) |ULTIMATE.start_f_~k_ref~0#1.offset|) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_f_~i~0#1.base|) |ULTIMATE.start_f_~i~0#1.offset|))))))} is VALID [2022-02-21 03:33:56,896 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 03:33:56,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 03:33:56,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:33:56,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 3 letters. [2022-02-21 03:33:56,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,906 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:33:56,906 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 03:33:56,985 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 51 states and 59 transitions. Complement of second has 9 states. [2022-02-21 03:33:56,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:33:56,985 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:33:56,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. cyclomatic complexity: 5 [2022-02-21 03:33:56,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:56,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:56,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 03:33:56,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:33:56,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:56,986 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:56,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 59 transitions. [2022-02-21 03:33:56,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:56,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:56,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:56,987 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 21 transitions. cyclomatic complexity: 5 [2022-02-21 03:33:56,987 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:33:56,987 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 03:33:56,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:33:56,988 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:33:56,988 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 51 states and 59 transitions. cyclomatic complexity: 13 [2022-02-21 03:33:56,989 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:33:56,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:33:56,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 3 letters. [2022-02-21 03:33:56,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 59 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:33:56,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:33:56,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 3 letters. [2022-02-21 03:33:56,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 59 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:33:56,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:33:56,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 3 letters. [2022-02-21 03:33:56,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 59 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:33:56,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 51 letters. Loop has 51 letters. [2022-02-21 03:33:56,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 51 letters. Loop has 51 letters. [2022-02-21 03:33:56,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 59 transitions. cyclomatic complexity: 13 Stem has 51 letters. Loop has 51 letters. [2022-02-21 03:33:56,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:33:56,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 18 letters. Loop has 18 letters. [2022-02-21 03:33:56,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 59 transitions. cyclomatic complexity: 13 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:33:56,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:33:56,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 03:33:56,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 59 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:33:56,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:56,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:33:56,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:57,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 3 letters. [2022-02-21 03:33:57,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:57,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 59 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:33:57,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:57,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:33:57,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:57,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 16 letters. Loop has 3 letters. [2022-02-21 03:33:57,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:57,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 59 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:33:57,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:57,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:33:57,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:57,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 letters. Loop has 3 letters. [2022-02-21 03:33:57,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:57,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 59 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:33:57,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:57,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:33:57,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:57,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 3 letters. [2022-02-21 03:33:57,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:57,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 59 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:33:57,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:57,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:33:57,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:57,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 3 letters. [2022-02-21 03:33:57,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:57,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 59 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:33:57,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:57,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:33:57,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:57,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 18 letters. Loop has 3 letters. [2022-02-21 03:33:57,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:57,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 59 transitions. cyclomatic complexity: 13 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:33:57,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:57,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 5 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:33:57,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:57,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 19 letters. Loop has 3 letters. [2022-02-21 03:33:57,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:57,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 59 transitions. cyclomatic complexity: 13 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:33:57,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:57,008 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:33:57,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 03:33:57,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2022-02-21 03:33:57,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:33:57,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:57,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:33:57,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:57,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:33:57,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:57,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 59 transitions. cyclomatic complexity: 13 [2022-02-21 03:33:57,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:57,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 37 states and 43 transitions. [2022-02-21 03:33:57,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 03:33:57,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-02-21 03:33:57,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 43 transitions. [2022-02-21 03:33:57,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:33:57,012 INFO L681 BuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-02-21 03:33:57,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 43 transitions. [2022-02-21 03:33:57,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2022-02-21 03:33:57,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:33:57,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states and 43 transitions. Second operand has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 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 03:33:57,013 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states and 43 transitions. Second operand has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 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 03:33:57,014 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 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 03:33:57,014 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:33:57,015 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-02-21 03:33:57,015 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-02-21 03:33:57,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:57,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:57,015 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 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 37 states and 43 transitions. [2022-02-21 03:33:57,015 INFO L87 Difference]: Start difference. First operand has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 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 37 states and 43 transitions. [2022-02-21 03:33:57,015 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:33:57,016 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-02-21 03:33:57,031 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-02-21 03:33:57,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:33:57,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:33:57,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:33:57,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:33:57,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 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 03:33:57,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-02-21 03:33:57,032 INFO L704 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-02-21 03:33:57,032 INFO L587 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-02-21 03:33:57,033 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:33:57,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 41 transitions. [2022-02-21 03:33:57,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:33:57,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:57,033 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:57,033 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:33:57,033 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:33:57,033 INFO L791 eck$LassoCheckResult]: Stem: 1645#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1646#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;assume { :begin_inline_f } true;f_#in~k#1, f_#in~l#1 := main_#t~nondet17#1, main_#t~nondet18#1;havoc f_#res#1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~mem8#1, f_#t~post9#1, f_#t~mem10#1, f_#t~mem6#1, f_#t~mem7#1, f_#t~mem12#1, f_#t~post13#1, f_#t~mem14#1, f_#t~mem11#1, f_#t~mem15#1, f_#t~mem16#1, f_~k#1, f_~l#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, f_~i~0#1.base, f_~i~0#1.offset, f_~j~0#1.base, f_~j~0#1.offset;f_~k#1 := f_#in~k#1;f_~l#1 := f_#in~l#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~k_ref~0#1.base, f_~k_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~l_ref~0#1.base, f_~l_ref~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~i~0#1.base, f_~i~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~j~0#1.base, f_~j~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call write~int(f_~k#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);call write~int(f_~l#1, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, 4);call write~int(0, f_~i~0#1.base, f_~i~0#1.offset, 4);call write~int(0, f_~j~0#1.base, f_~j~0#1.offset, 4); 1641#L569 goto; 1642#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 1656#L557-1 assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 1649#L559 assume 0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2);havoc f_#t~mem10#1; 1650#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 1658#L557-1 assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 1659#L559 assume !(0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2));havoc f_#t~mem10#1; 1672#L564 goto; 1670#L567 call f_#t~mem11#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4); 1653#L564-1 assume !!(f_#t~mem11#1 < 1);havoc f_#t~mem11#1;call f_#t~mem12#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);f_#t~post13#1 := f_#t~mem12#1;call write~int(1 + f_#t~post13#1, f_~j~0#1.base, f_~j~0#1.offset, 4);havoc f_#t~mem12#1;havoc f_#t~post13#1;call f_#t~mem14#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 1654#L566 assume 0 != (if f_#t~mem14#1 < 0 && 0 != f_#t~mem14#1 % 2 then f_#t~mem14#1 % 2 - 2 else f_#t~mem14#1 % 2);havoc f_#t~mem14#1; 1664#L567 call f_#t~mem11#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4); 1666#L564-1 assume !!(f_#t~mem11#1 < 1);havoc f_#t~mem11#1;call f_#t~mem12#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);f_#t~post13#1 := f_#t~mem12#1;call write~int(1 + f_#t~post13#1, f_~j~0#1.base, f_~j~0#1.offset, 4);havoc f_#t~mem12#1;havoc f_#t~post13#1;call f_#t~mem14#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 1663#L566 assume !(0 != (if f_#t~mem14#1 < 0 && 0 != f_#t~mem14#1 % 2 then f_#t~mem14#1 % 2 - 2 else f_#t~mem14#1 % 2));havoc f_#t~mem14#1; 1662#L569 goto; 1648#L560 [2022-02-21 03:33:57,033 INFO L793 eck$LassoCheckResult]: Loop: 1648#L560 call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); 1655#L557-1 assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); 1647#L559 assume 0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2);havoc f_#t~mem10#1; 1648#L560 [2022-02-21 03:33:57,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:57,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1305515858, now seen corresponding path program 1 times [2022-02-21 03:33:57,034 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:33:57,034 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538025934] [2022-02-21 03:33:57,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:57,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:33:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:57,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {1819#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1819#true} is VALID [2022-02-21 03:33:57,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {1819#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1;assume { :begin_inline_f } true;f_#in~k#1, f_#in~l#1 := main_#t~nondet17#1, main_#t~nondet18#1;havoc f_#res#1;havoc f_#t~malloc2#1.base, f_#t~malloc2#1.offset, f_#t~malloc3#1.base, f_#t~malloc3#1.offset, f_#t~malloc4#1.base, f_#t~malloc4#1.offset, f_#t~malloc5#1.base, f_#t~malloc5#1.offset, f_#t~mem8#1, f_#t~post9#1, f_#t~mem10#1, f_#t~mem6#1, f_#t~mem7#1, f_#t~mem12#1, f_#t~post13#1, f_#t~mem14#1, f_#t~mem11#1, f_#t~mem15#1, f_#t~mem16#1, f_~k#1, f_~l#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, f_~i~0#1.base, f_~i~0#1.offset, f_~j~0#1.base, f_~j~0#1.offset;f_~k#1 := f_#in~k#1;f_~l#1 := f_#in~l#1;call f_#t~malloc2#1.base, f_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);f_~k_ref~0#1.base, f_~k_ref~0#1.offset := f_#t~malloc2#1.base, f_#t~malloc2#1.offset;call f_#t~malloc3#1.base, f_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);f_~l_ref~0#1.base, f_~l_ref~0#1.offset := f_#t~malloc3#1.base, f_#t~malloc3#1.offset;call f_#t~malloc4#1.base, f_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);f_~i~0#1.base, f_~i~0#1.offset := f_#t~malloc4#1.base, f_#t~malloc4#1.offset;call f_#t~malloc5#1.base, f_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);f_~j~0#1.base, f_~j~0#1.offset := f_#t~malloc5#1.base, f_#t~malloc5#1.offset;call write~int(f_~k#1, f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4);call write~int(f_~l#1, f_~l_ref~0#1.base, f_~l_ref~0#1.offset, 4);call write~int(0, f_~i~0#1.base, f_~i~0#1.offset, 4);call write~int(0, f_~j~0#1.base, f_~j~0#1.offset, 4); {1821#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|) 0))} is VALID [2022-02-21 03:33:57,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {1821#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|) 0))} goto; {1821#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|) 0))} is VALID [2022-02-21 03:33:57,115 INFO L290 TraceCheckUtils]: 3: Hoare triple {1821#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|) 0))} call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); {1821#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|) 0))} is VALID [2022-02-21 03:33:57,116 INFO L290 TraceCheckUtils]: 4: Hoare triple {1821#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|) 0))} assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); {1821#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|) 0))} is VALID [2022-02-21 03:33:57,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {1821#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|) 0))} assume 0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2);havoc f_#t~mem10#1; {1821#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|) 0))} is VALID [2022-02-21 03:33:57,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {1821#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|) 0))} call f_#t~mem6#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);call f_#t~mem7#1 := read~int(f_~k_ref~0#1.base, f_~k_ref~0#1.offset, 4); {1821#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|) 0))} is VALID [2022-02-21 03:33:57,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {1821#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|) 0))} assume !!(f_#t~mem6#1 < f_#t~mem7#1);havoc f_#t~mem6#1;havoc f_#t~mem7#1;call f_#t~mem8#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4);f_#t~post9#1 := f_#t~mem8#1;call write~int(1 + f_#t~post9#1, f_~i~0#1.base, f_~i~0#1.offset, 4);havoc f_#t~mem8#1;havoc f_#t~post9#1;call f_#t~mem10#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); {1821#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|) 0))} is VALID [2022-02-21 03:33:57,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {1821#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|) 0))} assume !(0 != (if f_#t~mem10#1 < 0 && 0 != f_#t~mem10#1 % 2 then f_#t~mem10#1 % 2 - 2 else f_#t~mem10#1 % 2));havoc f_#t~mem10#1; {1821#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|) 0))} is VALID [2022-02-21 03:33:57,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {1821#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|) 0))} goto; {1821#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|) 0))} is VALID [2022-02-21 03:33:57,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {1821#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|) 0))} call f_#t~mem11#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4); {1821#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|) 0))} is VALID [2022-02-21 03:33:57,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {1821#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|) 0))} assume !!(f_#t~mem11#1 < 1);havoc f_#t~mem11#1;call f_#t~mem12#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);f_#t~post13#1 := f_#t~mem12#1;call write~int(1 + f_#t~post13#1, f_~j~0#1.base, f_~j~0#1.offset, 4);havoc f_#t~mem12#1;havoc f_#t~post13#1;call f_#t~mem14#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); {1822#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|)))} is VALID [2022-02-21 03:33:57,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {1822#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|)))} assume 0 != (if f_#t~mem14#1 < 0 && 0 != f_#t~mem14#1 % 2 then f_#t~mem14#1 % 2 - 2 else f_#t~mem14#1 % 2);havoc f_#t~mem14#1; {1822#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|)))} is VALID [2022-02-21 03:33:57,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {1822#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|)))} call f_#t~mem11#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4); {1823#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= (+ (* (- 1) |ULTIMATE.start_f_#t~mem11#1|) (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|)) 0) (<= 1 (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|)))} is VALID [2022-02-21 03:33:57,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {1823#(and (not (= |ULTIMATE.start_f_~j~0#1.base| |ULTIMATE.start_f_~i~0#1.base|)) (= (+ (* (- 1) |ULTIMATE.start_f_#t~mem11#1|) (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|)) 0) (<= 1 (select (select |#memory_int| |ULTIMATE.start_f_~j~0#1.base|) |ULTIMATE.start_f_~j~0#1.offset|)))} assume !!(f_#t~mem11#1 < 1);havoc f_#t~mem11#1;call f_#t~mem12#1 := read~int(f_~j~0#1.base, f_~j~0#1.offset, 4);f_#t~post13#1 := f_#t~mem12#1;call write~int(1 + f_#t~post13#1, f_~j~0#1.base, f_~j~0#1.offset, 4);havoc f_#t~mem12#1;havoc f_#t~post13#1;call f_#t~mem14#1 := read~int(f_~i~0#1.base, f_~i~0#1.offset, 4); {1820#false} is VALID [2022-02-21 03:33:57,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {1820#false} assume !(0 != (if f_#t~mem14#1 < 0 && 0 != f_#t~mem14#1 % 2 then f_#t~mem14#1 % 2 - 2 else f_#t~mem14#1 % 2));havoc f_#t~mem14#1; {1820#false} is VALID [2022-02-21 03:33:57,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {1820#false} goto; {1820#false} is VALID [2022-02-21 03:33:57,123 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-21 03:33:57,123 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:33:57,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538025934] [2022-02-21 03:33:57,123 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538025934] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:33:57,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255090272] [2022-02-21 03:33:57,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:33:57,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:33:57,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:57,136 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:33:57,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-02-21 03:33:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:57,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-21 03:33:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:57,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:34:12,199 WARN L228 SmtUtils]: Spent 14.91s on a formula simplification. DAG size of input: 302 DAG size of output: 144 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-02-21 03:34:12,204 INFO L356 Elim1Store]: treesize reduction 1048, result has 31.1 percent of original size [2022-02-21 03:34:12,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 12 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 14 new quantified variables, introduced 49 case distinctions, treesize of input 8118 treesize of output 6725 [2022-02-21 03:34:12,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2022-02-21 03:34:13,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2022-02-21 03:34:13,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2022-02-21 03:34:14,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2022-02-21 03:34:14,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2022-02-21 03:34:16,113 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:16,118 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:16,413 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:16,436 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:16,476 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:16,485 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:16,502 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:16,643 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:16,644 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:16,644 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:16,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:16,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:16,652 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:16,717 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:16,730 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:16,801 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:16,809 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:16,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:16,852 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:16,852 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:16,890 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:16,891 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:16,892 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:16,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:16,940 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:16,973 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:16,986 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:16,988 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:16,988 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:16,989 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:16,989 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:17,003 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:17,004 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:17,004 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:17,007 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:17,007 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:17,009 INFO L244 Elim1Store]: Index analysis took 903 ms [2022-02-21 03:34:17,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 11 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 500 treesize of output 4584 [2022-02-21 03:34:19,361 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:19,551 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:19,559 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:19,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:19,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:19,607 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:19,614 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:19,622 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:19,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:19,926 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:19,934 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:19,941 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:19,949 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:20,077 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:20,189 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:20,189 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:20,196 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:20,203 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:20,226 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:20,237 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:20,247 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:20,289 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:20,297 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:20,319 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:20,320 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:20,333 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:20,361 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:20,362 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:20,380 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:20,381 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:20,395 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:20,396 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:20,397 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:20,412 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:20,413 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:20,417 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:20,418 INFO L244 Elim1Store]: Index analysis took 1068 ms [2022-02-21 03:34:20,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 11 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 500 treesize of output 4584 [2022-02-21 03:34:22,962 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:22,969 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,285 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,291 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,296 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,391 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,392 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,392 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,394 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,394 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,400 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,455 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,468 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,524 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,529 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,557 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,561 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,580 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,580 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,581 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,608 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,641 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,656 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,656 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,657 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,657 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,674 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,675 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,675 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,677 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,678 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:23,679 INFO L244 Elim1Store]: Index analysis took 732 ms [2022-02-21 03:34:23,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 11 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 500 treesize of output 4584 [2022-02-21 03:34:24,703 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:24,708 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,048 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,069 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,116 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,122 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,128 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,228 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,229 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,229 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,230 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,235 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,292 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,305 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,364 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,371 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,412 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,412 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,413 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,439 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,440 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,441 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,476 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,511 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,518 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,538 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,538 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,539 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,539 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,539 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,559 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,559 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,562 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,564 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:25,566 INFO L244 Elim1Store]: Index analysis took 866 ms [2022-02-21 03:34:25,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 11 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 505 treesize of output 4587 [2022-02-21 03:34:26,237 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:26,393 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:26,399 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:26,406 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:26,413 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:26,453 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:26,460 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:26,469 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:26,721 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:26,779 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:26,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:26,794 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:26,801 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:26,896 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,029 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,030 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,038 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,047 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,069 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,076 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,084 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,120 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,130 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,153 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,154 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,200 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,201 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,216 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,217 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,230 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,231 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,246 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,249 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,250 INFO L244 Elim1Store]: Index analysis took 1024 ms [2022-02-21 03:34:27,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 11 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 505 treesize of output 4587 [2022-02-21 03:34:27,665 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,692 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,720 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,749 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,781 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,814 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,847 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,909 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,940 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:27,979 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:28,613 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:28,640 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:28,710 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:28,745 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:28,984 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:28,985 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:28,986 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:29,002 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:29,134 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:29,158 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:29,283 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:29,330 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:29,330 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:29,359 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:29,359 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:29,394 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:29,443 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:29,458 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:29,478 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:29,478 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:29,479 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:29,498 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:29,498 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:29,501 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:29,502 INFO L244 Elim1Store]: Index analysis took 1866 ms [2022-02-21 03:34:29,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 11 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 505 treesize of output 4587 [2022-02-21 03:34:35,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:35,792 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,082 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,097 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,129 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,134 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,140 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,259 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,319 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,409 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,416 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,450 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,451 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,452 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,479 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,479 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,480 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,511 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,544 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,550 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,572 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,574 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,592 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,593 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,594 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,596 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,596 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:36,598 INFO L244 Elim1Store]: Index analysis took 820 ms [2022-02-21 03:34:36,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 11 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 505 treesize of output 4587 [2022-02-21 03:34:37,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:37,871 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:37,894 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:37,948 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:38,210 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:38,230 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:38,285 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:38,314 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:38,542 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:38,543 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:38,543 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:38,560 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:38,654 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:38,681 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:38,818 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:38,831 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:38,910 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:38,948 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:38,948 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:38,974 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:38,975 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:39,019 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:39,062 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:39,082 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:39,119 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:39,160 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:39,171 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:39,197 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:39,197 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:39,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:39,219 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:39,220 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:39,222 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:39,224 INFO L244 Elim1Store]: Index analysis took 1867 ms [2022-02-21 03:34:39,464 INFO L356 Elim1Store]: treesize reduction 133, result has 5.7 percent of original size [2022-02-21 03:34:39,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 11 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 23 case distinctions, treesize of input 505 treesize of output 4595 [2022-02-21 03:34:45,584 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:45,617 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:45,698 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:46,095 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:46,115 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:46,172 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:47,208 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:34:47,240 INFO L173 IndexEqualityManager]: detected equality via solver