/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-MCRwithoutDepranks-Lazy.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-4b0ab11 [2022-03-02 05:39:17,063 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-02 05:39:17,064 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-02 05:39:17,128 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-02 05:39:17,129 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-02 05:39:17,131 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-02 05:39:17,133 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-02 05:39:17,135 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-02 05:39:17,138 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-02 05:39:17,142 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-02 05:39:17,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-02 05:39:17,143 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-02 05:39:17,143 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-02 05:39:17,145 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-02 05:39:17,146 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-02 05:39:17,149 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-02 05:39:17,149 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-02 05:39:17,150 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-02 05:39:17,151 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-02 05:39:17,155 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-02 05:39:17,155 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-02 05:39:17,157 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-02 05:39:17,158 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-02 05:39:17,158 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-02 05:39:17,159 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-02 05:39:17,160 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-02 05:39:17,160 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-02 05:39:17,160 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-02 05:39:17,160 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-02 05:39:17,161 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-02 05:39:17,161 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-02 05:39:17,161 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-02 05:39:17,162 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-02 05:39:17,162 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-02 05:39:17,163 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-02 05:39:17,163 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-02 05:39:17,163 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-02 05:39:17,163 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-02 05:39:17,164 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-02 05:39:17,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-02 05:39:17,164 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-02 05:39:17,169 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-MCRwithoutDepranks-Lazy.epf [2022-03-02 05:39:17,191 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-02 05:39:17,192 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-02 05:39:17,192 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-02 05:39:17,192 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-02 05:39:17,192 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-02 05:39:17,193 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-02 05:39:17,193 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-02 05:39:17,193 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-02 05:39:17,193 INFO L138 SettingsManager]: * Use SBE=true [2022-03-02 05:39:17,193 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-02 05:39:17,193 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-02 05:39:17,193 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-02 05:39:17,193 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-02 05:39:17,193 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-02 05:39:17,194 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-02 05:39:17,194 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-02 05:39:17,194 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-02 05:39:17,194 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-02 05:39:17,194 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-02 05:39:17,194 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-02 05:39:17,194 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-02 05:39:17,194 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-02 05:39:17,194 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-02 05:39:17,194 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-02 05:39:17,194 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-02 05:39:17,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-02 05:39:17,195 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-02 05:39:17,195 INFO L138 SettingsManager]: * Construct finite automaton lazily=true [2022-03-02 05:39:17,195 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-02 05:39:17,195 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-02 05:39:17,195 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-02 05:39:17,195 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-02 05:39:17,195 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-02 05:39:17,195 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-03-02 05:39:17,195 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-02 05:39:17,195 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=MCR_WITHOUT_DEPRANKS [2022-03-02 05:39:17,195 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-03-02 05:39:17,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-02 05:39:17,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-02 05:39:17,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-02 05:39:17,387 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-02 05:39:17,389 INFO L275 PluginConnector]: CDTParser initialized [2022-03-02 05:39:17,390 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack-2.i [2022-03-02 05:39:17,436 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/664c8bb8b/586a07c35b054360821a454c9f8f5b1b/FLAG27bb4e57e [2022-03-02 05:39:17,841 INFO L306 CDTParser]: Found 1 translation units. [2022-03-02 05:39:17,841 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-2.i [2022-03-02 05:39:17,852 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/664c8bb8b/586a07c35b054360821a454c9f8f5b1b/FLAG27bb4e57e [2022-03-02 05:39:17,860 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/664c8bb8b/586a07c35b054360821a454c9f8f5b1b [2022-03-02 05:39:17,862 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-02 05:39:17,863 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-02 05:39:17,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-02 05:39:17,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-02 05:39:17,873 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-02 05:39:17,873 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.03 05:39:17" (1/1) ... [2022-03-02 05:39:17,874 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@274c8f66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 05:39:17, skipping insertion in model container [2022-03-02 05:39:17,874 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.03 05:39:17" (1/1) ... [2022-03-02 05:39:17,879 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-02 05:39:17,933 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-02 05:39:18,190 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-03-02 05:39:18,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-02 05:39:18,213 INFO L203 MainTranslator]: Completed pre-run [2022-03-02 05:39:18,240 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-03-02 05:39:18,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-02 05:39:18,289 INFO L208 MainTranslator]: Completed translation [2022-03-02 05:39:18,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 05:39:18 WrapperNode [2022-03-02 05:39:18,290 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-02 05:39:18,291 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-02 05:39:18,291 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-02 05:39:18,291 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-02 05:39:18,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 05:39:18" (1/1) ... [2022-03-02 05:39:18,317 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 05:39:18" (1/1) ... [2022-03-02 05:39:18,341 INFO L137 Inliner]: procedures = 277, calls = 46, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 161 [2022-03-02 05:39:18,341 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-02 05:39:18,342 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-02 05:39:18,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-02 05:39:18,342 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-02 05:39:18,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 05:39:18" (1/1) ... [2022-03-02 05:39:18,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 05:39:18" (1/1) ... [2022-03-02 05:39:18,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 05:39:18" (1/1) ... [2022-03-02 05:39:18,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 05:39:18" (1/1) ... [2022-03-02 05:39:18,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 05:39:18" (1/1) ... [2022-03-02 05:39:18,374 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 05:39:18" (1/1) ... [2022-03-02 05:39:18,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 05:39:18" (1/1) ... [2022-03-02 05:39:18,379 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-02 05:39:18,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-02 05:39:18,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-02 05:39:18,380 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-02 05:39:18,382 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 05:39:18" (1/1) ... [2022-03-02 05:39:18,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-02 05:39:18,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 05:39:18,402 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-03-02 05:39:18,404 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-03-02 05:39:18,431 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-03-02 05:39:18,431 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-03-02 05:39:18,431 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-03-02 05:39:18,432 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-03-02 05:39:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-02 05:39:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-02 05:39:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-02 05:39:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-02 05:39:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-02 05:39:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-02 05:39:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-02 05:39:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-02 05:39:18,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-02 05:39:18,433 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-02 05:39:18,530 INFO L234 CfgBuilder]: Building ICFG [2022-03-02 05:39:18,531 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-02 05:39:18,794 INFO L275 CfgBuilder]: Performing block encoding [2022-03-02 05:39:18,802 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-02 05:39:18,802 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-02 05:39:18,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.03 05:39:18 BoogieIcfgContainer [2022-03-02 05:39:18,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-02 05:39:18,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-02 05:39:18,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-02 05:39:18,808 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-02 05:39:18,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.03 05:39:17" (1/3) ... [2022-03-02 05:39:18,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e9ea37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.03 05:39:18, skipping insertion in model container [2022-03-02 05:39:18,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 05:39:18" (2/3) ... [2022-03-02 05:39:18,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41e9ea37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.03 05:39:18, skipping insertion in model container [2022-03-02 05:39:18,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.03 05:39:18" (3/3) ... [2022-03-02 05:39:18,810 INFO L111 eAbstractionObserver]: Analyzing ICFG stack-2.i [2022-03-02 05:39:18,814 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-02 05:39:18,814 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-02 05:39:18,814 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-02 05:39:18,814 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-02 05:39:18,860 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,861 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,861 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,861 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,861 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,861 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,862 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,863 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,865 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,865 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,865 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,865 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,865 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,866 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,867 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,867 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,868 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,869 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,869 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,869 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,870 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,871 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,872 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,872 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,872 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,873 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,873 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,873 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,873 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,873 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,874 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,874 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,874 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,874 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,875 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,875 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,876 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,876 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,876 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,876 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,876 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,877 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,877 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,877 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,879 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,879 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,879 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,879 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,879 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,879 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,880 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,880 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,880 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,880 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,881 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,881 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,881 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,881 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,881 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,881 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,882 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,882 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,882 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,882 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,882 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,882 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,882 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,882 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,883 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,883 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,884 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,884 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,884 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,884 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,884 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,884 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,885 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,885 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,885 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,885 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,886 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,886 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,886 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,886 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,886 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,887 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,887 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,888 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,889 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,894 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,894 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,894 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,894 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,894 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,895 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,895 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,896 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,896 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,896 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,896 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,896 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,896 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,897 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,897 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,897 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,897 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,897 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,897 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,897 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,897 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,898 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,898 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,898 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,898 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,898 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,898 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,899 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,899 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,899 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,899 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,899 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,899 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,899 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,899 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,900 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,900 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,900 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,900 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,900 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,900 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,900 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,900 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,901 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,901 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,901 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,901 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,902 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,902 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,902 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,902 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,902 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,902 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,902 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,902 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,902 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,902 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,903 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,903 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,903 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,903 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,903 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,903 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,904 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,904 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,904 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,904 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,904 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,904 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,904 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,904 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,905 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,905 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,905 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,905 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,905 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,905 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,905 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,906 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,906 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,906 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,906 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,906 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,906 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,906 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,906 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,906 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,906 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,907 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,907 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,907 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,907 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,907 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,907 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,907 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,907 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,907 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,907 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,907 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,908 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,908 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,908 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,908 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,908 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,908 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,908 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,908 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,908 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,908 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,909 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,909 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,909 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,909 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,909 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,909 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,909 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,910 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,910 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,910 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,910 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,910 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,910 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,910 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,910 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,911 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,911 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,911 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,911 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,911 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,911 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,911 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,911 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,911 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,912 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,912 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,912 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,912 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,912 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,912 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,912 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,913 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,913 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,913 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,913 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,913 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,913 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,913 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,913 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,914 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,914 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,914 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,914 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,914 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,914 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,914 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,914 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,914 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,914 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,915 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,915 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,916 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,917 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,917 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,917 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,917 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,918 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,918 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,918 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,919 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,919 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,919 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,921 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,921 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,921 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,921 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,922 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,922 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,924 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,924 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,924 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,925 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,925 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,925 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,925 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,925 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,925 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,926 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,926 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,926 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,926 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,926 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,926 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,926 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,926 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,926 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,926 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,926 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,927 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,927 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,927 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,929 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,929 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,929 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,930 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,930 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,930 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,930 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,930 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,930 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,930 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,930 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,930 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,930 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,930 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,930 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,931 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,931 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,931 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,931 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:39:18,937 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-02 05:39:18,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-03-02 05:39:18,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 05:39:18,986 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-03-02 05:39:19,002 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-03-02 05:39:19,024 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-02 05:39:19,028 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=true [2022-03-02 05:39:19,029 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-03-02 05:39:19,117 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 132 transitions and produced 133 states. [2022-03-02 05:39:19,119 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-03-02 05:39:19,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 05:39:19,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1174616020, now seen corresponding path program 1 times [2022-03-02 05:39:19,129 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 05:39:19,129 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213949742] [2022-03-02 05:39:19,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:39:19,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 05:39:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:39:19,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:39:19,338 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 05:39:19,338 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213949742] [2022-03-02 05:39:19,339 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213949742] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-02 05:39:19,339 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-02 05:39:19,339 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-02 05:39:19,340 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947058595] [2022-03-02 05:39:19,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-02 05:39:19,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-02 05:39:19,345 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 05:39:19,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-02 05:39:19,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-02 05:39:19,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:19,365 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 05:39:19,366 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-03-02 05:39:19,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:19,420 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 132 transitions and produced 133 states. [2022-03-02 05:39:19,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:19,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-02 05:39:19,425 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-03-02 05:39:19,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 05:39:19,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1170051021, now seen corresponding path program 1 times [2022-03-02 05:39:19,427 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 05:39:19,427 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810730521] [2022-03-02 05:39:19,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:39:19,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 05:39:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:39:19,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:39:19,539 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 05:39:19,539 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810730521] [2022-03-02 05:39:19,540 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810730521] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-02 05:39:19,540 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-02 05:39:19,540 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-02 05:39:19,540 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608413500] [2022-03-02 05:39:19,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-02 05:39:19,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-02 05:39:19,541 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 05:39:19,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-02 05:39:19,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-02 05:39:19,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:19,541 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 05:39:19,542 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-03-02 05:39:19,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:19,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:19,611 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 158 transitions and produced 159 states. [2022-03-02 05:39:19,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:19,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:19,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-02 05:39:19,612 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-03-02 05:39:19,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 05:39:19,613 INFO L85 PathProgramCache]: Analyzing trace with hash 323884447, now seen corresponding path program 1 times [2022-03-02 05:39:19,613 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 05:39:19,613 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157370922] [2022-03-02 05:39:19,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:39:19,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 05:39:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:39:19,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:39:19,711 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 05:39:19,711 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157370922] [2022-03-02 05:39:19,711 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157370922] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-02 05:39:19,711 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-02 05:39:19,711 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-02 05:39:19,711 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235057171] [2022-03-02 05:39:19,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-02 05:39:19,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-02 05:39:19,712 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 05:39:19,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-02 05:39:19,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-02 05:39:19,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:19,712 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 05:39:19,712 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-03-02 05:39:19,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:19,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:19,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:19,863 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 977 transitions and produced 978 states. [2022-03-02 05:39:19,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:19,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:19,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:19,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-02 05:39:19,864 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-03-02 05:39:19,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 05:39:19,865 INFO L85 PathProgramCache]: Analyzing trace with hash 2033537427, now seen corresponding path program 1 times [2022-03-02 05:39:19,865 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 05:39:19,866 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076968877] [2022-03-02 05:39:19,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:39:19,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 05:39:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:39:19,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:39:19,929 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 05:39:19,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076968877] [2022-03-02 05:39:19,929 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076968877] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-02 05:39:19,929 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-02 05:39:19,929 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-02 05:39:19,929 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463982227] [2022-03-02 05:39:19,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-02 05:39:19,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-02 05:39:19,930 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 05:39:19,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-02 05:39:19,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-02 05:39:19,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:19,930 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 05:39:19,930 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-03-02 05:39:19,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:19,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:19,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:19,931 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:20,133 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1003 transitions and produced 1004 states. [2022-03-02 05:39:20,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:20,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:20,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:20,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:20,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-02 05:39:20,134 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-03-02 05:39:20,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 05:39:20,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1519561133, now seen corresponding path program 1 times [2022-03-02 05:39:20,135 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 05:39:20,135 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888440754] [2022-03-02 05:39:20,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:39:20,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 05:39:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:39:20,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:39:20,232 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 05:39:20,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888440754] [2022-03-02 05:39:20,232 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888440754] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-02 05:39:20,232 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-02 05:39:20,232 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-02 05:39:20,232 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150386598] [2022-03-02 05:39:20,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-02 05:39:20,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-02 05:39:20,233 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 05:39:20,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-02 05:39:20,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-02 05:39:20,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:20,233 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 05:39:20,234 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-03-02 05:39:20,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:20,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:20,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:20,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:20,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:20,327 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 223 transitions and produced 224 states. [2022-03-02 05:39:20,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:20,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:20,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:20,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:20,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-02 05:39:20,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-02 05:39:20,328 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-03-02 05:39:20,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 05:39:20,329 INFO L85 PathProgramCache]: Analyzing trace with hash -818256019, now seen corresponding path program 1 times [2022-03-02 05:39:20,329 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 05:39:20,329 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15203649] [2022-03-02 05:39:20,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:39:20,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 05:39:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:39:20,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:39:20,425 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 05:39:20,426 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15203649] [2022-03-02 05:39:20,426 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15203649] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 05:39:20,426 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250995557] [2022-03-02 05:39:20,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:39:20,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 05:39:20,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 05:39:20,428 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-03-02 05:39:20,431 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-03-02 05:39:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:39:20,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-02 05:39:20,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 05:39:20,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:39:20,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 05:39:21,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:39:21,008 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250995557] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 05:39:21,008 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 05:39:21,008 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-02 05:39:21,008 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615393715] [2022-03-02 05:39:21,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 05:39:21,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-02 05:39:21,009 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 05:39:21,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-02 05:39:21,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-02 05:39:21,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:21,012 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 05:39:21,013 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-03-02 05:39:21,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:21,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:21,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:21,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:21,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-02 05:39:21,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:26,739 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1930 transitions and produced 1931 states. [2022-03-02 05:39:26,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:26,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:26,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:26,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:26,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-02 05:39:26,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-02 05:39:26,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-02 05:39:26,944 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-03-02 05:39:26,945 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-03-02 05:39:26,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 05:39:26,945 INFO L85 PathProgramCache]: Analyzing trace with hash 148992281, now seen corresponding path program 1 times [2022-03-02 05:39:26,945 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 05:39:26,946 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737023420] [2022-03-02 05:39:26,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:39:26,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 05:39:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:39:27,021 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:39:27,022 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 05:39:27,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737023420] [2022-03-02 05:39:27,022 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737023420] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 05:39:27,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998381175] [2022-03-02 05:39:27,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:39:27,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 05:39:27,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 05:39:27,024 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-03-02 05:39:27,025 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-03-02 05:39:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:39:27,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-02 05:39:27,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 05:39:27,272 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:39:27,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 05:39:27,431 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:39:27,431 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998381175] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 05:39:27,431 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 05:39:27,431 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-02 05:39:27,431 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813824378] [2022-03-02 05:39:27,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 05:39:27,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-02 05:39:27,432 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 05:39:27,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-02 05:39:27,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-02 05:39:27,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:27,433 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 05:39:27,433 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-03-02 05:39:27,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:27,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:27,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:27,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:27,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-02 05:39:27,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-02 05:39:27,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:38,912 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 2991 transitions and produced 2991 states. [2022-03-02 05:39:38,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:38,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:38,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:38,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:38,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-02 05:39:38,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:39:38,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:39:38,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-02 05:39:39,113 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-03-02 05:39:39,114 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-03-02 05:39:39,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 05:39:39,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1058312109, now seen corresponding path program 2 times [2022-03-02 05:39:39,115 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 05:39:39,115 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704764560] [2022-03-02 05:39:39,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:39:39,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 05:39:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:39:39,268 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:39:39,268 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 05:39:39,268 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704764560] [2022-03-02 05:39:39,269 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704764560] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 05:39:39,269 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970910274] [2022-03-02 05:39:39,269 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-02 05:39:39,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 05:39:39,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 05:39:39,270 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-03-02 05:39:39,273 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-03-02 05:39:39,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-02 05:39:39,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-02 05:39:39,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-02 05:39:39,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 05:39:39,762 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:39:39,762 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-02 05:39:39,762 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970910274] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-02 05:39:39,762 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-02 05:39:39,763 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2022-03-02 05:39:39,763 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964719614] [2022-03-02 05:39:39,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-02 05:39:39,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-02 05:39:39,763 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 05:39:39,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-02 05:39:39,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-03-02 05:39:39,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:39,764 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 05:39:39,765 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-03-02 05:39:39,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:39,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:39,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:39,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:39,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-02 05:39:39,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:39:39,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:39:39,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:51,871 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 3019 transitions and produced 3019 states. [2022-03-02 05:39:51,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:51,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:51,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:51,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:51,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-02 05:39:51,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:39:51,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:39:51,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:39:51,890 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-03-02 05:39:52,072 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-03-02 05:39:52,073 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-03-02 05:39:52,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 05:39:52,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1593386593, now seen corresponding path program 1 times [2022-03-02 05:39:52,074 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 05:39:52,074 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102838255] [2022-03-02 05:39:52,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:39:52,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 05:39:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:39:52,242 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:39:52,243 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 05:39:52,244 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102838255] [2022-03-02 05:39:52,244 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102838255] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 05:39:52,244 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958815755] [2022-03-02 05:39:52,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:39:52,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 05:39:52,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 05:39:52,246 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-03-02 05:39:52,247 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-03-02 05:39:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:39:52,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-02 05:39:52,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 05:39:52,668 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:39:52,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 05:39:52,973 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:39:52,973 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958815755] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 05:39:52,973 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 05:39:52,973 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-03-02 05:39:52,973 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332470713] [2022-03-02 05:39:52,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 05:39:52,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-02 05:39:52,974 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 05:39:52,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-02 05:39:52,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-03-02 05:39:52,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:52,976 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 05:39:52,977 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-03-02 05:39:52,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:52,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:52,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:52,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:52,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-02 05:39:52,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:39:52,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:39:52,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:39:52,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:40:09,514 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 3836 transitions and produced 3359 states. [2022-03-02 05:40:09,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:40:09,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:40:09,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:40:09,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:40:09,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-02 05:40:09,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:40:09,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:40:09,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:40:09,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-02 05:40:09,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-02 05:40:09,715 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-03-02 05:40:09,716 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-03-02 05:40:09,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 05:40:09,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1431502631, now seen corresponding path program 2 times [2022-03-02 05:40:09,716 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 05:40:09,716 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670012424] [2022-03-02 05:40:09,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:40:09,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 05:40:09,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:40:09,892 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 12 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:40:09,892 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 05:40:09,892 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670012424] [2022-03-02 05:40:09,892 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670012424] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 05:40:09,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640935924] [2022-03-02 05:40:09,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-02 05:40:09,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 05:40:09,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 05:40:09,895 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-03-02 05:40:09,896 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-03-02 05:40:10,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-02 05:40:10,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-02 05:40:10,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-02 05:40:10,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 05:40:10,335 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 12 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:40:10,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 05:40:10,652 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 12 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:40:10,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640935924] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 05:40:10,653 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 05:40:10,653 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-03-02 05:40:10,653 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224765103] [2022-03-02 05:40:10,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 05:40:10,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-02 05:40:10,654 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 05:40:10,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-02 05:40:10,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-03-02 05:40:10,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:40:10,654 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 05:40:10,655 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-03-02 05:40:10,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:40:10,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:40:10,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:40:10,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:40:10,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-02 05:40:10,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:40:10,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:40:10,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:40:10,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-02 05:40:10,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:40:34,462 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 4925 transitions and produced 3966 states. [2022-03-02 05:40:34,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:40:34,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:40:34,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:40:34,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:40:34,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-02 05:40:34,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:40:34,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:40:34,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:40:34,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:40:34,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:40:34,481 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-03-02 05:40:34,663 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-03-02 05:40:34,664 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-03-02 05:40:34,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 05:40:34,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1603129695, now seen corresponding path program 2 times [2022-03-02 05:40:34,664 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 05:40:34,664 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515626499] [2022-03-02 05:40:34,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:40:34,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 05:40:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:40:35,647 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:40:35,647 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 05:40:35,647 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515626499] [2022-03-02 05:40:35,647 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515626499] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 05:40:35,647 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108762149] [2022-03-02 05:40:35,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-02 05:40:35,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 05:40:35,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 05:40:35,649 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-03-02 05:40:35,650 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-03-02 05:40:35,809 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-02 05:40:35,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-02 05:40:35,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 55 conjunts are in the unsatisfiable core [2022-03-02 05:40:35,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 05:40:36,853 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-03-02 05:40:37,882 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-03-02 05:40:38,082 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2022-03-02 05:40:38,082 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-02 05:40:38,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108762149] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-02 05:40:38,083 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-02 05:40:38,083 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [32] total 52 [2022-03-02 05:40:38,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373789773] [2022-03-02 05:40:38,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-02 05:40:38,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-02 05:40:38,083 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 05:40:38,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-02 05:40:38,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2522, Unknown=0, NotChecked=0, Total=2652 [2022-03-02 05:40:38,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:40:38,085 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 05:40:38,085 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-03-02 05:40:38,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:40:38,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:40:38,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:40:38,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:40:38,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-02 05:40:38,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:40:38,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:40:38,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:40:38,085 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:40:38,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:40:38,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:41:07,997 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 4984 transitions and produced 4025 states. [2022-03-02 05:41:07,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:41:07,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:41:07,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:41:07,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:41:07,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-02 05:41:07,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:41:07,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:41:07,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:41:07,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:41:07,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:41:07,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-02 05:41:08,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-03-02 05:41:08,198 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-03-02 05:41:08,199 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-03-02 05:41:08,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 05:41:08,200 INFO L85 PathProgramCache]: Analyzing trace with hash 390942809, now seen corresponding path program 1 times [2022-03-02 05:41:08,200 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 05:41:08,200 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2431927] [2022-03-02 05:41:08,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:41:08,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 05:41:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:41:08,445 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 318 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:41:08,445 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 05:41:08,445 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2431927] [2022-03-02 05:41:08,445 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2431927] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 05:41:08,445 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985045027] [2022-03-02 05:41:08,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:41:08,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 05:41:08,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 05:41:08,447 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-03-02 05:41:08,448 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-03-02 05:41:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:41:08,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-02 05:41:08,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 05:41:09,105 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 439 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:41:09,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 05:41:09,631 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 439 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:41:09,632 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985045027] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 05:41:09,632 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 05:41:09,632 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 27 [2022-03-02 05:41:09,632 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39813470] [2022-03-02 05:41:09,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 05:41:09,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-02 05:41:09,633 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 05:41:09,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-02 05:41:09,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2022-03-02 05:41:09,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:41:09,634 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 05:41:09,635 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-03-02 05:41:09,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:41:09,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:41:09,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:41:09,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:41:09,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-02 05:41:09,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:41:09,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:41:09,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:41:09,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:41:09,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:41:09,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-02 05:41:09,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:41:35,271 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 5012 transitions and produced 4053 states. [2022-03-02 05:41:35,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:41:35,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:41:35,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:41:35,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:41:35,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-02 05:41:35,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:41:35,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:41:35,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:41:35,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:41:35,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:41:35,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-02 05:41:35,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-02 05:41:35,295 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-03-02 05:41:35,491 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-03-02 05:41:35,492 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-03-02 05:41:35,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 05:41:35,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1682786829, now seen corresponding path program 1 times [2022-03-02 05:41:35,493 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 05:41:35,493 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260311821] [2022-03-02 05:41:35,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:41:35,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 05:41:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:41:36,693 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 0 proven. 472 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:41:36,693 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 05:41:36,693 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260311821] [2022-03-02 05:41:36,693 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260311821] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 05:41:36,693 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547817448] [2022-03-02 05:41:36,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:41:36,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 05:41:36,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 05:41:36,695 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-03-02 05:41:36,696 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-03-02 05:41:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:41:36,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 73 conjunts are in the unsatisfiable core [2022-03-02 05:41:36,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 05:41:37,732 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-03-02 05:41:38,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 05:41:38,621 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-03-02 05:41:40,083 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-03-02 05:41:40,291 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 248 proven. 74 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-03-02 05:41:40,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 05:41:43,385 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-03-02 05:41:53,093 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-03-02 05:42:03,299 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-03-02 05:42:04,081 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 248 proven. 70 refuted. 0 times theorem prover too weak. 150 trivial. 4 not checked. [2022-03-02 05:42:04,081 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547817448] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 05:42:04,081 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 05:42:04,081 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 30, 29] total 91 [2022-03-02 05:42:04,081 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652904256] [2022-03-02 05:42:04,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 05:42:04,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-03-02 05:42:04,082 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 05:42:04,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-03-02 05:42:04,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=7535, Unknown=7, NotChecked=350, Total=8190 [2022-03-02 05:42:04,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:42:04,085 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 05:42:04,086 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-03-02 05:42:04,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:42:04,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:42:04,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:42:04,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:42:04,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-02 05:42:04,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:42:04,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:42:04,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:42:04,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:42:04,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:42:04,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-02 05:42:04,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-03-02 05:42:04,086 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:42:13,717 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-03-02 05:42:14,333 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-03-02 05:42:16,749 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-03-02 05:42:24,668 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-03-02 05:42:25,238 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-03-02 05:42:27,647 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-03-02 05:42:35,660 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-03-02 05:42:36,235 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-03-02 05:42:38,640 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-03-02 05:42:46,434 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-03-02 05:42:47,016 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-03-02 05:42:49,412 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-03-02 05:42:59,475 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 5099 transitions and produced 4140 states. [2022-03-02 05:42:59,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:42:59,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:42:59,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:42:59,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:42:59,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-02 05:42:59,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:42:59,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:42:59,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:42:59,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:42:59,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:42:59,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-02 05:42:59,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-02 05:42:59,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-03-02 05:42:59,512 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-03-02 05:42:59,696 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-03-02 05:42:59,697 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-03-02 05:42:59,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 05:42:59,697 INFO L85 PathProgramCache]: Analyzing trace with hash -995008903, now seen corresponding path program 2 times [2022-03-02 05:42:59,697 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 05:42:59,697 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639427140] [2022-03-02 05:42:59,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:42:59,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 05:42:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:43:01,160 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:43:01,161 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 05:43:01,161 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639427140] [2022-03-02 05:43:01,161 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639427140] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 05:43:01,161 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192864118] [2022-03-02 05:43:01,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-02 05:43:01,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 05:43:01,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 05:43:01,163 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-03-02 05:43:01,164 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-03-02 05:43:01,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-02 05:43:01,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-02 05:43:01,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 99 conjunts are in the unsatisfiable core [2022-03-02 05:43:01,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 05:43:02,113 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-03-02 05:43:02,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 05:43:02,966 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-03-02 05:43:03,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 05:43:03,815 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-03-02 05:43:05,945 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-03-02 05:43:06,157 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 261 proven. 233 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-03-02 05:43:06,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 05:43:09,494 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-03-02 05:43:28,719 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_46| Int) (v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|)) (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_#t~ret35#1_64| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0))) is different from false [2022-03-02 05:43:42,353 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-03-02 05:43:58,723 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-03-02 05:44:12,572 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-03-02 05:44:13,401 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 261 proven. 221 refuted. 0 times theorem prover too weak. 57 trivial. 12 not checked. [2022-03-02 05:44:13,402 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192864118] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 05:44:13,402 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 05:44:13,402 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 39, 36] total 112 [2022-03-02 05:44:13,402 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801227256] [2022-03-02 05:44:13,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 05:44:13,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 112 states [2022-03-02 05:44:13,403 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 05:44:13,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2022-03-02 05:44:13,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=11148, Unknown=37, NotChecked=860, Total=12432 [2022-03-02 05:44:13,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:44:13,407 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 05:44:13,408 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-03-02 05:44:13,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:44:13,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:44:13,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:44:13,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:44:13,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-02 05:44:13,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:44:13,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:44:13,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:44:13,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:44:13,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:44:13,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-02 05:44:13,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-02 05:44:13,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2022-03-02 05:44:13,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:44:22,593 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-03-02 05:44:23,320 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-03-02 05:44:25,778 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_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|) (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) (<= 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-03-02 05:44:35,138 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) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_46| Int) (v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|)) (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_#t~ret35#1_64| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0)))))) is different from false [2022-03-02 05:44:36,345 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)) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_46| Int) (v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|)) (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_#t~ret35#1_64| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0)))))) is different from false [2022-03-02 05:44:38,964 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) (< |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|) (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|) (<= 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) (= 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)) (<= |c_t1Thread1of1ForFork0_push_~x#1| 4)))) is different from false [2022-03-02 05:44:48,713 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) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_46| Int) (v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|)) (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_#t~ret35#1_64| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0)))))) is different from false [2022-03-02 05:44:49,843 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) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_46| Int) (v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|)) (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_#t~ret35#1_64| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0)))))) is different from false [2022-03-02 05:44:52,412 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) (< |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|) (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) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |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) (< (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-03-02 05:45:02,385 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)) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_46| Int) (v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|)) (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_#t~ret35#1_64| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0)))))) is different from false [2022-03-02 05:45:03,536 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)) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_46| Int) (v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|)) (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_#t~ret35#1_64| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0)))))) is different from false [2022-03-02 05:45:06,146 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) (< |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) (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) (<= 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)) (<= (+ |c_~#arr~0.offset| 16) (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4))))) is different from false [2022-03-02 05:45:07,885 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 (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse2 (select .cse4 (+ |c_~#arr~0.offset| .cse5))) (.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)) (<= 0 .cse2) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse3 4) (< .cse1 4294967296) (<= 0 .cse3) (<= 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|) (< .cse2 4294967296) (<= 4 c_~top~0) (< (div .cse2 (- 4294967296)) (+ (div (+ (* (- 1) .cse2) 4) 4294967296) 1)) (< .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-03-02 05:45:08,810 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (* c_~top~0 4)) (.cse8 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse10 (* 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|)) (.cse9 (+ |c_~#arr~0.offset| 8))) (let ((.cse4 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) .cse9)) (.cse5 (select .cse8 (+ .cse10 |c_~#arr~0.offset| (- 8)))) (.cse3 (select .cse8 (+ |c_~#arr~0.offset| .cse11))) (.cse7 (select .cse8 (+ .cse10 |c_~#arr~0.offset| (- 4)))) (.cse0 (select .cse8 (+ |c_~#arr~0.offset| (- 4) .cse11))) (.cse1 (select .cse8 (+ |c_~#arr~0.offset| .cse11 (- 8)))) (.cse6 (select .cse8 (+ .cse10 |c_~#arr~0.offset|))) (.cse2 (select .cse8 .cse9))) (and (<= |c_t1Thread1of1ForFork0_inc_top_#t~post31#1| 4) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (<= .cse2 4) (<= 0 .cse3) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse4 4) (< .cse1 4294967296) (<= 0 .cse4) (< .cse5 4294967296) (<= 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 .cse6 (- 4294967296)) (+ (div (+ (* (- 1) .cse6) 4) 4294967296) 1)) (<= 0 .cse5) (<= 0 .cse7) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (< (div .cse5 (- 4294967296)) (+ (div (+ (* (- 1) .cse5) 4) 4294967296) 1)) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= 0 .cse6) (< .cse3 4294967296) (<= 4 c_~top~0) (< (div .cse3 (- 4294967296)) (+ (div (+ (* (- 1) .cse3) 4) 4294967296) 1)) (< .cse0 4294967296) (< (div .cse7 (- 4294967296)) (+ (div (+ (* (- 1) .cse7) 4) 4294967296) 1)) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= 4 |c_t1Thread1of1ForFork0_inc_top_#t~post31#1|) (= 5 |c_~#arr~0.base|) (< .cse7 4294967296) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< .cse6 4294967296) (<= 0 .cse2)))) is different from false [2022-03-02 05:45:24,898 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 5158 transitions and produced 4199 states. [2022-03-02 05:45:24,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:45:24,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:45:24,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:45:24,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:45:24,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-02 05:45:24,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:45:24,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:45:24,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:45:24,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:45:24,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:45:24,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-02 05:45:24,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-02 05:45:24,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-03-02 05:45:24,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-03-02 05:45:24,919 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-03-02 05:45:25,099 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-03-02 05:45:25,100 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-03-02 05:45:25,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 05:45:25,100 INFO L85 PathProgramCache]: Analyzing trace with hash -43463631, now seen corresponding path program 2 times [2022-03-02 05:45:25,100 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 05:45:25,100 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17913909] [2022-03-02 05:45:25,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:45:25,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 05:45:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:45:25,359 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 326 proven. 295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:45:25,360 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 05:45:25,360 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17913909] [2022-03-02 05:45:25,360 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17913909] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 05:45:25,360 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034730619] [2022-03-02 05:45:25,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-02 05:45:25,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 05:45:25,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 05:45:25,361 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-03-02 05:45:25,362 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-03-02 05:45:25,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-02 05:45:25,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-02 05:45:25,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-02 05:45:25,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 05:45:26,179 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 447 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:45:26,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 05:45:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 447 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:45:26,816 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034730619] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 05:45:26,817 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 05:45:26,817 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 25 [2022-03-02 05:45:26,817 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445099105] [2022-03-02 05:45:26,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 05:45:26,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-02 05:45:26,818 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 05:45:26,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-02 05:45:26,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2022-03-02 05:45:26,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:45:26,819 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 05:45:26,819 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-03-02 05:45:26,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:45:26,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:45:26,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:45:26,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:45:26,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-02 05:45:26,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:45:26,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:45:26,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:45:26,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:45:26,819 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:45:26,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-02 05:45:26,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-02 05:45:26,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2022-03-02 05:45:26,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2022-03-02 05:45:26,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:45:53,590 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 5186 transitions and produced 4227 states. [2022-03-02 05:45:53,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:45:53,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:45:53,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:45:53,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:45:53,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-02 05:45:53,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:45:53,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:45:53,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:45:53,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:45:53,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:45:53,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-02 05:45:53,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-02 05:45:53,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-03-02 05:45:53,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-03-02 05:45:53,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-02 05:45:53,611 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-03-02 05:45:53,803 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-03-02 05:45:53,803 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-03-02 05:45:53,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 05:45:53,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1012345829, now seen corresponding path program 3 times [2022-03-02 05:45:53,804 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 05:45:53,804 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655052210] [2022-03-02 05:45:53,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:45:53,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 05:45:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:45:55,505 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:45:55,506 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 05:45:55,506 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655052210] [2022-03-02 05:45:55,506 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655052210] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 05:45:55,506 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654727556] [2022-03-02 05:45:55,506 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-02 05:45:55,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 05:45:55,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 05:45:55,507 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-03-02 05:45:55,508 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-03-02 05:45:55,811 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-02 05:45:55,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-02 05:45:55,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 117 conjunts are in the unsatisfiable core [2022-03-02 05:45:55,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 05:45:56,677 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-03-02 05:45:57,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 05:45:57,662 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-03-02 05:45:58,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 05:45:58,621 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-03-02 05:45:59,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 05:45:59,657 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-03-02 05:46:02,704 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-03-02 05:46:02,977 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 188 proven. 477 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-02 05:46:02,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 05:46:06,796 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-03-02 05:46:07,611 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int) (v_ArrVal_919 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| c_~top~0) (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-03-02 05:46:37,554 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-03-02 05:47:15,264 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-03-02 05:48:03,351 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-03-02 05:48:04,271 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 188 proven. 456 refuted. 0 times theorem prover too weak. 7 trivial. 21 not checked. [2022-03-02 05:48:04,271 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654727556] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 05:48:04,271 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 05:48:04,271 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 43] total 131 [2022-03-02 05:48:04,271 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946012156] [2022-03-02 05:48:04,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 05:48:04,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2022-03-02 05:48:04,272 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 05:48:04,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2022-03-02 05:48:04,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=15489, Unknown=62, NotChecked=1012, Total=17030 [2022-03-02 05:48:04,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:48:04,276 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 05:48:04,277 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-03-02 05:48:04,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:48:04,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:48:04,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:48:04,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:48:04,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-02 05:48:04,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:48:04,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:48:04,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:48:04,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:48:04,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:48:04,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-02 05:48:04,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-02 05:48:04,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2022-03-02 05:48:04,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2022-03-02 05:48:04,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-03-02 05:48:04,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:48:15,703 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) (<= 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) (<= |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_~#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|) (= |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) (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)) (<= 1 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (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-03-02 05:48:26,596 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) (<= c_~top~0 2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#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)) (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_~#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|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 .cse3) (<= 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|) (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)) (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|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= .cse4 4) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (<= 8 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-02 05:48:37,376 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) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int) (v_ArrVal_919 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| c_~top~0) (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))))) (<= 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) (<= 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-03-02 05:48:38,148 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_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int) (v_ArrVal_919 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| c_~top~0) (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))))) (<= 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-03-02 05:48:40,194 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-03-02 05:48:51,998 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse8 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse9 (* c_~top~0 4))) (let ((.cse5 (select .cse8 (+ |c_~#arr~0.offset| .cse9 (- 12)))) (.cse4 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse7 (not .cse2)) (.cse6 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 4)) (.cse0 (select .cse8 (+ |c_~#arr~0.offset| (- 4) .cse9))) (.cse1 (select .cse8 (+ |c_~#arr~0.offset| .cse9 (- 8)))) (.cse3 (select .cse8 (+ (- 16) |c_~#arr~0.offset| .cse9)))) (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|) (<= .cse4 4) (< .cse1 4294967296) (< (div .cse5 (- 4294967296)) (+ (div (+ (* (- 1) .cse5) 4) 4294967296) 1)) (< .cse5 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int) (v_ArrVal_919 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| c_~top~0) (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))))) (<= 0 .cse5) (<= 0 .cse6) (= |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) .cse7) (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) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 .cse4) (<= 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) .cse7)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= .cse6 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-03-02 05:48:52,745 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_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int) (v_ArrVal_919 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| c_~top~0) (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))))) (<= 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-03-02 05:48:54,827 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-03-02 05:49:25,802 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 5273 transitions and produced 4314 states. [2022-03-02 05:49:25,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:49:25,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:49:25,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:49:25,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:49:25,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-02 05:49:25,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:49:25,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:49:25,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:49:25,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:49:25,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:49:25,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-02 05:49:25,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-02 05:49:25,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-03-02 05:49:25,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-03-02 05:49:25,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-02 05:49:25,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2022-03-02 05:49:25,820 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-03-02 05:49:26,004 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-03-02 05:49:26,004 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-03-02 05:49:26,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 05:49:26,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1929867857, now seen corresponding path program 4 times [2022-03-02 05:49:26,005 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 05:49:26,005 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762521949] [2022-03-02 05:49:26,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:49:26,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 05:49:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:49:27,911 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 0 proven. 835 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:49:27,911 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 05:49:27,911 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762521949] [2022-03-02 05:49:27,911 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762521949] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 05:49:27,911 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370494667] [2022-03-02 05:49:27,911 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-02 05:49:27,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 05:49:27,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 05:49:27,913 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-03-02 05:49:27,913 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-03-02 05:49:28,178 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-02 05:49:28,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-02 05:49:28,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 912 conjuncts, 142 conjunts are in the unsatisfiable core [2022-03-02 05:49:28,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 05:49:28,658 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-03-02 05:49:29,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 05:49:29,212 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-03-02 05:49:29,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 05:49:29,888 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-03-02 05:49:30,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 05:49:30,625 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-03-02 05:49:31,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 05:49:31,391 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-03-02 05:49:34,059 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-02 05:49:34,061 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-02 05:49:34,062 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-03-02 05:49:34,223 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 0 proven. 835 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:49:34,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 05:50:02,275 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-03-02 05:50:03,091 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 29 proven. 806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:50:03,092 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1370494667] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 05:50:03,092 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 05:50:03,092 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 54, 56] total 127 [2022-03-02 05:50:03,092 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690558710] [2022-03-02 05:50:03,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 05:50:03,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 127 states [2022-03-02 05:50:03,093 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 05:50:03,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2022-03-02 05:50:03,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=15364, Unknown=14, NotChecked=0, Total=16002 [2022-03-02 05:50:03,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:50:03,098 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 05:50:03,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 127 states, 127 states have (on average 7.94488188976378) internal successors, (1009), 127 states have internal predecessors, (1009), 0 states have call successors, (0), 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-03-02 05:50:03,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:50:03,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:50:03,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:50:03,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:50:03,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-02 05:50:03,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:50:03,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:50:03,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:50:03,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:50:03,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:50:03,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-02 05:50:03,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-02 05:50:03,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2022-03-02 05:50:03,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2022-03-02 05:50:03,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-02 05:50:03,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 134 states. [2022-03-02 05:50:03,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:50:27,096 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~top~0 4)) (.cse2 (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|)) (.cse3 (= (+ c_~top~0 4) 0)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (or (and (= (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse1)) .cse2 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) .cse3) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse1)) 4294967296))) (= |c_~#arr~0.offset| 0) .cse2 (or (not (= (mod (+ 2 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967296) 0)) .cse3) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_75| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_75|)) (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_75| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (or (forall ((v_ArrVal_1040 Int)) (not (= (mod (let ((.cse4 (* c_~top~0 4))) (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|) (+ .cse4 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse4))) 4294967296) 4294967294))) (= 0 (+ 3 c_~top~0))) (<= .cse0 4) (<= 3 c_~top~0) (<= c_~top~0 3))) is different from false [2022-03-02 05:50:27,960 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (or (and (let ((.cse1 (* c_~top~0 4))) (= (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse1))) .cse2 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (= |c_~#arr~0.offset| 0) .cse2 (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_75| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_75|)) (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_75| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (or (forall ((v_ArrVal_1040 Int)) (not (= (mod (let ((.cse3 (* c_~top~0 4))) (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|) (+ .cse3 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse3))) 4294967296) 4294967294))) (= 0 (+ 3 c_~top~0))) (<= .cse0 4) (<= 3 c_~top~0) (<= c_~top~0 3))) is different from false [2022-03-02 05:50:28,751 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (<= .cse0 4) .cse1 (or (and (let ((.cse2 (* c_~top~0 4))) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse2) (+ |c_~#arr~0.offset| .cse2))) .cse1 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (= |c_~#arr~0.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (let ((.cse3 (* c_~top~0 4))) (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| .cse3) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse3))) 4294967296)))) (= 0 (+ 3 c_~top~0))) (<= 0 .cse0) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (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| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (<= 3 c_~top~0) (<= c_~top~0 3))) is different from false [2022-03-02 05:50:29,562 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (<= .cse0 4) .cse1 (or (= (+ c_~top~0 4) 0) (and (let ((.cse2 (* c_~top~0 4))) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse2) (+ |c_~#arr~0.offset| .cse2))) .cse1 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))))) (= |c_~#arr~0.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (let ((.cse3 (* c_~top~0 4))) (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| .cse3) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse3))) 4294967296)))) (= 0 (+ 3 c_~top~0))) (<= 0 .cse0) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (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| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (<= 3 c_~top~0) (<= c_~top~0 3))) is different from false [2022-03-02 05:50:30,402 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse2 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (.cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|))) (and (<= .cse0 4) .cse1 (= |c_~#arr~0.offset| 0) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) (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| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 12 .cse2) (<= 0 .cse0) (or (and (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse2) (+ |c_~#arr~0.offset| (* c_~top~0 4))) .cse1 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (or (forall ((v_ArrVal_1040 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| (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) (= 0 (+ 3 c_~top~0))) (<= 3 c_~top~0) (<= c_~top~0 3))) is different from false [2022-03-02 05:50:31,258 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_~top~0 4)) (.cse8 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse0 (select .cse8 0)) (.cse7 (= (+ c_~top~0 4) 0)) (.cse6 (+ |c_~#arr~0.offset| .cse9)) (.cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse5 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296)))) (.cse3 (= 0 (+ 3 c_~top~0))) (.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse4 (= (+ 2 c_~top~0) 0))) (and (<= .cse0 4) (<= .cse1 4) .cse2 (or .cse3 (forall ((v_ArrVal_1040 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| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))))) (or .cse4 (forall ((v_ArrVal_1042 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| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))))) (or (and .cse2 .cse5 (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) .cse6)) .cse7) (<= c_~top~0 |c_t1Thread1of1ForFork0_push_#t~ret35#1|) (not (= 4294967294 (mod (select .cse8 (+ |c_~#arr~0.offset| (- 4) .cse9)) 4294967296))) (<= 0 .cse0) (or .cse7 (and (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse9) .cse6) .cse2 .cse5)) (= |c_~#arr~0.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (let ((.cse10 (* c_~top~0 4))) (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| .cse10) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse10))) 4294967296)))) .cse3) (<= 0 .cse1) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod (select .cse8 (+ |c_~#arr~0.offset| .cse9 (- 8))) 4294967296))) (or .cse4 (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (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| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-03-02 05:50:38,993 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (* c_~top~0 4)) (.cse2 (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|)) (.cse3 (= (+ c_~top~0 4) 0)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (or (and (= (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse1)) .cse2 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) .cse3) (not (= 4294967294 (mod (select .cse4 (+ |c_~#arr~0.offset| .cse1 (- 12))) 4294967296))) (not (= 4294967294 (mod (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse1)) 4294967296))) (= |c_~#arr~0.offset| 0) (<= c_~top~0 4) (<= 4 c_~top~0) .cse2 (or (not (= (mod (+ 2 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967296) 0)) .cse3) (or (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_73| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_73|)) (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_73| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0))) (= (+ c_~top~0 1) 0)) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_75| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_75|)) (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_75| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (or (forall ((v_ArrVal_1040 Int)) (not (= (mod (let ((.cse5 (* c_~top~0 4))) (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|) (+ .cse5 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse5))) 4294967296) 4294967294))) (= 0 (+ 3 c_~top~0))) (<= .cse0 4))) is different from false [2022-03-02 05:50:40,115 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (or (and (let ((.cse1 (* c_~top~0 4))) (= (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse1))) .cse2 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (= |c_~#arr~0.offset| 0) (<= c_~top~0 4) (<= 4 c_~top~0) .cse2 (or (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_73| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_73|)) (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_73| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0))) (= (+ c_~top~0 1) 0)) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_75| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_75|)) (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_75| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (or (forall ((v_ArrVal_1040 Int)) (not (= (mod (let ((.cse3 (* c_~top~0 4))) (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|) (+ .cse3 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse3))) 4294967296) 4294967294))) (= 0 (+ 3 c_~top~0))) (<= .cse0 4))) is different from false [2022-03-02 05:50:41,194 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (<= .cse0 4) .cse1 (or (and (let ((.cse2 (* c_~top~0 4))) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse2) (+ |c_~#arr~0.offset| .cse2))) .cse1 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (or (= (+ c_~top~0 1) 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 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| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0)))) (= |c_~#arr~0.offset| 0) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 4 c_~top~0) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (let ((.cse3 (* c_~top~0 4))) (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| .cse3) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse3))) 4294967296)))) (= 0 (+ 3 c_~top~0))) (<= 0 .cse0) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (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| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))))) is different from false [2022-03-02 05:50:42,267 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (<= .cse0 4) .cse1 (or (= (+ c_~top~0 1) 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 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| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0)))) (or (= (+ c_~top~0 4) 0) (and (let ((.cse2 (* c_~top~0 4))) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse2) (+ |c_~#arr~0.offset| .cse2))) .cse1 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))))) (= |c_~#arr~0.offset| 0) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 4 c_~top~0) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (let ((.cse3 (* c_~top~0 4))) (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| .cse3) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse3))) 4294967296)))) (= 0 (+ 3 c_~top~0))) (<= 0 .cse0) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (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| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))))) is different from false [2022-03-02 05:50:43,407 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse2 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (.cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|))) (and (<= .cse0 4) .cse1 (or (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) (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| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))))) (= (+ c_~top~0 1) 0)) (= |c_~#arr~0.offset| 0) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) (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| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 4 c_~top~0) (<= 0 .cse0) (<= 16 .cse2) (or (and (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse2) (+ |c_~#arr~0.offset| (* c_~top~0 4))) .cse1 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (or (forall ((v_ArrVal_1040 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| (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) (= 0 (+ 3 c_~top~0))))) is different from false [2022-03-02 05:50:44,855 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_~top~0 4)) (.cse5 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse1 (= (+ c_~top~0 1) 0)) (.cse0 (select .cse5 0)) (.cse10 (= (+ c_~top~0 4) 0)) (.cse9 (+ |c_~#arr~0.offset| .cse6)) (.cse3 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse8 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296)))) (.cse4 (= 0 (+ 3 c_~top~0))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse7 (= (+ 2 c_~top~0) 0))) (and (<= .cse0 4) (or (forall ((v_ArrVal_1044 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| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296)))) .cse1) (<= .cse2 4) .cse3 (or .cse4 (forall ((v_ArrVal_1040 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| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))))) (or .cse1 (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 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| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0)))) (not (= 4294967294 (mod (select .cse5 (+ |c_~#arr~0.offset| .cse6 (- 12))) 4294967296))) (or .cse7 (forall ((v_ArrVal_1042 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| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))))) (or (and .cse3 .cse8 (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) .cse9)) .cse10) (<= c_~top~0 |c_t1Thread1of1ForFork0_push_#t~ret35#1|) (not (= 4294967294 (mod (select .cse5 (+ |c_~#arr~0.offset| (- 4) .cse6)) 4294967296))) (<= 0 .cse0) (or .cse10 (and (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse6) .cse9) .cse3 .cse8)) (= |c_~#arr~0.offset| 0) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 4 c_~top~0) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (let ((.cse11 (* c_~top~0 4))) (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| .cse11) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse11))) 4294967296)))) .cse4) (<= 0 .cse2) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod (select .cse5 (+ |c_~#arr~0.offset| .cse6 (- 8))) 4294967296))) (or .cse7 (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (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| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))))))))) is different from false [2022-03-02 05:50:55,832 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 5332 transitions and produced 4373 states. [2022-03-02 05:50:55,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:50:55,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:50:55,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:50:55,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:50:55,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-02 05:50:55,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:50:55,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:50:55,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:50:55,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:50:55,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:50:55,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-02 05:50:55,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-02 05:50:55,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-03-02 05:50:55,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-03-02 05:50:55,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-02 05:50:55,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2022-03-02 05:50:55,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2022-03-02 05:50:55,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-03-02 05:50:56,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-02 05:50:56,054 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-02 05:50:56,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 05:50:56,054 INFO L85 PathProgramCache]: Analyzing trace with hash 941435913, now seen corresponding path program 3 times [2022-03-02 05:50:56,055 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 05:50:56,055 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296538858] [2022-03-02 05:50:56,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:50:56,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 05:50:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:50:56,218 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 355 proven. 165 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-03-02 05:50:56,218 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 05:50:56,219 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296538858] [2022-03-02 05:50:56,219 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296538858] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 05:50:56,220 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197799204] [2022-03-02 05:50:56,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-02 05:50:56,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 05:50:56,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 05:50:56,221 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-02 05:50:56,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-02 05:50:56,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-02 05:50:56,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-02 05:50:56,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-02 05:50:56,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 05:50:57,267 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 520 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-03-02 05:50:57,268 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-02 05:50:57,268 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197799204] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-02 05:50:57,268 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-02 05:50:57,268 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 15 [2022-03-02 05:50:57,268 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761737516] [2022-03-02 05:50:57,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-02 05:50:57,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-02 05:50:57,268 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 05:50:57,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-02 05:50:57,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-03-02 05:50:57,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:50:57,269 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 05:50:57,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.76923076923077) internal successors, (335), 13 states have internal predecessors, (335), 0 states have call successors, (0), 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-03-02 05:50:57,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:50:57,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:50:57,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:50:57,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:50:57,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-02 05:50:57,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:50:57,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:50:57,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:50:57,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:50:57,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 05:50:57,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-02 05:50:57,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-02 05:50:57,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2022-03-02 05:50:57,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2022-03-02 05:50:57,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-02 05:50:57,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 134 states. [2022-03-02 05:50:57,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 138 states. [2022-03-02 05:50:57,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Received shutdown request... [2022-03-02 05:53:08,373 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-02 05:53:08,373 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-03-02 05:53:08,373 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-03-02 05:53:08,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-02 05:53:08,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 05:53:08,574 WARN L594 AbstractCegarLoop]: Verification canceled: while executing DepthFirstTraversal. [2022-03-02 05:53:08,576 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (5 of 6 remaining) [2022-03-02 05:53:08,576 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (4 of 6 remaining) [2022-03-02 05:53:08,577 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2022-03-02 05:53:08,577 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-03-02 05:53:08,577 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-03-02 05:53:08,577 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-03-02 05:53:08,580 INFO L732 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2022-03-02 05:53:08,582 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-02 05:53:08,583 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-02 05:53:08,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.03 05:53:08 BasicIcfg [2022-03-02 05:53:08,584 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-02 05:53:08,584 INFO L158 Benchmark]: Toolchain (without parser) took 830721.02ms. Allocated memory was 194.0MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 136.1MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. [2022-03-02 05:53:08,584 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 194.0MB. Free memory is still 154.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-02 05:53:08,584 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.11ms. Allocated memory was 194.0MB in the beginning and 319.8MB in the end (delta: 125.8MB). Free memory was 135.9MB in the beginning and 272.2MB in the end (delta: -136.3MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. [2022-03-02 05:53:08,585 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.66ms. Allocated memory is still 319.8MB. Free memory was 272.2MB in the beginning and 269.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-02 05:53:08,585 INFO L158 Benchmark]: Boogie Preprocessor took 36.82ms. Allocated memory is still 319.8MB. Free memory was 269.6MB in the beginning and 268.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-02 05:53:08,585 INFO L158 Benchmark]: RCFGBuilder took 425.00ms. Allocated memory is still 319.8MB. Free memory was 268.0MB in the beginning and 250.7MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-03-02 05:53:08,585 INFO L158 Benchmark]: TraceAbstraction took 829778.46ms. Allocated memory was 319.8MB in the beginning and 3.6GB in the end (delta: 3.3GB). Free memory was 250.2MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. [2022-03-02 05:53:08,586 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.09ms. Allocated memory is still 194.0MB. Free memory is still 154.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 425.11ms. Allocated memory was 194.0MB in the beginning and 319.8MB in the end (delta: 125.8MB). Free memory was 135.9MB in the beginning and 272.2MB in the end (delta: -136.3MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.66ms. Allocated memory is still 319.8MB. Free memory was 272.2MB in the beginning and 269.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.82ms. Allocated memory is still 319.8MB. Free memory was 269.6MB in the beginning and 268.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 425.00ms. Allocated memory is still 319.8MB. Free memory was 268.0MB in the beginning and 250.7MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 829778.46ms. Allocated memory was 319.8MB in the beginning and 3.6GB in the end (delta: 3.3GB). Free memory was 250.2MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 3.6GB. 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: 1024]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing DepthFirstTraversal. - 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 executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing DepthFirstTraversal. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 294 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 829.6s, OverallIterations: 18, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 544.9s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 694, 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.4s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 278.3s InterpolantComputationTime, 8658 NumberOfCodeBlocks, 8615 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 11711 ConstructedInterpolants, 144 QuantifiedInterpolants, 133631 SizeOfPredicates, 324 NumberOfNonLiveVariables, 8116 ConjunctsInSsa, 568 ConjunctsInUnsatCore, 41 InterpolantComputations, 8 PerfectInterpolantSequences, 6627/14912 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