./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --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-crafted/4BitCounterPointer.c -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 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:23:10,383 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:23:10,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:23:10,409 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:23:10,410 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:23:10,412 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:23:10,415 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:23:10,417 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:23:10,419 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:23:10,423 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:23:10,424 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:23:10,425 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:23:10,426 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:23:10,428 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:23:10,429 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:23:10,430 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:23:10,431 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:23:10,432 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:23:10,435 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:23:10,439 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:23:10,440 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:23:10,441 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:23:10,442 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:23:10,443 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:23:10,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:23:10,446 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:23:10,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:23:10,447 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:23:10,447 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:23:10,448 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:23:10,449 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:23:10,449 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:23:10,450 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:23:10,451 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:23:10,452 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:23:10,452 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:23:10,453 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:23:10,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:23:10,453 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:23:10,454 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:23:10,454 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:23:10,455 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:23:10,485 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:23:10,486 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:23:10,486 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:23:10,486 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:23:10,487 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:23:10,487 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:23:10,488 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:23:10,488 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:23:10,488 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:23:10,488 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:23:10,489 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:23:10,489 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:23:10,489 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:23:10,489 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:23:10,489 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:23:10,490 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:23:10,490 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:23:10,490 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:23:10,490 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:23:10,490 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:23:10,490 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:23:10,490 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:23:10,491 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:23:10,491 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:23:10,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:23:10,491 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:23:10,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:23:10,491 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:23:10,492 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:23:10,492 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 -> 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 [2022-02-21 03:23:10,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:23:10,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:23:10,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:23:10,753 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:23:10,753 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:23:10,754 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2022-02-21 03:23:10,851 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/679d65076/00d0ce2399054691903b57e14b2c221e/FLAG77dc96720 [2022-02-21 03:23:11,199 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:23:11,200 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2022-02-21 03:23:11,207 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/679d65076/00d0ce2399054691903b57e14b2c221e/FLAG77dc96720 [2022-02-21 03:23:11,641 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/679d65076/00d0ce2399054691903b57e14b2c221e [2022-02-21 03:23:11,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:23:11,643 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:23:11,652 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:23:11,652 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:23:11,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:23:11,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:23:11" (1/1) ... [2022-02-21 03:23:11,656 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b19734e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:11, skipping insertion in model container [2022-02-21 03:23:11,656 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:23:11" (1/1) ... [2022-02-21 03:23:11,661 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:23:11,671 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:23:11,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:23:11,810 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:23:11,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:23:11,835 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:23:11,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:11 WrapperNode [2022-02-21 03:23:11,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:23:11,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:23:11,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:23:11,838 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:23:11,843 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:23:11" (1/1) ... [2022-02-21 03:23:11,850 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:23:11" (1/1) ... [2022-02-21 03:23:11,867 INFO L137 Inliner]: procedures = 7, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 61 [2022-02-21 03:23:11,867 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:23:11,868 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:23:11,868 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:23:11,868 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:23:11,873 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:11" (1/1) ... [2022-02-21 03:23:11,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:11" (1/1) ... [2022-02-21 03:23:11,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:11" (1/1) ... [2022-02-21 03:23:11,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:11" (1/1) ... [2022-02-21 03:23:11,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:11" (1/1) ... [2022-02-21 03:23:11,885 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:11" (1/1) ... [2022-02-21 03:23:11,886 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:11" (1/1) ... [2022-02-21 03:23:11,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:23:11,888 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:23:11,888 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:23:11,888 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:23:11,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:11" (1/1) ... [2022-02-21 03:23:11,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:11,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:11,912 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:23:11,920 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:23:11,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:23:11,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:23:11,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:23:11,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:23:11,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:23:11,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:23:11,982 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:23:11,984 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:23:12,197 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:23:12,202 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:23:12,202 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:23:12,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:23:12 BoogieIcfgContainer [2022-02-21 03:23:12,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:23:12,204 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:23:12,204 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:23:12,207 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:23:12,225 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:12,225 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:23:11" (1/3) ... [2022-02-21 03:23:12,226 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63f22679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:23:12, skipping insertion in model container [2022-02-21 03:23:12,226 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:12,226 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:11" (2/3) ... [2022-02-21 03:23:12,227 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63f22679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:23:12, skipping insertion in model container [2022-02-21 03:23:12,227 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:12,227 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:23:12" (3/3) ... [2022-02-21 03:23:12,228 INFO L388 chiAutomizerObserver]: Analyzing ICFG 4BitCounterPointer.c [2022-02-21 03:23:12,264 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:23:12,264 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:23:12,264 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:23:12,264 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:23:12,264 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:23:12,264 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:23:12,264 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:23:12,265 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:23:12,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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:23:12,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:23:12,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:12,304 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:12,307 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:23:12,308 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:23:12,308 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:23:12,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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:23:12,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:23:12,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:12,312 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:12,312 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:23:12,312 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:23:12,317 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; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem4#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 6#L24-2true [2022-02-21 03:23:12,317 INFO L793 eck$LassoCheckResult]: Loop: 6#L24-2true call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 9#L15-1true assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 3#L16true assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 6#L24-2true [2022-02-21 03:23:12,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:12,329 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:23:12,339 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:12,340 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945880856] [2022-02-21 03:23:12,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:12,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:12,565 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:12,626 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:12,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:12,629 INFO L85 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2022-02-21 03:23:12,629 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:12,630 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035189198] [2022-02-21 03:23:12,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:12,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:12,659 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:12,671 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:12,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:12,676 INFO L85 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2022-02-21 03:23:12,677 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:12,677 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838645320] [2022-02-21 03:23:12,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:12,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:12,742 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:12,762 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:13,888 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:13,889 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:13,889 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:13,889 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:13,889 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:23:13,889 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:13,889 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:13,889 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:13,890 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration1_Lasso [2022-02-21 03:23:13,890 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:13,890 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:13,906 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:23:13,911 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:23:14,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:14,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:14,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:14,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:14,467 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:23:14,475 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:23:14,477 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:23:14,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:14,480 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:23:14,949 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:14,952 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:23:14,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:14,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:14,954 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:23:14,958 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:23:14,959 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:23:14,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:14,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:14,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:14,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:14,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:14,969 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:14,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:14,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:14,995 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:23:14,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:14,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:14,997 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:23:14,998 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:23:14,999 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:23:15,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:15,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:15,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:15,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:15,016 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:23:15,016 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:23:15,031 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:15,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:15,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:15,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:15,049 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:23:15,055 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:23:15,056 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:23:15,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:15,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:15,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:15,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:15,065 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:23:15,065 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:23:15,077 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:15,095 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:23:15,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:15,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:15,096 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:23:15,097 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:23:15,098 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:23:15,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:15,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:15,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:15,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:15,106 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:23:15,106 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:23:15,115 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:15,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-02-21 03:23:15,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:15,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:15,132 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:23:15,133 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:23:15,134 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:23:15,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:15,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:15,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:15,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:15,143 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:23:15,143 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:23:15,149 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:15,164 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:23:15,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:15,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:15,165 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:15,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:23:15,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:15,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:15,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:15,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:15,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:15,177 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:23:15,177 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:23:15,187 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:15,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:15,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:15,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:15,203 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:23:15,205 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:23:15,206 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:23:15,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:15,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:15,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:15,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:15,214 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:23:15,214 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:23:15,225 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:15,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:15,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:15,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:15,248 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:23:15,249 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:23:15,250 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:23:15,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:15,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:15,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:15,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:15,258 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:23:15,258 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:23:15,262 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:15,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-02-21 03:23:15,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:15,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:15,280 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:23:15,280 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:23:15,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:23:15,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:15,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:15,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:15,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:15,345 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:23:15,345 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:23:15,364 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:15,380 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:23:15,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:15,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:15,382 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:23:15,383 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:23:15,384 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:23:15,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:15,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:15,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:15,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:15,394 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:23:15,394 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:23:15,405 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:15,421 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:23:15,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:15,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:15,423 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:23:15,443 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:23:15,445 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:23:15,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:15,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:15,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:15,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:15,454 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:23:15,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:23:15,465 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:15,483 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:23:15,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:15,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:15,484 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:23:15,485 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:23:15,486 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:23:15,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:15,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:15,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:15,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:15,498 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:23:15,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:23:15,514 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:15,532 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:23:15,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:15,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:15,534 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:23:15,535 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:23:15,536 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:23:15,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:15,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:15,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:15,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:15,544 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:23:15,544 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:23:15,567 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:23:15,582 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-02-21 03:23:15,582 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-02-21 03:23:15,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:15,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:15,586 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:23:15,587 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:23:15,588 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:23:15,609 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:23:15,609 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:23:15,610 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0#1.base) ULTIMATE.start_main_~x0~0#1.offset)_1 + 1 Supporting invariants [] [2022-02-21 03:23:15,629 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:23:15,789 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:23:15,822 INFO L297 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2022-02-21 03:23:15,826 INFO L390 LassoCheck]: Loop: "call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4);" "assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4);" "assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4);" [2022-02-21 03:23:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:15,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:15,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:23:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:15,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:15,909 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {21#unseeded} is VALID [2022-02-21 03:23:15,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem4#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); {21#unseeded} is VALID [2022-02-21 03:23:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:15,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:23:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:15,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:15,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#(>= oldRank0 (+ (* (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|)) 1))} call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); {24#(>= oldRank0 (+ (* (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|)) 1))} is VALID [2022-02-21 03:23:15,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#(>= oldRank0 (+ (* (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|)) 1))} assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); {225#(and (>= oldRank0 (+ (* (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|)) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) |ULTIMATE.start_main_#t~mem5#1|))} is VALID [2022-02-21 03:23:15,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {225#(and (>= oldRank0 (+ (* (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|)) 1)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) |ULTIMATE.start_main_#t~mem5#1|))} assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); {214#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|)) 1))) unseeded)} is VALID [2022-02-21 03:23:15,961 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:23:15,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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:23:15,989 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:23:15,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:15,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:15,995 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:23:15,995 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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:23:16,056 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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). Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Result 29 states and 36 transitions. Complement of second has 8 states. [2022-02-21 03:23:16,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:23:16,057 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:16,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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:23:16,060 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:23:16,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:16,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:16,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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:23:16,064 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:23:16,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:16,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:16,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2022-02-21 03:23:16,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:23:16,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:16,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:16,069 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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:23:16,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:23:16,073 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:23:16,073 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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:23:16,074 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:23:16,074 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:23:16,074 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 36 transitions. cyclomatic complexity: 9 [2022-02-21 03:23:16,076 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:23:16,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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 2 letters. Loop has 3 letters. [2022-02-21 03:23:16,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:16,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:16,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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:23:16,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:23:16,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:23:16,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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 4 letters. [2022-02-21 03:23:16,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:23:16,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:23:16,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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 29 letters. Loop has 29 letters. [2022-02-21 03:23:16,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:23:16,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:23:16,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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 11 letters. Loop has 11 letters. [2022-02-21 03:23:16,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:23:16,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:23:16,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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:23:16,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:16,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:16,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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 3 letters. Loop has 3 letters. [2022-02-21 03:23:16,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:23:16,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:23:16,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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 6 letters. Loop has 5 letters. [2022-02-21 03:23:16,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:23:16,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:23:16,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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 3 letters. [2022-02-21 03:23:16,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:23:16,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:23:16,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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 2 letters. Loop has 3 letters. [2022-02-21 03:23:16,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:16,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:16,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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 4 letters. [2022-02-21 03:23:16,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:23:16,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:23:16,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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 2 letters. Loop has 1 letters. [2022-02-21 03:23:16,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:23:16,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:23:16,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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:23:16,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:23:16,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:23:16,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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 6 letters. Loop has 3 letters. [2022-02-21 03:23:16,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:23:16,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:23:16,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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 6 letters. Loop has 5 letters. [2022-02-21 03:23:16,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:23:16,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:23:16,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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 7 letters. Loop has 3 letters. [2022-02-21 03:23:16,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:23:16,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:23:16,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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 8 letters. Loop has 3 letters. [2022-02-21 03:23:16,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:23:16,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:23:16,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 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 4 letters. [2022-02-21 03:23:16,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:23:16,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:23:16,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,100 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:16,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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:23:16,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2022-02-21 03:23:16,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:16,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:23:16,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:23:16,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:16,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. cyclomatic complexity: 9 [2022-02-21 03:23:16,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:23:16,120 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 13 states and 18 transitions. [2022-02-21 03:23:16,121 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:23:16,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 03:23:16,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2022-02-21 03:23:16,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:23:16,122 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-02-21 03:23:16,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2022-02-21 03:23:16,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-21 03:23:16,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:16,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 18 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 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:23:16,141 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 18 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 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:23:16,142 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 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:23:16,144 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:16,145 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2022-02-21 03:23:16,146 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2022-02-21 03:23:16,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:16,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:16,147 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 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 13 states and 18 transitions. [2022-02-21 03:23:16,148 INFO L87 Difference]: Start difference. First operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 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 13 states and 18 transitions. [2022-02-21 03:23:16,148 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:16,149 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2022-02-21 03:23:16,149 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2022-02-21 03:23:16,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:16,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:16,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:16,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:16,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 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:23:16,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2022-02-21 03:23:16,151 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-02-21 03:23:16,151 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-02-21 03:23:16,152 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:23:16,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2022-02-21 03:23:16,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:23:16,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:16,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:16,154 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:23:16,154 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:23:16,154 INFO L791 eck$LassoCheckResult]: Stem: 273#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 274#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem4#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 279#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 278#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 269#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 270#L20 [2022-02-21 03:23:16,155 INFO L793 eck$LassoCheckResult]: Loop: 270#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 275#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 276#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 281#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 270#L20 [2022-02-21 03:23:16,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:16,155 INFO L85 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2022-02-21 03:23:16,156 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:16,156 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844307839] [2022-02-21 03:23:16,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:16,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:16,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {343#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {343#true} is VALID [2022-02-21 03:23:16,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {343#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem4#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); {345#(and (or (= |ULTIMATE.start_main_~x3~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|) (and (not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0))) (or (and (= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0) (= |ULTIMATE.start_main_~x0~0#1.offset| |ULTIMATE.start_main_~x3~0#1.offset|)) (not (= |ULTIMATE.start_main_~x3~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))))} is VALID [2022-02-21 03:23:16,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {345#(and (or (= |ULTIMATE.start_main_~x3~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|) (and (not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0))) (or (and (= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0) (= |ULTIMATE.start_main_~x0~0#1.offset| |ULTIMATE.start_main_~x3~0#1.offset|)) (not (= |ULTIMATE.start_main_~x3~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))))} call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); {346#(= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0)} is VALID [2022-02-21 03:23:16,296 INFO L290 TraceCheckUtils]: 3: Hoare triple {346#(= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0)} assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); {347#(= |ULTIMATE.start_main_#t~mem5#1| 0)} is VALID [2022-02-21 03:23:16,296 INFO L290 TraceCheckUtils]: 4: Hoare triple {347#(= |ULTIMATE.start_main_#t~mem5#1| 0)} assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); {344#false} is VALID [2022-02-21 03:23:16,297 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:23:16,297 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:16,297 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844307839] [2022-02-21 03:23:16,298 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844307839] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:23:16,298 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:23:16,298 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:23:16,298 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625584931] [2022-02-21 03:23:16,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:23:16,300 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:23:16,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:16,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 1 times [2022-02-21 03:23:16,301 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:16,301 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330402558] [2022-02-21 03:23:16,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:16,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:16,308 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:16,313 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:16,414 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:23:16,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:23:16,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:23:16,417 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 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:23:16,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:16,511 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-02-21 03:23:16,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:23:16,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 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:23:16,517 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:23:16,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2022-02-21 03:23:16,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:23:16,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 15 states and 19 transitions. [2022-02-21 03:23:16,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 03:23:16,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 03:23:16,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2022-02-21 03:23:16,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:23:16,519 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-02-21 03:23:16,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2022-02-21 03:23:16,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2022-02-21 03:23:16,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:16,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 19 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:16,520 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 19 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:16,520 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:16,521 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:16,521 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2022-02-21 03:23:16,521 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2022-02-21 03:23:16,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:16,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:16,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states and 19 transitions. [2022-02-21 03:23:16,522 INFO L87 Difference]: Start difference. First operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states and 19 transitions. [2022-02-21 03:23:16,522 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:16,523 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2022-02-21 03:23:16,523 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2022-02-21 03:23:16,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:16,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:16,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:16,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:16,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:16,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2022-02-21 03:23:16,525 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:23:16,525 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:23:16,525 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:23:16,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:23:16,525 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:23:16,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:16,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:16,525 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2022-02-21 03:23:16,525 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:23:16,526 INFO L791 eck$LassoCheckResult]: Stem: 373#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 374#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem4#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 375#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 376#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 371#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 372#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 377#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 369#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 370#L20 [2022-02-21 03:23:16,526 INFO L793 eck$LassoCheckResult]: Loop: 370#L20 assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); 378#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 380#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 381#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 370#L20 [2022-02-21 03:23:16,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:16,526 INFO L85 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2022-02-21 03:23:16,526 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:16,526 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300611784] [2022-02-21 03:23:16,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:16,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:16,563 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:16,587 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:16,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:16,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 2 times [2022-02-21 03:23:16,589 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:16,589 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571831336] [2022-02-21 03:23:16,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:16,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:16,596 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:16,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:16,600 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:16,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:16,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1467212285, now seen corresponding path program 1 times [2022-02-21 03:23:16,600 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:16,600 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747935468] [2022-02-21 03:23:16,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:16,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:16,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {461#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {461#true} is VALID [2022-02-21 03:23:16,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {461#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem4#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); {463#(not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))} is VALID [2022-02-21 03:23:16,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {463#(not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))} call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); {463#(not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))} is VALID [2022-02-21 03:23:16,700 INFO L290 TraceCheckUtils]: 3: Hoare triple {463#(not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))} assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); {463#(not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))} is VALID [2022-02-21 03:23:16,700 INFO L290 TraceCheckUtils]: 4: Hoare triple {463#(not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))} assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); {464#(or (not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0))} is VALID [2022-02-21 03:23:16,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {464#(or (not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0))} call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); {464#(or (not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0))} is VALID [2022-02-21 03:23:16,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {464#(or (not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0))} assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); {465#(or (= |ULTIMATE.start_main_#t~mem5#1| 0) (not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)))} is VALID [2022-02-21 03:23:16,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {465#(or (= |ULTIMATE.start_main_#t~mem5#1| 0) (not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)))} assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); {466#(and (not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0))} is VALID [2022-02-21 03:23:16,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {466#(and (not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); {467#(= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0)} is VALID [2022-02-21 03:23:16,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {467#(= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0)} call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); {467#(= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0)} is VALID [2022-02-21 03:23:16,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {467#(= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0)} assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); {468#(= |ULTIMATE.start_main_#t~mem5#1| 0)} is VALID [2022-02-21 03:23:16,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {468#(= |ULTIMATE.start_main_#t~mem5#1| 0)} assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); {462#false} is VALID [2022-02-21 03:23:16,705 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:16,705 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:16,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747935468] [2022-02-21 03:23:16,705 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747935468] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:23:16,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813384360] [2022-02-21 03:23:16,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:16,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:23:16,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:16,706 INFO L229 MonitoredProcess]: Starting monitored process 16 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:23:16,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-02-21 03:23:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:16,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-21 03:23:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:16,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:16,816 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 10 treesize of output 8 [2022-02-21 03:23:16,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-21 03:23:16,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-21 03:23:16,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-02-21 03:23:16,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {461#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {461#true} is VALID [2022-02-21 03:23:16,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {461#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem4#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); {463#(not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))} is VALID [2022-02-21 03:23:16,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {463#(not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))} call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); {463#(not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))} is VALID [2022-02-21 03:23:16,924 INFO L290 TraceCheckUtils]: 3: Hoare triple {463#(not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))} assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); {463#(not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))} is VALID [2022-02-21 03:23:16,925 INFO L290 TraceCheckUtils]: 4: Hoare triple {463#(not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))} assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); {463#(not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))} is VALID [2022-02-21 03:23:16,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {463#(not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))} call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); {463#(not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))} is VALID [2022-02-21 03:23:16,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {463#(not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))} assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); {463#(not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))} is VALID [2022-02-21 03:23:16,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {463#(not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))} assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); {466#(and (not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0))} is VALID [2022-02-21 03:23:16,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {466#(and (not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); {467#(= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0)} is VALID [2022-02-21 03:23:16,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {467#(= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0)} call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); {467#(= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0)} is VALID [2022-02-21 03:23:16,927 INFO L290 TraceCheckUtils]: 10: Hoare triple {467#(= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0)} assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); {468#(= |ULTIMATE.start_main_#t~mem5#1| 0)} is VALID [2022-02-21 03:23:16,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {468#(= |ULTIMATE.start_main_#t~mem5#1| 0)} assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); {462#false} is VALID [2022-02-21 03:23:16,928 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-21 03:23:16,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:23:16,944 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_351) |c_ULTIMATE.start_main_~x0~0#1.base|) |c_ULTIMATE.start_main_~x0~0#1.offset|) 0)) is different from false [2022-02-21 03:23:16,959 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 03:23:16,959 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 1 case distinctions, treesize of input 18 treesize of output 19 [2022-02-21 03:23:16,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 22 [2022-02-21 03:23:16,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {468#(= |ULTIMATE.start_main_#t~mem5#1| 0)} assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); {462#false} is VALID [2022-02-21 03:23:16,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {467#(= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0)} assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); {468#(= |ULTIMATE.start_main_#t~mem5#1| 0)} is VALID [2022-02-21 03:23:16,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {467#(= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0)} call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); {467#(= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0)} is VALID [2022-02-21 03:23:16,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {514#(forall ((v_ArrVal_351 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_351) |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0))} assume 0 == main_#t~mem6#1;havoc main_#t~mem6#1;call write~int(1, main_~x1~0#1.base, main_~x1~0#1.offset, 4); {467#(= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0)} is VALID [2022-02-21 03:23:16,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {463#(not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))} assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); {514#(forall ((v_ArrVal_351 (Array Int Int))) (= (select (select (store |#memory_int| |ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_351) |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0))} is VALID [2022-02-21 03:23:16,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {463#(not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))} assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); {463#(not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))} is VALID [2022-02-21 03:23:16,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {463#(not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))} call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); {463#(not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))} is VALID [2022-02-21 03:23:16,996 INFO L290 TraceCheckUtils]: 4: Hoare triple {463#(not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))} assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); {463#(not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))} is VALID [2022-02-21 03:23:16,996 INFO L290 TraceCheckUtils]: 3: Hoare triple {463#(not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))} assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); {463#(not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))} is VALID [2022-02-21 03:23:16,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {463#(not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))} call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); {463#(not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))} is VALID [2022-02-21 03:23:16,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {461#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem4#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); {463#(not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))} is VALID [2022-02-21 03:23:16,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {461#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {461#true} is VALID [2022-02-21 03:23:16,998 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-21 03:23:16,998 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813384360] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:23:16,998 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:23:16,998 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2022-02-21 03:23:16,998 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640512606] [2022-02-21 03:23:16,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:23:17,103 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:23:17,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 03:23:17,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=36, Unknown=1, NotChecked=12, Total=72 [2022-02-21 03:23:17,105 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 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:23:17,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:17,181 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2022-02-21 03:23:17,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:23:17,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 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:23:17,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:17,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2022-02-21 03:23:17,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:23:17,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 22 transitions. [2022-02-21 03:23:17,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-02-21 03:23:17,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-02-21 03:23:17,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2022-02-21 03:23:17,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:23:17,195 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-02-21 03:23:17,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2022-02-21 03:23:17,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2022-02-21 03:23:17,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:17,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 22 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:23:17,203 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 22 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:23:17,203 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:23:17,204 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:17,204 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2022-02-21 03:23:17,204 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-02-21 03:23:17,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:17,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:17,205 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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 18 states and 22 transitions. [2022-02-21 03:23:17,205 INFO L87 Difference]: Start difference. First operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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 18 states and 22 transitions. [2022-02-21 03:23:17,205 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:17,206 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2022-02-21 03:23:17,206 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-02-21 03:23:17,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:17,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:17,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:17,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:17,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 15 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:23:17,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2022-02-21 03:23:17,207 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-02-21 03:23:17,207 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-02-21 03:23:17,207 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:23:17,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2022-02-21 03:23:17,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-02-21 03:23:17,208 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:17,208 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:17,208 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2022-02-21 03:23:17,208 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:23:17,209 INFO L791 eck$LassoCheckResult]: Stem: 561#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 562#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem4#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); 567#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 564#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 559#L16 assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); 560#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 565#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 571#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 568#L20 [2022-02-21 03:23:17,209 INFO L793 eck$LassoCheckResult]: Loop: 568#L20 assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 570#L24 assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 558#L24-2 call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); 563#L15-1 assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); 572#L16 assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 568#L20 [2022-02-21 03:23:17,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:17,209 INFO L85 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 2 times [2022-02-21 03:23:17,210 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:17,210 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595196881] [2022-02-21 03:23:17,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:17,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:17,261 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:17,277 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:17,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:17,278 INFO L85 PathProgramCache]: Analyzing trace with hash 49698504, now seen corresponding path program 1 times [2022-02-21 03:23:17,278 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:17,278 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101064666] [2022-02-21 03:23:17,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:17,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:17,290 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:17,295 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:17,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:17,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1758681084, now seen corresponding path program 1 times [2022-02-21 03:23:17,295 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:17,295 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718425975] [2022-02-21 03:23:17,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:17,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:17,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {664#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {664#true} is VALID [2022-02-21 03:23:17,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {664#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc0#1.base, main_#t~malloc0#1.offset, main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem4#1, main_~x0~0#1.base, main_~x0~0#1.offset, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset, main_~x3~0#1.base, main_~x3~0#1.offset;call main_#t~malloc0#1.base, main_#t~malloc0#1.offset := #Ultimate.allocOnStack(4);main_~x0~0#1.base, main_~x0~0#1.offset := main_#t~malloc0#1.base, main_#t~malloc0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x3~0#1.base, main_~x3~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int(0, main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int(0, main_~x3~0#1.base, main_~x3~0#1.offset, 4); {666#(and (not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)) (not (= |ULTIMATE.start_main_~x2~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)))} is VALID [2022-02-21 03:23:17,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {666#(and (not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)) (not (= |ULTIMATE.start_main_~x2~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)))} call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); {666#(and (not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)) (not (= |ULTIMATE.start_main_~x2~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)))} is VALID [2022-02-21 03:23:17,391 INFO L290 TraceCheckUtils]: 3: Hoare triple {666#(and (not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)) (not (= |ULTIMATE.start_main_~x2~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)))} assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); {666#(and (not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)) (not (= |ULTIMATE.start_main_~x2~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)))} is VALID [2022-02-21 03:23:17,392 INFO L290 TraceCheckUtils]: 4: Hoare triple {666#(and (not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)) (not (= |ULTIMATE.start_main_~x2~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)))} assume 0 == main_#t~mem5#1;havoc main_#t~mem5#1;call write~int(1, main_~x0~0#1.base, main_~x0~0#1.offset, 4); {667#(or (and (not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)) (not (= |ULTIMATE.start_main_~x2~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))) (= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0))} is VALID [2022-02-21 03:23:17,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {667#(or (and (not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)) (not (= |ULTIMATE.start_main_~x2~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))) (= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0))} call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); {667#(or (and (not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)) (not (= |ULTIMATE.start_main_~x2~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))) (= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0))} is VALID [2022-02-21 03:23:17,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {667#(or (and (not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)) (not (= |ULTIMATE.start_main_~x2~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))) (= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0))} assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); {668#(or (and (not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)) (not (= |ULTIMATE.start_main_~x2~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))) (= |ULTIMATE.start_main_#t~mem5#1| 0))} is VALID [2022-02-21 03:23:17,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {668#(or (and (not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)) (not (= |ULTIMATE.start_main_~x2~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|))) (= |ULTIMATE.start_main_#t~mem5#1| 0))} assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); {669#(and (not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)) (not (= |ULTIMATE.start_main_~x2~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0))} is VALID [2022-02-21 03:23:17,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {669#(and (not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)) (not (= |ULTIMATE.start_main_~x2~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0))} assume !(0 == main_#t~mem6#1);havoc main_#t~mem6#1;call write~int(0, main_~x1~0#1.base, main_~x1~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~x2~0#1.base, main_~x2~0#1.offset, 4); {669#(and (not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)) (not (= |ULTIMATE.start_main_~x2~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0))} is VALID [2022-02-21 03:23:17,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {669#(and (not (= |ULTIMATE.start_main_~x1~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)) (not (= |ULTIMATE.start_main_~x2~0#1.base| |ULTIMATE.start_main_~x0~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0))} assume 0 == main_#t~mem7#1;havoc main_#t~mem7#1;call write~int(1, main_~x2~0#1.base, main_~x2~0#1.offset, 4); {670#(= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0)} is VALID [2022-02-21 03:23:17,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {670#(= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0)} call main_#t~mem4#1 := read~int(main_~x3~0#1.base, main_~x3~0#1.offset, 4); {670#(= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0)} is VALID [2022-02-21 03:23:17,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {670#(= (select (select |#memory_int| |ULTIMATE.start_main_~x0~0#1.base|) |ULTIMATE.start_main_~x0~0#1.offset|) 0)} assume !!(0 == main_#t~mem4#1);havoc main_#t~mem4#1;call main_#t~mem5#1 := read~int(main_~x0~0#1.base, main_~x0~0#1.offset, 4); {671#(= |ULTIMATE.start_main_#t~mem5#1| 0)} is VALID [2022-02-21 03:23:17,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {671#(= |ULTIMATE.start_main_#t~mem5#1| 0)} assume !(0 == main_#t~mem5#1);havoc main_#t~mem5#1;call write~int(0, main_~x0~0#1.base, main_~x0~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~x1~0#1.base, main_~x1~0#1.offset, 4); {665#false} is VALID [2022-02-21 03:23:17,397 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:17,397 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:17,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718425975] [2022-02-21 03:23:17,397 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718425975] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:23:17,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433211498] [2022-02-21 03:23:17,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:17,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:23:17,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:17,420 INFO L229 MonitoredProcess]: Starting monitored process 17 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:23:17,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-02-21 03:23:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:17,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 35 conjunts are in the unsatisfiable core [2022-02-21 03:23:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:17,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:18,440 INFO L356 Elim1Store]: treesize reduction 489, result has 34.5 percent of original size [2022-02-21 03:23:18,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 31 case distinctions, treesize of input 250 treesize of output 1027 [2022-02-21 03:23:18,483 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 46 treesize of output 42 [2022-02-21 03:23:18,554 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 25 treesize of output 24 [2022-02-21 03:23:18,589 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 25 treesize of output 24 [2022-02-21 03:23:18,730 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 5 treesize of output 3 [2022-02-21 03:23:18,886 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 5 treesize of output 3 [2022-02-21 03:23:41,590 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 325 treesize of output 321 [2022-02-21 03:23:42,106 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 81 treesize of output 78 [2022-02-21 03:23:42,237 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 281 treesize of output 277 [2022-02-21 03:23:43,207 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 81 treesize of output 78 [2022-02-21 03:23:44,954 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 8 treesize of output 7 [2022-02-21 03:23:45,799 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 281 treesize of output 277 [2022-02-21 03:23:46,344 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 81 treesize of output 78 [2022-02-21 03:23:47,743 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 45 treesize of output 43 [2022-02-21 03:23:47,799 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 81 treesize of output 78 [2022-02-21 03:23:48,173 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 358 treesize of output 354 [2022-02-21 03:23:56,420 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-02-21 03:23:56,543 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-02-21 03:23:56,571 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-02-21 03:23:56,691 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-02-21 03:23:56,930 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-02-21 03:23:56,957 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-02-21 03:23:57,079 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-02-21 03:23:57,386 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 350 treesize of output 403 [2022-02-21 03:23:58,100 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 36 treesize of output 35 [2022-02-21 03:23:58,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:23:58,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 1 [2022-02-21 03:24:07,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19156 treesize of output 18984