/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-MCRwithDepranks-Lazy-wrwc.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-820ea7a [2022-02-19 17:21:50,381 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-19 17:21:50,382 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-19 17:21:50,446 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-19 17:21:50,447 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-19 17:21:50,447 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-19 17:21:50,448 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-19 17:21:50,450 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-19 17:21:50,451 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-19 17:21:50,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-19 17:21:50,452 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-19 17:21:50,452 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-19 17:21:50,453 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-19 17:21:50,453 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-19 17:21:50,454 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-19 17:21:50,455 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-19 17:21:50,455 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-19 17:21:50,456 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-19 17:21:50,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-19 17:21:50,458 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-19 17:21:50,459 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-19 17:21:50,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-19 17:21:50,460 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-19 17:21:50,461 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-19 17:21:50,463 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-19 17:21:50,463 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-19 17:21:50,463 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-19 17:21:50,464 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-19 17:21:50,464 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-19 17:21:50,465 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-19 17:21:50,465 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-19 17:21:50,465 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-19 17:21:50,466 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-19 17:21:50,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-19 17:21:50,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-19 17:21:50,467 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-19 17:21:50,467 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-19 17:21:50,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-19 17:21:50,468 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-19 17:21:50,468 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-19 17:21:50,469 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-19 17:21:50,471 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-MCRwithDepranks-Lazy-wrwc.epf [2022-02-19 17:21:50,488 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-19 17:21:50,489 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-19 17:21:50,489 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-19 17:21:50,489 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-19 17:21:50,490 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-19 17:21:50,490 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-19 17:21:50,490 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-19 17:21:50,490 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-19 17:21:50,490 INFO L138 SettingsManager]: * Use SBE=true [2022-02-19 17:21:50,490 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-19 17:21:50,490 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-19 17:21:50,491 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-19 17:21:50,491 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-19 17:21:50,491 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-19 17:21:50,491 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-19 17:21:50,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-19 17:21:50,491 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-19 17:21:50,491 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-19 17:21:50,491 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-19 17:21:50,491 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-19 17:21:50,491 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-19 17:21:50,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-19 17:21:50,492 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-19 17:21:50,492 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-19 17:21:50,492 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-19 17:21:50,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-19 17:21:50,492 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-19 17:21:50,492 INFO L138 SettingsManager]: * Construct finite automaton lazily=true [2022-02-19 17:21:50,492 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-19 17:21:50,492 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-19 17:21:50,492 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-19 17:21:50,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-19 17:21:50,492 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-19 17:21:50,492 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-02-19 17:21:50,493 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-19 17:21:50,493 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=MCR_WITH_DEPRANKS [2022-02-19 17:21:50,493 INFO L138 SettingsManager]: * MCR: Overapproximate write-read-write conflicts=false [2022-02-19 17:21:50,493 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-02-19 17:21:50,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-19 17:21:50,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-19 17:21:50,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-19 17:21:50,720 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-19 17:21:50,723 INFO L275 PluginConnector]: CDTParser initialized [2022-02-19 17:21:50,724 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack-2.i [2022-02-19 17:21:50,769 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bba5c719d/fb3123f934e14712b00ee128b9725b21/FLAGbba7a7c77 [2022-02-19 17:21:51,189 INFO L306 CDTParser]: Found 1 translation units. [2022-02-19 17:21:51,190 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-2.i [2022-02-19 17:21:51,207 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bba5c719d/fb3123f934e14712b00ee128b9725b21/FLAGbba7a7c77 [2022-02-19 17:21:51,541 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bba5c719d/fb3123f934e14712b00ee128b9725b21 [2022-02-19 17:21:51,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-19 17:21:51,546 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-19 17:21:51,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-19 17:21:51,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-19 17:21:51,550 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-19 17:21:51,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 05:21:51" (1/1) ... [2022-02-19 17:21:51,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28a06b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:21:51, skipping insertion in model container [2022-02-19 17:21:51,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 05:21:51" (1/1) ... [2022-02-19 17:21:51,556 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-19 17:21:51,594 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-19 17:21:51,917 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-2.i[41520,41533] [2022-02-19 17:21:51,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-19 17:21:51,954 INFO L203 MainTranslator]: Completed pre-run [2022-02-19 17:21:51,974 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-2.i[41520,41533] [2022-02-19 17:21:51,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-19 17:21:52,012 INFO L208 MainTranslator]: Completed translation [2022-02-19 17:21:52,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:21:52 WrapperNode [2022-02-19 17:21:52,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-19 17:21:52,014 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-19 17:21:52,014 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-19 17:21:52,014 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-19 17:21:52,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:21:52" (1/1) ... [2022-02-19 17:21:52,031 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:21:52" (1/1) ... [2022-02-19 17:21:52,051 INFO L137 Inliner]: procedures = 277, calls = 46, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 161 [2022-02-19 17:21:52,051 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-19 17:21:52,052 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-19 17:21:52,052 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-19 17:21:52,052 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-19 17:21:52,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:21:52" (1/1) ... [2022-02-19 17:21:52,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:21:52" (1/1) ... [2022-02-19 17:21:52,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:21:52" (1/1) ... [2022-02-19 17:21:52,060 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:21:52" (1/1) ... [2022-02-19 17:21:52,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:21:52" (1/1) ... [2022-02-19 17:21:52,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:21:52" (1/1) ... [2022-02-19 17:21:52,077 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:21:52" (1/1) ... [2022-02-19 17:21:52,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-19 17:21:52,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-19 17:21:52,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-19 17:21:52,081 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-19 17:21:52,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:21:52" (1/1) ... [2022-02-19 17:21:52,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-19 17:21:52,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 17:21:52,122 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-19 17:21:52,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-19 17:21:52,159 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-02-19 17:21:52,160 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-02-19 17:21:52,160 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-02-19 17:21:52,161 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-02-19 17:21:52,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-19 17:21:52,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-19 17:21:52,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-19 17:21:52,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-19 17:21:52,161 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-19 17:21:52,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-19 17:21:52,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-19 17:21:52,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-19 17:21:52,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-19 17:21:52,163 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-19 17:21:52,323 INFO L234 CfgBuilder]: Building ICFG [2022-02-19 17:21:52,325 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-19 17:21:52,579 INFO L275 CfgBuilder]: Performing block encoding [2022-02-19 17:21:52,589 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-19 17:21:52,589 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-19 17:21:52,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 05:21:52 BoogieIcfgContainer [2022-02-19 17:21:52,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-19 17:21:52,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-19 17:21:52,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-19 17:21:52,595 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-19 17:21:52,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 05:21:51" (1/3) ... [2022-02-19 17:21:52,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b925f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 05:21:52, skipping insertion in model container [2022-02-19 17:21:52,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:21:52" (2/3) ... [2022-02-19 17:21:52,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b925f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 05:21:52, skipping insertion in model container [2022-02-19 17:21:52,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 05:21:52" (3/3) ... [2022-02-19 17:21:52,597 INFO L111 eAbstractionObserver]: Analyzing ICFG stack-2.i [2022-02-19 17:21:52,601 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-19 17:21:52,601 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-19 17:21:52,601 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-19 17:21:52,601 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-19 17:21:52,656 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,657 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,657 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,657 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,657 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,657 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,657 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,657 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,658 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,658 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,658 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,658 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,659 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,659 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,659 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,659 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,660 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,660 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,660 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,661 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,661 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,661 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,661 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,661 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,662 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,662 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,663 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,663 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,663 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,663 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,663 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,663 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,664 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,664 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,664 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,664 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,665 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,666 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,666 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,666 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,666 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,666 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,666 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,666 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,667 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,667 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,667 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,667 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,667 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,667 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,668 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,668 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,668 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,668 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,669 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,669 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,669 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,669 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,669 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,669 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,669 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,669 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,670 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,670 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,670 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,670 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,670 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,670 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,670 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,671 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,671 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,671 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,671 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,671 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,671 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,671 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,671 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,672 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,672 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,672 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,673 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,673 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,673 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,674 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,674 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,675 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,676 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,677 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,683 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,683 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,684 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,684 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,684 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,684 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,684 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,684 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,685 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,685 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,685 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,685 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,685 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,686 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,687 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,687 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,687 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,687 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,687 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,687 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,687 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,687 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,688 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,688 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,688 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,688 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,688 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,688 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,688 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,688 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,689 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,689 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,689 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,689 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,689 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,689 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,689 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,689 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,690 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,690 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,690 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,690 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,690 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,690 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,691 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,691 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,691 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,691 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,693 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,694 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,694 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,694 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,694 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,694 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,694 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,694 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,694 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,694 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,695 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,695 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,695 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,695 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,695 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,696 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,697 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,697 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,697 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,697 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,698 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,698 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,698 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,698 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,699 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,699 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,700 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,700 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,700 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,700 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,700 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,700 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,700 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,701 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,701 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,701 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,701 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,701 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,701 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,701 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,701 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,701 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,701 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,701 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,702 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,702 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,702 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,702 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,702 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,702 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,702 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,702 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,702 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,702 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,702 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,702 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,703 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,703 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,703 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,703 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,703 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,703 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,703 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,703 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,703 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,704 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,704 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,704 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,704 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,704 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,706 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,706 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,706 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,706 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,707 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,707 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,707 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,707 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,710 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,710 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,711 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,712 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,712 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,716 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,716 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,716 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,717 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,717 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,717 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,717 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,717 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,717 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,717 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,719 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,719 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,719 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,719 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,719 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,719 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,719 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,720 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,720 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,720 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,720 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,720 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,720 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,720 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,721 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,721 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,721 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,721 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,721 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,721 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,721 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,722 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,722 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,722 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,722 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,723 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,723 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,723 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,723 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,723 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,723 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,724 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,724 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,724 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,724 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,724 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,725 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,727 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,727 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,727 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,727 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,727 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,728 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,728 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,728 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,728 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,728 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,728 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,728 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,729 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,729 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,729 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,729 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,729 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,729 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,729 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,729 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,729 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,729 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,729 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,731 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,732 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,732 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,732 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,732 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,732 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,732 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,732 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,732 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,732 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,732 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,733 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,733 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,733 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,733 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,733 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,733 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,733 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,733 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:21:52,737 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-02-19 17:21:52,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-19 17:21:52,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 17:21:52,789 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-02-19 17:21:52,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-02-19 17:21:52,818 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-19 17:21:52,824 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mLazyFiniteAutomaton=true, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=false [2022-02-19 17:21:52,825 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-02-19 17:21:52,910 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 132 transitions and produced 133 states. [2022-02-19 17:21:52,911 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-19 17:21:52,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:21:52,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1174616020, now seen corresponding path program 1 times [2022-02-19 17:21:52,924 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:21:52,925 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886901438] [2022-02-19 17:21:52,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:21:52,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:21:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:21:53,127 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-19 17:21:53,128 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:21:53,128 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886901438] [2022-02-19 17:21:53,129 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886901438] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 17:21:53,129 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 17:21:53,129 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-19 17:21:53,130 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714778496] [2022-02-19 17:21:53,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 17:21:53,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-19 17:21:53,135 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:21:53,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-19 17:21:53,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-19 17:21:53,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:21:53,161 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:21:53,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.0) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 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-19 17:21:53,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:21:53,210 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 132 transitions and produced 133 states. [2022-02-19 17:21:53,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:21:53,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-19 17:21:53,212 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-19 17:21:53,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:21:53,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1170051021, now seen corresponding path program 1 times [2022-02-19 17:21:53,214 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:21:53,214 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203725084] [2022-02-19 17:21:53,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:21:53,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:21:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:21:53,348 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-19 17:21:53,348 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:21:53,349 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203725084] [2022-02-19 17:21:53,349 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203725084] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 17:21:53,349 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 17:21:53,349 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-19 17:21:53,349 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179908271] [2022-02-19 17:21:53,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 17:21:53,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-19 17:21:53,351 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:21:53,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-19 17:21:53,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-19 17:21:53,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:21:53,352 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:21:53,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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-19 17:21:53,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:21:53,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:21:53,415 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 158 transitions and produced 124 states. [2022-02-19 17:21:53,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:21:53,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:21:53,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-19 17:21:53,416 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-19 17:21:53,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:21:53,419 INFO L85 PathProgramCache]: Analyzing trace with hash 323884447, now seen corresponding path program 1 times [2022-02-19 17:21:53,419 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:21:53,419 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482719184] [2022-02-19 17:21:53,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:21:53,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:21:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:21:53,545 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-19 17:21:53,545 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:21:53,545 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482719184] [2022-02-19 17:21:53,546 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482719184] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 17:21:53,546 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 17:21:53,546 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-19 17:21:53,546 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793066529] [2022-02-19 17:21:53,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 17:21:53,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-19 17:21:53,547 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:21:53,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-19 17:21:53,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-19 17:21:53,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:21:53,547 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:21:53,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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-19 17:21:53,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:21:53,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:21:53,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:21:53,613 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 209 transitions and produced 157 states. [2022-02-19 17:21:53,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:21:53,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:21:53,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:21:53,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-19 17:21:53,615 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-19 17:21:53,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:21:53,616 INFO L85 PathProgramCache]: Analyzing trace with hash 2033537427, now seen corresponding path program 1 times [2022-02-19 17:21:53,616 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:21:53,616 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524750966] [2022-02-19 17:21:53,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:21:53,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:21:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:21:53,676 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-19 17:21:53,676 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:21:53,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524750966] [2022-02-19 17:21:53,677 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524750966] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 17:21:53,677 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 17:21:53,677 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-19 17:21:53,677 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035365491] [2022-02-19 17:21:53,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 17:21:53,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-19 17:21:53,678 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:21:53,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-19 17:21:53,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-19 17:21:53,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:21:53,678 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:21:53,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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-19 17:21:53,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:21:53,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:21:53,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:21:53,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:21:53,718 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 235 transitions and produced 183 states. [2022-02-19 17:21:53,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:21:53,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:21:53,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:21:53,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:21:53,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-19 17:21:53,719 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-19 17:21:53,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:21:53,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1519561133, now seen corresponding path program 1 times [2022-02-19 17:21:53,721 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:21:53,721 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515771582] [2022-02-19 17:21:53,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:21:53,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:21:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:21:53,825 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-19 17:21:53,826 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:21:53,826 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515771582] [2022-02-19 17:21:53,826 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515771582] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 17:21:53,826 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 17:21:53,826 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-19 17:21:53,826 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741791435] [2022-02-19 17:21:53,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 17:21:53,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-19 17:21:53,827 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:21:53,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-19 17:21:53,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-19 17:21:53,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:21:53,828 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:21:53,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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-19 17:21:53,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:21:53,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:21:53,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:21:53,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:21:53,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:21:53,917 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 223 transitions and produced 224 states. [2022-02-19 17:21:53,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:21:53,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:21:53,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:21:53,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:21:53,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-19 17:21:53,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-19 17:21:53,919 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-19 17:21:53,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:21:53,919 INFO L85 PathProgramCache]: Analyzing trace with hash -818256019, now seen corresponding path program 1 times [2022-02-19 17:21:53,920 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:21:53,920 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920625043] [2022-02-19 17:21:53,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:21:53,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:21:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:21:54,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:21:54,027 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:21:54,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920625043] [2022-02-19 17:21:54,027 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920625043] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-19 17:21:54,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511182147] [2022-02-19 17:21:54,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:21:54,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:21:54,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 17:21:54,030 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-19 17:21:54,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-19 17:21:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:21:54,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-19 17:21:54,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-19 17:21:54,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:21:54,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-19 17:21:54,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:21:54,681 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511182147] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-19 17:21:54,681 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-19 17:21:54,681 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-19 17:21:54,681 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557042948] [2022-02-19 17:21:54,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-19 17:21:54,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-19 17:21:54,682 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:21:54,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-19 17:21:54,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-19 17:21:54,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:21:54,682 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:21:54,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.3) internal successors, (213), 10 states have internal predecessors, (213), 0 states have call successors, (0), 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-19 17:21:54,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:21:54,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:21:54,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:21:54,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:21:54,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-19 17:21:54,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:21:58,587 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 394 transitions and produced 289 states. [2022-02-19 17:21:58,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:21:58,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:21:58,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:21:58,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:21:58,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-19 17:21:58,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-19 17:21:58,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-19 17:21:58,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-02-19 17:21:58,792 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-19 17:21:58,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:21:58,792 INFO L85 PathProgramCache]: Analyzing trace with hash 148992281, now seen corresponding path program 1 times [2022-02-19 17:21:58,793 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:21:58,793 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894250736] [2022-02-19 17:21:58,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:21:58,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:21:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:21:58,882 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:21:58,882 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:21:58,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894250736] [2022-02-19 17:21:58,883 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894250736] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-19 17:21:58,883 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131022593] [2022-02-19 17:21:58,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:21:58,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:21:58,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 17:21:58,884 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-19 17:21:58,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-19 17:21:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:21:59,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-19 17:21:59,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-19 17:21:59,179 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:21:59,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-19 17:21:59,347 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:21:59,348 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131022593] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-19 17:21:59,348 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-19 17:21:59,348 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-19 17:21:59,348 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696632975] [2022-02-19 17:21:59,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-19 17:21:59,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-19 17:21:59,350 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:21:59,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-19 17:21:59,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-19 17:21:59,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:21:59,351 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:21:59,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.9) internal successors, (279), 10 states have internal predecessors, (279), 0 states have call successors, (0), 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-19 17:21:59,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:21:59,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:21:59,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:21:59,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:21:59,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-19 17:21:59,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-19 17:21:59,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:22:13,374 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 687 transitions and produced 529 states. [2022-02-19 17:22:13,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:22:13,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:22:13,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:22:13,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:22:13,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-19 17:22:13,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:22:13,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:22:13,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-19 17:22:13,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:22:13,576 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-19 17:22:13,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:22:13,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1058312109, now seen corresponding path program 2 times [2022-02-19 17:22:13,576 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:22:13,577 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664090060] [2022-02-19 17:22:13,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:22:13,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:22:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:22:13,708 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:22:13,709 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:22:13,709 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664090060] [2022-02-19 17:22:13,710 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664090060] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-19 17:22:13,710 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287505473] [2022-02-19 17:22:13,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-19 17:22:13,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:22:13,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 17:22:13,712 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-19 17:22:13,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-19 17:22:13,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-19 17:22:13,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-19 17:22:13,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-19 17:22:13,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-19 17:22:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:22:14,234 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-19 17:22:14,234 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287505473] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 17:22:14,234 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-19 17:22:14,234 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2022-02-19 17:22:14,235 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106749085] [2022-02-19 17:22:14,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 17:22:14,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-19 17:22:14,235 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:22:14,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-19 17:22:14,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-02-19 17:22:14,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:22:14,236 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:22:14,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 19.181818181818183) internal successors, (211), 11 states have internal predecessors, (211), 0 states have call successors, (0), 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-19 17:22:14,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:22:14,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:22:14,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:22:14,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:22:14,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-19 17:22:14,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:22:14,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:22:14,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:22:30,600 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 715 transitions and produced 557 states. [2022-02-19 17:22:30,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:22:30,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:22:30,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:22:30,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:22:30,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-19 17:22:30,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:22:30,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:22:30,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:22:30,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-19 17:22:30,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:22:30,813 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-19 17:22:30,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:22:30,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1593386593, now seen corresponding path program 1 times [2022-02-19 17:22:30,814 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:22:30,814 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445012499] [2022-02-19 17:22:30,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:22:30,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:22:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:22:30,942 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:22:30,942 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:22:30,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445012499] [2022-02-19 17:22:30,942 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445012499] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-19 17:22:30,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934017666] [2022-02-19 17:22:30,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:22:30,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:22:30,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 17:22:30,944 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-19 17:22:30,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-19 17:22:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:22:31,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-19 17:22:31,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-19 17:22:31,351 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:22:31,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-19 17:22:31,604 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:22:31,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934017666] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-19 17:22:31,605 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-19 17:22:31,605 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-02-19 17:22:31,605 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205246595] [2022-02-19 17:22:31,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-19 17:22:31,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-19 17:22:31,606 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:22:31,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-19 17:22:31,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-02-19 17:22:31,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:22:31,608 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:22:31,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 24.076923076923077) internal successors, (313), 13 states have internal predecessors, (313), 0 states have call successors, (0), 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-19 17:22:31,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:22:31,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:22:31,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:22:31,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:22:31,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-19 17:22:31,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:22:31,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:22:31,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:22:31,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:22:42,962 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 764 transitions and produced 553 states. [2022-02-19 17:22:42,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:22:42,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:22:42,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:22:42,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:22:42,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-19 17:22:42,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:22:42,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:22:42,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:22:42,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-19 17:22:42,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-19 17:22:43,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:22:43,179 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-19 17:22:43,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:22:43,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1431502631, now seen corresponding path program 2 times [2022-02-19 17:22:43,180 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:22:43,180 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737554000] [2022-02-19 17:22:43,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:22:43,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:22:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:22:43,303 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 12 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:22:43,304 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:22:43,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737554000] [2022-02-19 17:22:43,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737554000] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-19 17:22:43,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587793933] [2022-02-19 17:22:43,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-19 17:22:43,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:22:43,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 17:22:43,306 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-19 17:22:43,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-19 17:22:43,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-19 17:22:43,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-19 17:22:43,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-19 17:22:43,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-19 17:22:43,762 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 12 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:22:43,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-19 17:22:44,108 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 12 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:22:44,108 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587793933] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-19 17:22:44,109 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-19 17:22:44,109 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-02-19 17:22:44,109 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085434118] [2022-02-19 17:22:44,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-19 17:22:44,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-19 17:22:44,113 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:22:44,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-19 17:22:44,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-02-19 17:22:44,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:22:44,116 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:22:44,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 26.76923076923077) internal successors, (348), 13 states have internal predecessors, (348), 0 states have call successors, (0), 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-19 17:22:44,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:22:44,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:22:44,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:22:44,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:22:44,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-19 17:22:44,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:22:44,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:22:44,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:22:44,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-19 17:22:44,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:23:07,904 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1085 transitions and produced 821 states. [2022-02-19 17:23:07,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:23:07,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:23:07,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:23:07,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:23:07,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-19 17:23:07,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:23:07,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:23:07,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:23:07,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:23:07,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:23:07,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-19 17:23:08,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:23:08,120 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-19 17:23:08,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:23:08,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1603129695, now seen corresponding path program 2 times [2022-02-19 17:23:08,120 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:23:08,120 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410956060] [2022-02-19 17:23:08,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:23:08,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:23:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:23:09,101 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:23:09,102 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:23:09,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410956060] [2022-02-19 17:23:09,102 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410956060] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-19 17:23:09,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245498595] [2022-02-19 17:23:09,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-19 17:23:09,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:23:09,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 17:23:09,105 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-19 17:23:09,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-19 17:23:09,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-19 17:23:09,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-19 17:23:09,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 55 conjunts are in the unsatisfiable core [2022-02-19 17:23:09,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-19 17:23:10,196 INFO L387 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-02-19 17:23:11,176 INFO L387 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 63 treesize of output 23 [2022-02-19 17:23:11,362 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2022-02-19 17:23:11,362 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-19 17:23:11,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245498595] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 17:23:11,363 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-19 17:23:11,363 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [32] total 52 [2022-02-19 17:23:11,363 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916387560] [2022-02-19 17:23:11,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 17:23:11,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-19 17:23:11,363 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:23:11,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-19 17:23:11,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2522, Unknown=0, NotChecked=0, Total=2652 [2022-02-19 17:23:11,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:23:11,365 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:23:11,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.6521739130434785) internal successors, (176), 23 states have internal predecessors, (176), 0 states have call successors, (0), 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-19 17:23:11,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:23:11,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:23:11,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:23:11,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:23:11,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-19 17:23:11,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:23:11,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:23:11,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:23:11,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:23:11,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:23:11,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:23:41,688 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1144 transitions and produced 880 states. [2022-02-19 17:23:41,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:23:41,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:23:41,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:23:41,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:23:41,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-19 17:23:41,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:23:41,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:23:41,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:23:41,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:23:41,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:23:41,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-02-19 17:23:41,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-19 17:23:41,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:23:41,892 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-19 17:23:41,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:23:41,892 INFO L85 PathProgramCache]: Analyzing trace with hash 390942809, now seen corresponding path program 1 times [2022-02-19 17:23:41,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:23:41,892 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375281806] [2022-02-19 17:23:41,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:23:41,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:23:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:23:42,096 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 318 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:23:42,097 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:23:42,097 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375281806] [2022-02-19 17:23:42,097 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375281806] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-19 17:23:42,097 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986069615] [2022-02-19 17:23:42,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:23:42,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:23:42,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 17:23:42,108 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-19 17:23:42,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-19 17:23:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:23:42,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-19 17:23:42,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-19 17:23:42,786 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 439 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:23:42,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-19 17:23:43,367 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 439 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:23:43,367 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986069615] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-19 17:23:43,367 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-19 17:23:43,367 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 27 [2022-02-19 17:23:43,367 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450674071] [2022-02-19 17:23:43,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-19 17:23:43,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-19 17:23:43,368 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:23:43,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-19 17:23:43,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2022-02-19 17:23:43,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:23:43,369 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:23:43,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 23.62962962962963) internal successors, (638), 27 states have internal predecessors, (638), 0 states have call successors, (0), 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-19 17:23:43,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:23:43,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:23:43,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:23:43,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:23:43,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-19 17:23:43,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:23:43,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:23:43,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:23:43,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:23:43,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:23:43,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-02-19 17:23:43,371 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:24:10,500 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1172 transitions and produced 908 states. [2022-02-19 17:24:10,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:24:10,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:24:10,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:24:10,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:24:10,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-19 17:24:10,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:24:10,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:24:10,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:24:10,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:24:10,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:24:10,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-02-19 17:24:10,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-19 17:24:10,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-19 17:24:10,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-02-19 17:24:10,707 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-19 17:24:10,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:24:10,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1682786829, now seen corresponding path program 1 times [2022-02-19 17:24:10,707 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:24:10,707 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132831864] [2022-02-19 17:24:10,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:24:10,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:24:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:24:11,813 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 0 proven. 472 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:24:11,813 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:24:11,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132831864] [2022-02-19 17:24:11,814 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132831864] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-19 17:24:11,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444783311] [2022-02-19 17:24:11,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:24:11,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:24:11,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 17:24:11,815 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-19 17:24:11,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-19 17:24:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:24:11,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 73 conjunts are in the unsatisfiable core [2022-02-19 17:24:11,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-19 17:24:12,826 INFO L387 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-02-19 17:24:13,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-19 17:24:13,738 INFO L387 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 71 treesize of output 43 [2022-02-19 17:24:15,148 INFO L387 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 63 treesize of output 23 [2022-02-19 17:24:15,375 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 248 proven. 74 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-02-19 17:24:15,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-19 17:24:18,404 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_58| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_58|)) (forall ((v_ArrVal_589 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| 4)) v_ArrVal_589)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) is different from false [2022-02-19 17:24:25,832 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_58| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_42| Int) (v_ArrVal_589 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_42|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_42| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| 4)) v_ArrVal_589)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)))) is different from false [2022-02-19 17:24:34,986 INFO L387 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 54 treesize of output 46 [2022-02-19 17:24:35,769 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 248 proven. 70 refuted. 0 times theorem prover too weak. 150 trivial. 4 not checked. [2022-02-19 17:24:35,770 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444783311] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-19 17:24:35,770 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-19 17:24:35,770 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 30, 29] total 91 [2022-02-19 17:24:35,770 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759388067] [2022-02-19 17:24:35,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-19 17:24:35,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-02-19 17:24:35,771 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:24:35,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-02-19 17:24:35,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=7534, Unknown=8, NotChecked=350, Total=8190 [2022-02-19 17:24:35,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:24:35,773 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:24:35,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 9.31868131868132) internal successors, (848), 91 states have internal predecessors, (848), 0 states have call successors, (0), 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-19 17:24:35,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:24:35,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:24:35,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:24:35,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:24:35,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-19 17:24:35,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:24:35,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:24:35,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:24:35,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:24:35,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:24:35,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-02-19 17:24:35,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-02-19 17:24:35,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:24:42,055 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse2 (not .cse1)) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) .cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 1 c_~top~0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse2) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_58| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_42| Int) (v_ArrVal_589 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_42|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_42| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| 4)) v_ArrVal_589)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse2)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-02-19 17:24:42,724 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (<= c_~top~0 1) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 1 c_~top~0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_58| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_42| Int) (v_ArrVal_589 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_42|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_42| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| 4)) v_ArrVal_589)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)))) is different from false [2022-02-19 17:24:45,556 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_58| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_58|)) (forall ((v_ArrVal_589 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| 4)) v_ArrVal_589)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 1 c_~top~0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)))) is different from false [2022-02-19 17:24:51,280 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse3 (not .cse2)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (<= c_~top~0 2) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_58| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_42| Int) (v_ArrVal_589 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_42|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_42| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| 4)) v_ArrVal_589)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 2 c_~top~0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse3)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-02-19 17:24:51,919 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (<= c_~top~0 2) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_58| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_42| Int) (v_ArrVal_589 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_42|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_42| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| 4)) v_ArrVal_589)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 2 c_~top~0) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)))) is different from false [2022-02-19 17:24:54,683 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_58| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_58|)) (forall ((v_ArrVal_589 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| 4)) v_ArrVal_589)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 2 c_~top~0) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)))) is different from false [2022-02-19 17:25:00,262 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse3 (not .cse2)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= |c_t1Thread1of1ForFork0_~tmp~0#1| (+ (* (div |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 4294967296) 4)) (< .cse1 4294967296) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_58| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_42| Int) (v_ArrVal_589 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_42|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_42| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| 4)) v_ArrVal_589)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 4) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse3)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-02-19 17:25:00,871 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_58| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_42| Int) (v_ArrVal_589 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_42|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_42| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| 4)) v_ArrVal_589)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 4) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 3 c_~top~0) (<= c_~top~0 3))) is different from false [2022-02-19 17:25:03,602 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (<= 3 |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_58| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_58|)) (forall ((v_ArrVal_589 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| 4)) v_ArrVal_589)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= |c_t1Thread1of1ForFork0_get_top_#res#1| 3) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 4) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 3 c_~top~0) (<= c_~top~0 3) (<= |c_t1Thread1of1ForFork0_push_~x#1| 4))) is different from false [2022-02-19 17:25:09,123 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse8 (* c_~top~0 4)) (.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse6 (+ |c_~#arr~0.offset| 12))) (let ((.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) .cse6)) (.cse4 (not .cse2)) (.cse0 (select .cse7 (+ |c_~#arr~0.offset| (- 4) .cse8))) (.cse1 (select .cse7 (+ |c_~#arr~0.offset| .cse8 (- 8)))) (.cse5 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) .cse6))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (<= 0 .cse3) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse4) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= 4 c_~top~0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_58| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_42| Int) (v_ArrVal_589 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_42|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_42| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| 4)) v_ArrVal_589)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= .cse3 4) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse4)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse5) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= .cse5 4)))) is different from false [2022-02-19 17:25:09,740 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |c_~#arr~0.offset| 12))) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (<= 0 .cse1) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= c_~top~0 4) (<= 4 c_~top~0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_58| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_42| Int) (v_ArrVal_589 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_42|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_42| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| 4)) v_ArrVal_589)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= .cse1 4) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)))) is different from false [2022-02-19 17:25:12,469 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4)))) (.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 12)))) (and (<= 0 .cse0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_58| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_58|)) (forall ((v_ArrVal_589 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| 4)) v_ArrVal_589)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= 4 c_~top~0) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= .cse1 4) (<= (+ |c_~#arr~0.offset| 16) (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)))) is different from false [2022-02-19 17:25:36,002 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1259 transitions and produced 995 states. [2022-02-19 17:25:36,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:25:36,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:25:36,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:25:36,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:25:36,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-19 17:25:36,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:25:36,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:25:36,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:25:36,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:25:36,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:25:36,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-02-19 17:25:36,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-19 17:25:36,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-02-19 17:25:36,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-19 17:25:36,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-02-19 17:25:36,207 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-19 17:25:36,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:25:36,207 INFO L85 PathProgramCache]: Analyzing trace with hash -995008903, now seen corresponding path program 2 times [2022-02-19 17:25:36,207 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:25:36,208 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014735523] [2022-02-19 17:25:36,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:25:36,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:25:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:25:37,584 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:25:37,585 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:25:37,585 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014735523] [2022-02-19 17:25:37,585 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014735523] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-19 17:25:37,585 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427299299] [2022-02-19 17:25:37,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-19 17:25:37,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:25:37,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 17:25:37,587 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-19 17:25:37,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-19 17:25:37,742 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-19 17:25:37,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-19 17:25:37,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 99 conjunts are in the unsatisfiable core [2022-02-19 17:25:37,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-19 17:25:38,516 INFO L387 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-02-19 17:25:39,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-19 17:25:39,364 INFO L387 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 71 treesize of output 43 [2022-02-19 17:25:40,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-19 17:25:40,220 INFO L387 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 71 treesize of output 43 [2022-02-19 17:25:42,311 INFO L387 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 63 treesize of output 23 [2022-02-19 17:25:42,516 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 261 proven. 233 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-02-19 17:25:42,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-19 17:25:45,843 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (forall ((v_ArrVal_696 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_64|)))) is different from false [2022-02-19 17:26:32,315 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int)) (or (forall ((v_ArrVal_693 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_67|)))) is different from false [2022-02-19 17:26:33,194 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0))) is different from false [2022-02-19 17:26:35,263 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) is different from false [2022-02-19 17:26:47,513 INFO L387 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 54 treesize of output 46 [2022-02-19 17:26:48,337 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 261 proven. 214 refuted. 0 times theorem prover too weak. 57 trivial. 19 not checked. [2022-02-19 17:26:48,337 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427299299] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-19 17:26:48,337 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-19 17:26:48,337 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 39, 36] total 112 [2022-02-19 17:26:48,338 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42450165] [2022-02-19 17:26:48,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-19 17:26:48,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 112 states [2022-02-19 17:26:48,339 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:26:48,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2022-02-19 17:26:48,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=11160, Unknown=28, NotChecked=860, Total=12432 [2022-02-19 17:26:48,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:26:48,342 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:26:48,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 112 states, 112 states have (on average 9.464285714285714) internal successors, (1060), 112 states have internal predecessors, (1060), 0 states have call successors, (0), 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-19 17:26:48,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:26:48,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:26:48,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:26:48,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:26:48,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-19 17:26:48,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:26:48,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:26:48,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:26:48,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:26:48,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:26:48,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-02-19 17:26:48,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-19 17:26:48,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2022-02-19 17:26:48,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:26:54,637 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse2 (not .cse1)) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) .cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 1 c_~top~0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse2) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse2)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-02-19 17:26:55,421 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (<= c_~top~0 1) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 1 c_~top~0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)))) is different from false [2022-02-19 17:26:56,225 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (= |c_~#arr~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0))) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 1 c_~top~0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)))) is different from false [2022-02-19 17:26:56,960 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (= |c_~#arr~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0))) (<= 1 c_~top~0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)))) is different from false [2022-02-19 17:26:59,250 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (<= 1 c_~top~0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int)) (or (forall ((v_ArrVal_693 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_67|)))) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)))) is different from false [2022-02-19 17:27:05,846 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse3 (not .cse2)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= |c_t1Thread1of1ForFork0_~tmp~0#1| (+ (* (div |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 4294967296) 4)) (< .cse1 4294967296) (<= c_~top~0 2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 2 c_~top~0) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 4) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse3)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_push_~x#1| 4)))) is different from false [2022-02-19 17:27:06,640 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse0 (select .cse2 (+ |c_~#arr~0.offset| (- 4) .cse3))) (.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (< .cse1 4294967296) (<= c_~top~0 2) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 2 c_~top~0) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 4) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-02-19 17:27:07,453 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse0 (select .cse2 (+ |c_~#arr~0.offset| (- 4) .cse3))) (.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (<= c_~top~0 2) (= |c_~#arr~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0))) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 2 c_~top~0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 4) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-02-19 17:27:08,189 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse0 (select .cse2 (+ |c_~#arr~0.offset| (- 4) .cse3))) (.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (<= c_~top~0 2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (= |c_~#arr~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0))) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (<= 2 c_~top~0) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (<= |c_t1Thread1of1ForFork0_push_~x#1| 4)))) is different from false [2022-02-19 17:27:10,439 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse0 (select .cse2 (+ |c_~#arr~0.offset| (- 4) .cse3))) (.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (<= |c_t1Thread1of1ForFork0_get_top_#res#1| 2) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (forall ((v_ArrVal_696 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_64|)))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (<= c_~top~0 2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int)) (or (forall ((v_ArrVal_693 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_67|)))) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 2 |c_t1Thread1of1ForFork0_get_top_#res#1|) (<= 2 c_~top~0) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (<= |c_t1Thread1of1ForFork0_push_~x#1| 4)))) is different from false [2022-02-19 17:27:17,478 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse6 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse7 (* c_~top~0 4))) (let ((.cse4 (select .cse6 (+ |c_~#arr~0.offset| .cse7 (- 12)))) (.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse5 (not .cse2)) (.cse0 (select .cse6 (+ |c_~#arr~0.offset| (- 4) .cse7))) (.cse1 (select .cse6 (+ |c_~#arr~0.offset| .cse7 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 .cse3) (< .cse1 4294967296) (< (div .cse4 (- 4294967296)) (+ (div (+ (* (- 1) .cse4) 4) 4294967296) 1)) (< .cse4 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 .cse4) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse5) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= .cse3 4) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse5)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-02-19 17:27:18,236 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (<= 0 .cse2) (< .cse1 4294967296) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-02-19 17:27:18,993 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (<= 0 .cse2) (= |c_~#arr~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0))) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-02-19 17:27:19,732 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (<= 0 .cse2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (= |c_~#arr~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0))) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-02-19 17:27:21,966 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (forall ((v_ArrVal_696 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_64|)))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (<= 0 .cse2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int)) (or (forall ((v_ArrVal_693 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_67|)))) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ |c_~#arr~0.offset| 12) (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-02-19 17:27:29,295 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse7 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse8 (* c_~top~0 4)) (.cse9 (+ |c_~#arr~0.offset| 8))) (let ((.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) .cse9)) (.cse5 (select .cse7 (+ |c_~#arr~0.offset| .cse8 (- 12)))) (.cse4 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) .cse9)) (.cse6 (not .cse2)) (.cse0 (select .cse7 (+ |c_~#arr~0.offset| (- 4) .cse8))) (.cse1 (select .cse7 (+ |c_~#arr~0.offset| .cse8 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse3 4) (<= 0 .cse4) (< .cse1 4294967296) (< (div .cse5 (- 4294967296)) (+ (div (+ (* (- 1) .cse5) 4) 4294967296) 1)) (< .cse5 4294967296) (<= 0 .cse3) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 .cse5) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse6) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (<= 4 c_~top~0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= .cse4 4) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse6)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-02-19 17:27:30,058 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (<= 0 .cse2) (< .cse1 4294967296) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= c_~top~0 4) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (<= 4 c_~top~0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-02-19 17:27:30,866 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (<= 0 .cse2) (= |c_~#arr~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0))) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= 4 c_~top~0) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-02-19 17:27:31,636 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (<= 0 .cse2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (= |c_~#arr~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0))) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= 4 c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1)))) is different from false [2022-02-19 17:27:33,891 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (forall ((v_ArrVal_696 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_64|)))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (<= 0 .cse2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= 4 c_~top~0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int)) (or (forall ((v_ArrVal_693 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_67|)))) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (<= (+ |c_~#arr~0.offset| 16) (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4))))) is different from false [2022-02-19 17:28:10,386 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1318 transitions and produced 1054 states. [2022-02-19 17:28:10,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:28:10,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:28:10,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:28:10,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:28:10,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-19 17:28:10,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:28:10,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:28:10,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:28:10,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:28:10,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:28:10,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-02-19 17:28:10,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-19 17:28:10,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-02-19 17:28:10,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-02-19 17:28:10,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-19 17:28:10,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-02-19 17:28:10,588 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-19 17:28:10,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:28:10,589 INFO L85 PathProgramCache]: Analyzing trace with hash -43463631, now seen corresponding path program 2 times [2022-02-19 17:28:10,589 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:28:10,589 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028287668] [2022-02-19 17:28:10,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:28:10,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:28:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:28:10,815 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 326 proven. 295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:28:10,815 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:28:10,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028287668] [2022-02-19 17:28:10,815 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028287668] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-19 17:28:10,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923757855] [2022-02-19 17:28:10,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-19 17:28:10,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:28:10,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 17:28:10,828 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-19 17:28:10,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-19 17:28:11,005 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-19 17:28:11,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-19 17:28:11,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-19 17:28:11,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-19 17:28:11,632 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 447 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:28:11,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-19 17:28:12,295 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 447 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:28:12,296 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923757855] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-19 17:28:12,296 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-19 17:28:12,297 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 25 [2022-02-19 17:28:12,297 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484225442] [2022-02-19 17:28:12,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-19 17:28:12,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-19 17:28:12,298 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:28:12,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-19 17:28:12,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2022-02-19 17:28:12,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:28:12,299 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:28:12,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 25.0) internal successors, (625), 25 states have internal predecessors, (625), 0 states have call successors, (0), 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-19 17:28:12,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:28:12,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:28:12,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:28:12,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:28:12,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-19 17:28:12,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:28:12,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:28:12,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:28:12,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:28:12,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:28:12,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-02-19 17:28:12,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-19 17:28:12,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2022-02-19 17:28:12,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2022-02-19 17:28:12,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:28:48,110 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1346 transitions and produced 1082 states. [2022-02-19 17:28:48,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:28:48,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:28:48,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:28:48,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:28:48,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-19 17:28:48,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:28:48,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:28:48,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:28:48,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:28:48,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:28:48,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-02-19 17:28:48,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-19 17:28:48,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-02-19 17:28:48,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-02-19 17:28:48,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-02-19 17:28:48,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-02-19 17:28:48,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-02-19 17:28:48,312 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-19 17:28:48,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:28:48,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1012345829, now seen corresponding path program 3 times [2022-02-19 17:28:48,312 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:28:48,312 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387197010] [2022-02-19 17:28:48,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:28:48,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:28:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:28:49,931 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:28:49,931 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:28:49,931 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387197010] [2022-02-19 17:28:49,932 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387197010] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-19 17:28:49,932 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954145017] [2022-02-19 17:28:49,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-19 17:28:49,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:28:49,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 17:28:49,933 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-19 17:28:49,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-19 17:28:50,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-02-19 17:28:50,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-19 17:28:50,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 117 conjunts are in the unsatisfiable core [2022-02-19 17:28:50,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-19 17:28:51,110 INFO L387 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-02-19 17:28:52,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-19 17:28:52,094 INFO L387 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 71 treesize of output 43 [2022-02-19 17:28:53,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-19 17:28:53,028 INFO L387 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 71 treesize of output 43 [2022-02-19 17:28:54,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-19 17:28:54,052 INFO L387 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 71 treesize of output 43 [2022-02-19 17:28:57,021 INFO L387 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 63 treesize of output 23 [2022-02-19 17:28:57,300 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 188 proven. 477 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-19 17:28:57,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-19 17:29:01,141 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_89|)) (forall ((v_ArrVal_919 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| 4)) v_ArrVal_919)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296)))))) is different from false [2022-02-19 17:29:22,864 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_63| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_63|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_63| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| 4)) v_ArrVal_919)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)))) is different from false [2022-02-19 17:29:42,242 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (forall ((v_ArrVal_918 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_92|)))) is different from false [2022-02-19 17:30:57,142 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_95|)) (forall ((v_ArrVal_915 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) is different from false [2022-02-19 17:30:59,171 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| c_~top~0))) is different from false [2022-02-19 17:32:15,458 INFO L387 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 54 treesize of output 46 [2022-02-19 17:32:18,743 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 188 proven. 447 refuted. 0 times theorem prover too weak. 7 trivial. 30 not checked. [2022-02-19 17:32:18,744 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954145017] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-19 17:32:18,744 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-19 17:32:18,744 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 43] total 131 [2022-02-19 17:32:18,744 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934351470] [2022-02-19 17:32:18,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-19 17:32:18,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2022-02-19 17:32:18,745 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:32:18,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2022-02-19 17:32:18,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=15243, Unknown=63, NotChecked=1260, Total=17030 [2022-02-19 17:32:18,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:32:18,749 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:32:18,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 131 states, 131 states have (on average 9.709923664122137) internal successors, (1272), 131 states have internal predecessors, (1272), 0 states have call successors, (0), 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-19 17:32:18,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:32:18,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:32:18,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:32:18,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:32:18,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-19 17:32:18,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:32:18,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:32:18,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:32:18,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:32:18,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:32:18,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-02-19 17:32:18,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-19 17:32:18,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2022-02-19 17:32:18,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2022-02-19 17:32:18,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-02-19 17:32:18,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:32:38,709 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse2 (not .cse1)) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) .cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= |c_t1Thread1of1ForFork0_~tmp~0#1| (+ (* (div |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 4294967296) 4)) (<= c_~top~0 1) (forall ((v_ArrVal_915 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| c_~top~0))) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 1 c_~top~0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse2) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 4) (or (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse2)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-02-19 17:32:40,775 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (forall ((v_ArrVal_915 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| c_~top~0))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (= |c_~#arr~0.offset| 0) (<= 1 c_~top~0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_push_~x#1| 4))) is different from false [2022-02-19 17:32:43,079 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (<= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_95|)) (forall ((v_ArrVal_915 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 1 |c_t1Thread1of1ForFork0_get_top_#res#1|) (<= |c_t1Thread1of1ForFork0_push_~x#1| 4))) is different from false [2022-02-19 17:32:57,989 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse7 (* c_~top~0 4)) (.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse5 (not .cse2)) (.cse4 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 4)) (.cse0 (select .cse6 (+ |c_~#arr~0.offset| (- 4) .cse7))) (.cse1 (select .cse6 (+ |c_~#arr~0.offset| .cse7 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse3 4) (< .cse1 4294967296) (forall ((v_ArrVal_915 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| c_~top~0))) (<= c_~top~0 2) (<= 0 .cse4) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse5) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 .cse3) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 2 c_~top~0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse5)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= .cse4 4) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-02-19 17:33:00,051 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (forall ((v_ArrVal_915 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| c_~top~0))) (<= c_~top~0 2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (<= 0 .cse2) (<= 2 c_~top~0) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1)))) is different from false [2022-02-19 17:33:02,286 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (<= c_~top~0 2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_95|)) (forall ((v_ArrVal_915 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 .cse2) (<= 2 c_~top~0) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (forall ((v_ArrVal_918 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_92|)))) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (<= 8 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4))))) is different from false [2022-02-19 17:33:17,575 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse7 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse8 (* c_~top~0 4))) (let ((.cse4 (select .cse7 (+ |c_~#arr~0.offset| .cse8 (- 12)))) (.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse6 (not .cse2)) (.cse5 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 4)) (.cse0 (select .cse7 (+ |c_~#arr~0.offset| (- 4) .cse8))) (.cse1 (select .cse7 (+ |c_~#arr~0.offset| .cse8 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse3 4) (< .cse1 4294967296) (< (div .cse4 (- 4294967296)) (+ (div (+ (* (- 1) .cse4) 4) 4294967296) 1)) (< .cse4 4294967296) (<= 0 .cse4) (<= 0 .cse5) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse6) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_63| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_63|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_63| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| 4)) v_ArrVal_919)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)))) (<= 0 .cse3) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse6)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= .cse5 4) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-02-19 17:33:19,637 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse2 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 12)))) (.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 4)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (< .cse1 4294967296) (< (div .cse2 (- 4294967296)) (+ (div (+ (* (- 1) .cse2) 4) 4294967296) 1)) (< .cse2 4294967296) (<= 0 .cse2) (<= 0 .cse3) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_63| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_63|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_63| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| 4)) v_ArrVal_919)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)))) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= .cse3 4) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-02-19 17:33:21,750 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse3 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 12)))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (< (div .cse3 (- 4294967296)) (+ (div (+ (* (- 1) .cse3) 4) 4294967296) 1)) (< .cse3 4294967296) (forall ((v_ArrVal_915 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| c_~top~0))) (<= 0 .cse3) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (<= 0 .cse2) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-02-19 17:33:23,809 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse3 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 12)))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (< (div .cse3 (- 4294967296)) (+ (div (+ (* (- 1) .cse3) 4) 4294967296) 1)) (< .cse3 4294967296) (forall ((v_ArrVal_915 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| c_~top~0))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 .cse3) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (<= 0 .cse2) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-02-19 17:33:26,058 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse3 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 12)))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (< (div .cse3 (- 4294967296)) (+ (div (+ (* (- 1) .cse3) 4) 4294967296) 1)) (< .cse3 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 .cse3) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_95|)) (forall ((v_ArrVal_915 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 .cse2) (<= 12 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (forall ((v_ArrVal_918 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_92|)))) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_89|)) (forall ((v_ArrVal_919 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| 4)) v_ArrVal_919)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296)))))) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-02-19 17:33:46,482 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse7 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse8 (* c_~top~0 4))) (let ((.cse4 (select .cse7 (+ |c_~#arr~0.offset| .cse8 (- 12)))) (.cse6 (not .cse2)) (.cse5 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 4)) (.cse0 (select .cse7 (+ |c_~#arr~0.offset| (- 4) .cse8))) (.cse1 (select .cse7 (+ |c_~#arr~0.offset| .cse8 (- 8)))) (.cse3 (select .cse7 (+ (- 16) |c_~#arr~0.offset| .cse8)))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (< (div .cse3 (- 4294967296)) (+ (div (+ 4 (* (- 1) .cse3)) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (< (div .cse4 (- 4294967296)) (+ (div (+ (* (- 1) .cse4) 4) 4294967296) 1)) (< .cse4 4294967296) (<= 0 .cse4) (<= 0 .cse5) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse6) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (<= c_~top~0 4) (<= 4 c_~top~0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_63| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_63|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_63| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| 4)) v_ArrVal_919)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)))) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse6)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= .cse5 4) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 0 .cse3) (< .cse3 4294967296)))) is different from false [2022-02-19 17:33:48,540 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse2 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 12)))) (.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 4)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (< .cse1 4294967296) (< (div .cse2 (- 4294967296)) (+ (div (+ (* (- 1) .cse2) 4) 4294967296) 1)) (< .cse2 4294967296) (<= 0 .cse2) (<= 0 .cse3) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= c_~top~0 4) (<= 4 c_~top~0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_63| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_63|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_63| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| 4)) v_ArrVal_919)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)))) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= .cse3 4) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-02-19 17:33:50,659 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse3 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 12)))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (< (div .cse3 (- 4294967296)) (+ (div (+ (* (- 1) .cse3) 4) 4294967296) 1)) (< .cse3 4294967296) (forall ((v_ArrVal_915 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| c_~top~0))) (<= 0 .cse3) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= 4 c_~top~0) (< .cse0 4294967296) (<= 0 .cse2) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-02-19 17:33:52,717 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse3 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 12)))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (< (div .cse3 (- 4294967296)) (+ (div (+ (* (- 1) .cse3) 4) 4294967296) 1)) (< .cse3 4294967296) (forall ((v_ArrVal_915 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| c_~top~0))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 .cse3) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= 4 c_~top~0) (< .cse0 4294967296) (<= 0 .cse2) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1)))) is different from false [2022-02-19 17:33:54,954 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse3 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 12)))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (< (div .cse3 (- 4294967296)) (+ (div (+ (* (- 1) .cse3) 4) 4294967296) 1)) (< .cse3 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 .cse3) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_95|)) (forall ((v_ArrVal_915 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= 4 c_~top~0) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 .cse2) (<= 16 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (forall ((v_ArrVal_918 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_92|)))) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_89|)) (forall ((v_ArrVal_919 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| 4)) v_ArrVal_919)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))))))))) is different from false [2022-02-19 17:35:18,868 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1433 transitions and produced 1169 states. [2022-02-19 17:35:18,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:35:18,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:35:18,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:35:18,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:35:18,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-19 17:35:18,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:35:18,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:35:18,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:35:18,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:35:18,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-19 17:35:18,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-02-19 17:35:18,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-19 17:35:18,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-02-19 17:35:18,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-02-19 17:35:18,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-02-19 17:35:18,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2022-02-19 17:35:18,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-02-19 17:35:19,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-02-19 17:35:19,070 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-19 17:35:19,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:35:19,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1929867857, now seen corresponding path program 4 times [2022-02-19 17:35:19,071 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:35:19,071 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119887721] [2022-02-19 17:35:19,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:35:19,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:35:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:35:26,058 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 0 proven. 835 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:35:26,059 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:35:26,059 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119887721] [2022-02-19 17:35:26,059 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119887721] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-19 17:35:26,059 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640351500] [2022-02-19 17:35:26,059 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-19 17:35:26,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:35:26,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 17:35:26,060 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-19 17:35:26,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-19 17:35:26,314 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-19 17:35:26,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-19 17:35:26,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 912 conjuncts, 142 conjunts are in the unsatisfiable core [2022-02-19 17:35:26,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-19 17:35:27,908 INFO L387 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-19 17:35:29,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-19 17:35:29,944 INFO L387 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 28 treesize of output 23 [2022-02-19 17:35:32,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-19 17:35:32,446 INFO L387 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 30 treesize of output 25 [2022-02-19 17:35:34,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-19 17:35:34,605 INFO L387 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 30 treesize of output 25 [2022-02-19 17:35:37,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-19 17:35:37,091 INFO L387 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 30 treesize of output 25 [2022-02-19 17:35:45,467 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-19 17:35:45,474 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-19 17:35:45,475 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 13 [2022-02-19 17:35:46,039 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 0 proven. 835 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:35:46,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2022-02-19 17:36:01,467 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-19 17:36:01,467 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-19 17:36:01,481 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-19 17:36:02,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-02-19 17:36:02,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-02-19 17:36:02,602 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-02-19 17:36:02,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-19 17:36:02,603 WARN L594 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 480 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2022-02-19 17:36:02,604 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 6 remaining) [2022-02-19 17:36:02,604 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 6 remaining) [2022-02-19 17:36:02,604 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-02-19 17:36:02,604 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-02-19 17:36:02,604 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-02-19 17:36:02,612 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-02-19 17:36:02,614 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-19 17:36:02,614 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-19 17:36:02,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.02 05:36:02 BasicIcfg [2022-02-19 17:36:02,616 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-19 17:36:02,616 INFO L158 Benchmark]: Toolchain (without parser) took 851070.12ms. Allocated memory was 200.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 148.9MB in the beginning and 257.7MB in the end (delta: -108.8MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-02-19 17:36:02,616 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 200.3MB. Free memory is still 167.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-19 17:36:02,616 INFO L158 Benchmark]: CACSL2BoogieTranslator took 466.31ms. Allocated memory is still 200.3MB. Free memory was 148.8MB in the beginning and 158.9MB in the end (delta: -10.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-02-19 17:36:02,616 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.52ms. Allocated memory is still 200.3MB. Free memory was 158.9MB in the beginning and 155.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-02-19 17:36:02,617 INFO L158 Benchmark]: Boogie Preprocessor took 27.99ms. Allocated memory is still 200.3MB. Free memory was 155.7MB in the beginning and 154.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-19 17:36:02,617 INFO L158 Benchmark]: RCFGBuilder took 510.71ms. Allocated memory is still 200.3MB. Free memory was 154.1MB in the beginning and 138.4MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-02-19 17:36:02,617 INFO L158 Benchmark]: TraceAbstraction took 850023.11ms. Allocated memory was 200.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 137.9MB in the beginning and 257.7MB in the end (delta: -119.8MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-02-19 17:36:02,618 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 200.3MB. Free memory is still 167.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 466.31ms. Allocated memory is still 200.3MB. Free memory was 148.8MB in the beginning and 158.9MB in the end (delta: -10.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.52ms. Allocated memory is still 200.3MB. Free memory was 158.9MB in the beginning and 155.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.99ms. Allocated memory is still 200.3MB. Free memory was 155.7MB in the beginning and 154.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 510.71ms. Allocated memory is still 200.3MB. Free memory was 154.1MB in the beginning and 138.4MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 850023.11ms. Allocated memory was 200.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 137.9MB in the beginning and 257.7MB in the end (delta: -119.8MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 480 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 480 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 1023]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 480 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 480 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 294 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 849.8s, OverallIterations: 17, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 485.5s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 545, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 315.8s InterpolantComputationTime, 6686 NumberOfCodeBlocks, 6643 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 9265 ConstructedInterpolants, 96 QuantifiedInterpolants, 101599 SizeOfPredicates, 241 NumberOfNonLiveVariables, 6239 ConjunctsInSsa, 414 ConjunctsInUnsatCore, 36 InterpolantComputations, 7 PerfectInterpolantSequences, 4853/10497 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown