/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-POR-NewStatesSleepPersistent-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.abstract-por-f0ea240 [2022-02-11 03:04:59,393 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-11 03:04:59,395 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-11 03:04:59,442 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-11 03:04:59,442 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-11 03:04:59,444 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-11 03:04:59,446 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-11 03:04:59,450 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-11 03:04:59,452 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-11 03:04:59,456 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-11 03:04:59,457 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-11 03:04:59,457 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-11 03:04:59,458 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-11 03:04:59,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-11 03:04:59,459 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-11 03:04:59,459 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-11 03:04:59,459 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-11 03:04:59,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-11 03:04:59,461 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-11 03:04:59,462 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-11 03:04:59,462 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-11 03:04:59,465 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-11 03:04:59,469 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-11 03:04:59,470 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-11 03:04:59,474 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-11 03:04:59,474 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-11 03:04:59,474 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-11 03:04:59,475 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-11 03:04:59,475 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-11 03:04:59,475 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-11 03:04:59,475 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-11 03:04:59,476 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-11 03:04:59,476 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-11 03:04:59,477 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-11 03:04:59,477 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-11 03:04:59,477 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-11 03:04:59,478 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-11 03:04:59,478 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-11 03:04:59,478 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-11 03:04:59,478 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-11 03:04:59,479 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-11 03:04:59,483 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-POR-NewStatesSleepPersistent-NoLbe.epf [2022-02-11 03:04:59,503 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-11 03:04:59,504 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-11 03:04:59,504 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-11 03:04:59,504 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-11 03:04:59,505 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-11 03:04:59,505 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-11 03:04:59,505 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-11 03:04:59,505 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-11 03:04:59,505 INFO L138 SettingsManager]: * Use SBE=true [2022-02-11 03:04:59,505 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-11 03:04:59,506 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-11 03:04:59,506 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-11 03:04:59,506 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-11 03:04:59,506 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-11 03:04:59,506 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-11 03:04:59,506 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-11 03:04:59,507 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-11 03:04:59,507 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-11 03:04:59,507 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-11 03:04:59,507 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-11 03:04:59,507 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-11 03:04:59,507 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-11 03:04:59,507 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-11 03:04:59,507 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-11 03:04:59,507 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-11 03:04:59,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-11 03:04:59,508 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-11 03:04:59,508 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-11 03:04:59,508 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-11 03:04:59,508 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-11 03:04:59,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-11 03:04:59,508 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-11 03:04:59,508 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-02-11 03:04:59,508 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-11 03:04:59,508 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-02-11 03:04:59,508 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES [2022-02-11 03:04:59,508 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-02-11 03:04:59,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-11 03:04:59,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-11 03:04:59,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-11 03:04:59,694 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-11 03:04:59,698 INFO L275 PluginConnector]: CDTParser initialized [2022-02-11 03:04:59,699 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2022-02-11 03:04:59,738 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b226c805/687ddde8d4794a009348447368186c24/FLAG72239e667 [2022-02-11 03:05:00,159 INFO L306 CDTParser]: Found 1 translation units. [2022-02-11 03:05:00,160 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2022-02-11 03:05:00,185 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b226c805/687ddde8d4794a009348447368186c24/FLAG72239e667 [2022-02-11 03:05:00,557 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b226c805/687ddde8d4794a009348447368186c24 [2022-02-11 03:05:00,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-11 03:05:00,559 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-11 03:05:00,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-11 03:05:00,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-11 03:05:00,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-11 03:05:00,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.02 03:05:00" (1/1) ... [2022-02-11 03:05:00,564 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c818c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 03:05:00, skipping insertion in model container [2022-02-11 03:05:00,564 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.02 03:05:00" (1/1) ... [2022-02-11 03:05:00,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-11 03:05:00,591 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-11 03:05:00,875 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i[41323,41336] [2022-02-11 03:05:00,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-11 03:05:00,909 INFO L203 MainTranslator]: Completed pre-run [2022-02-11 03:05:00,936 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i[41323,41336] [2022-02-11 03:05:00,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-11 03:05:00,979 INFO L208 MainTranslator]: Completed translation [2022-02-11 03:05:00,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 03:05:00 WrapperNode [2022-02-11 03:05:00,979 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-11 03:05:00,980 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-11 03:05:00,980 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-11 03:05:00,980 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-11 03:05:00,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 03:05:00" (1/1) ... [2022-02-11 03:05:00,995 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 03:05:00" (1/1) ... [2022-02-11 03:05:01,020 INFO L137 Inliner]: procedures = 271, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 244 [2022-02-11 03:05:01,020 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-11 03:05:01,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-11 03:05:01,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-11 03:05:01,021 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-11 03:05:01,026 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 03:05:00" (1/1) ... [2022-02-11 03:05:01,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 03:05:00" (1/1) ... [2022-02-11 03:05:01,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 03:05:00" (1/1) ... [2022-02-11 03:05:01,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 03:05:00" (1/1) ... [2022-02-11 03:05:01,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 03:05:00" (1/1) ... [2022-02-11 03:05:01,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 03:05:00" (1/1) ... [2022-02-11 03:05:01,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 03:05:00" (1/1) ... [2022-02-11 03:05:01,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-11 03:05:01,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-11 03:05:01,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-11 03:05:01,058 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-11 03:05:01,059 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 03:05:00" (1/1) ... [2022-02-11 03:05:01,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-11 03:05:01,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 03:05:01,095 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-11 03:05:01,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-11 03:05:01,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-11 03:05:01,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-11 03:05:01,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-11 03:05:01,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-11 03:05:01,122 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-11 03:05:01,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-11 03:05:01,122 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-11 03:05:01,122 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-11 03:05:01,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-11 03:05:01,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-11 03:05:01,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-11 03:05:01,123 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-11 03:05:01,203 INFO L234 CfgBuilder]: Building ICFG [2022-02-11 03:05:01,204 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-11 03:05:01,492 INFO L275 CfgBuilder]: Performing block encoding [2022-02-11 03:05:01,499 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-11 03:05:01,499 INFO L299 CfgBuilder]: Removed 35 assume(true) statements. [2022-02-11 03:05:01,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.02 03:05:01 BoogieIcfgContainer [2022-02-11 03:05:01,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-11 03:05:01,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-11 03:05:01,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-11 03:05:01,506 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-11 03:05:01,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.02 03:05:00" (1/3) ... [2022-02-11 03:05:01,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@657d4d9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.02 03:05:01, skipping insertion in model container [2022-02-11 03:05:01,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 03:05:00" (2/3) ... [2022-02-11 03:05:01,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@657d4d9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.02 03:05:01, skipping insertion in model container [2022-02-11 03:05:01,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.02 03:05:01" (3/3) ... [2022-02-11 03:05:01,508 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2022-02-11 03:05:01,512 WARN L154 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-11 03:05:01,512 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-11 03:05:01,517 INFO L168 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-02-11 03:05:01,517 INFO L538 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-11 03:05:01,551 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,551 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,551 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,551 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,551 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,551 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,551 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,552 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,552 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,552 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,552 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,552 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,553 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,553 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,554 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,555 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,556 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,556 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,558 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,558 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,558 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,558 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,558 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,558 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,558 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,558 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,559 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,559 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,559 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,559 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,559 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,559 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,559 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,559 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,559 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,559 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,559 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,560 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,560 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,560 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,560 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,560 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,560 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,560 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,560 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,560 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,560 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,560 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,560 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,560 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,561 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,561 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,561 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,561 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,561 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,561 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,561 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,561 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,561 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,561 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,561 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,562 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,562 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,562 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,562 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,562 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,562 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,563 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,563 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,563 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,563 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,563 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,563 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,564 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,564 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,564 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,564 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,564 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,564 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,564 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,564 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,565 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,565 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,565 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,565 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,565 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,565 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,565 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,565 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,566 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,566 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,566 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,566 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,566 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,566 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,566 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,566 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,566 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,567 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,567 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,567 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,567 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,567 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,567 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,567 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,567 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,567 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,567 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,568 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,568 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,568 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,568 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,568 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,568 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,568 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,568 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,568 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,568 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,568 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,569 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,569 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,569 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,569 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,569 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,569 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,569 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,569 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,569 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,569 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,569 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,569 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,570 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,570 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,570 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,570 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,570 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,570 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,570 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,570 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,570 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,571 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,571 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,571 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,571 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,571 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,571 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,571 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,571 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,571 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,571 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,571 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,572 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,572 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,572 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,572 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,572 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,572 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,572 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,572 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,572 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,572 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,573 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,573 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,573 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,575 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,575 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,575 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,576 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,576 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,576 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,576 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,576 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,576 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,576 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,576 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,576 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,576 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,576 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,577 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,577 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,577 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,577 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,577 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,577 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,577 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,577 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 03:05:01,586 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-02-11 03:05:01,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-11 03:05:01,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 03:05:01,635 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-02-11 03:05:01,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-02-11 03:05:01,663 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2022-02-11 03:05:01,669 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, 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 [2022-02-11 03:05:01,669 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-11 03:05:02,244 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 03:05:02,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 03:05:02,248 INFO L85 PathProgramCache]: Analyzing trace with hash -977869266, now seen corresponding path program 1 times [2022-02-11 03:05:02,254 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 03:05:02,254 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343479960] [2022-02-11 03:05:02,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 03:05:02,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 03:05:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 03:05:02,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1798 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1798 trivial. 0 not checked. [2022-02-11 03:05:02,527 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 03:05:02,527 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343479960] [2022-02-11 03:05:02,528 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343479960] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 03:05:02,528 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 03:05:02,528 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-11 03:05:02,529 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399735987] [2022-02-11 03:05:02,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 03:05:02,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-11 03:05:02,536 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 03:05:02,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-11 03:05:02,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-11 03:05:02,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 03:05:02,554 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 03:05:02,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 65.5) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 03:05:02,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 03:05:02,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 03:05:02,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-11 03:05:02,589 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 03:05:02,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 03:05:02,590 INFO L85 PathProgramCache]: Analyzing trace with hash 2068959553, now seen corresponding path program 1 times [2022-02-11 03:05:02,590 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 03:05:02,591 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286444288] [2022-02-11 03:05:02,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 03:05:02,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 03:05:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 03:05:02,747 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2022-02-11 03:05:02,747 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 03:05:02,748 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286444288] [2022-02-11 03:05:02,748 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286444288] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 03:05:02,748 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 03:05:02,748 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-11 03:05:02,748 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595763512] [2022-02-11 03:05:02,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 03:05:02,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-11 03:05:02,750 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 03:05:02,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-11 03:05:02,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-11 03:05:02,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 03:05:02,751 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 03:05:02,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 03:05:02,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 03:05:02,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 03:05:02,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 03:05:02,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 03:05:02,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-11 03:05:02,787 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 03:05:02,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 03:05:02,787 INFO L85 PathProgramCache]: Analyzing trace with hash 13258517, now seen corresponding path program 1 times [2022-02-11 03:05:02,787 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 03:05:02,787 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529592195] [2022-02-11 03:05:02,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 03:05:02,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 03:05:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 03:05:02,948 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2022-02-11 03:05:02,948 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 03:05:02,949 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529592195] [2022-02-11 03:05:02,949 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529592195] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 03:05:02,949 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262783554] [2022-02-11 03:05:02,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 03:05:02,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 03:05:02,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 03:05:02,955 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-11 03:05:02,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-11 03:05:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 03:05:03,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 730 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-11 03:05:03,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 03:05:03,637 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2022-02-11 03:05:03,638 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-11 03:05:03,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262783554] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 03:05:03,638 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-11 03:05:03,638 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-02-11 03:05:03,638 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760293654] [2022-02-11 03:05:03,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 03:05:03,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-11 03:05:03,639 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 03:05:03,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-11 03:05:03,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-11 03:05:03,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 03:05:03,640 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 03:05:03,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 03:05:03,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 03:05:03,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 03:05:03,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 03:05:03,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 03:05:03,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 03:05:03,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 03:05:03,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-11 03:05:03,958 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,SelfDestructingSolverStorable2 [2022-02-11 03:05:03,958 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 03:05:03,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 03:05:03,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1905563237, now seen corresponding path program 1 times [2022-02-11 03:05:03,959 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 03:05:03,959 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729025816] [2022-02-11 03:05:03,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 03:05:03,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 03:05:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 03:05:04,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1713 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1712 trivial. 0 not checked. [2022-02-11 03:05:04,074 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 03:05:04,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729025816] [2022-02-11 03:05:04,074 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729025816] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 03:05:04,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559811153] [2022-02-11 03:05:04,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 03:05:04,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 03:05:04,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 03:05:04,076 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-11 03:05:04,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-11 03:05:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 03:05:04,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 1155 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-11 03:05:04,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 03:05:04,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1713 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1712 trivial. 0 not checked. [2022-02-11 03:05:04,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 03:05:05,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1713 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1712 trivial. 0 not checked. [2022-02-11 03:05:05,396 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559811153] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 03:05:05,396 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 03:05:05,396 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-11 03:05:05,396 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964725338] [2022-02-11 03:05:05,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 03:05:05,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-11 03:05:05,399 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 03:05:05,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-11 03:05:05,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-11 03:05:05,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 03:05:05,400 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 03:05:05,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 03:05:05,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 03:05:05,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 03:05:05,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 03:05:05,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 03:05:05,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 03:05:05,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 03:05:05,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 03:05:05,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 03:05:05,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-11 03:05:05,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 03:05:05,668 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 03:05:05,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 03:05:05,669 INFO L85 PathProgramCache]: Analyzing trace with hash 776074523, now seen corresponding path program 2 times [2022-02-11 03:05:05,669 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 03:05:05,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136670721] [2022-02-11 03:05:05,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 03:05:05,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 03:05:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 03:05:05,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1730 backedges. 288 proven. 1 refuted. 0 times theorem prover too weak. 1441 trivial. 0 not checked. [2022-02-11 03:05:05,788 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 03:05:05,788 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136670721] [2022-02-11 03:05:05,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136670721] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 03:05:05,788 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029148393] [2022-02-11 03:05:05,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-11 03:05:05,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 03:05:05,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 03:05:05,790 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-11 03:05:05,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-11 03:05:06,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-11 03:05:06,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 03:05:06,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 1175 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-11 03:05:06,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 03:05:06,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1730 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1712 trivial. 0 not checked. [2022-02-11 03:05:06,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 03:05:07,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1730 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1712 trivial. 0 not checked. [2022-02-11 03:05:07,399 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029148393] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 03:05:07,399 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 03:05:07,399 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2022-02-11 03:05:07,400 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641502001] [2022-02-11 03:05:07,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 03:05:07,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-11 03:05:07,400 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 03:05:07,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-11 03:05:07,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-02-11 03:05:07,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 03:05:07,401 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 03:05:07,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.631578947368421) internal successors, (240), 19 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 03:05:07,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 03:05:07,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 03:05:07,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 03:05:07,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 03:05:07,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 03:05:07,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 03:05:07,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 03:05:07,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 03:05:07,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 03:05:07,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-11 03:05:07,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-11 03:05:07,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 03:05:07,875 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 03:05:07,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 03:05:07,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1426636798, now seen corresponding path program 1 times [2022-02-11 03:05:07,875 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 03:05:07,875 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454576282] [2022-02-11 03:05:07,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 03:05:07,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 03:05:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 03:05:08,027 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-11 03:05:08,028 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 03:05:08,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454576282] [2022-02-11 03:05:08,028 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454576282] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 03:05:08,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063232008] [2022-02-11 03:05:08,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 03:05:08,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 03:05:08,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 03:05:08,051 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-11 03:05:08,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-11 03:05:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 03:05:08,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-11 03:05:08,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 03:05:08,461 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-11 03:05:08,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 03:05:08,735 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-11 03:05:08,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063232008] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 03:05:08,735 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 03:05:08,736 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-02-11 03:05:08,736 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302896857] [2022-02-11 03:05:08,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 03:05:08,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-11 03:05:08,736 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 03:05:08,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-11 03:05:08,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-02-11 03:05:08,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 03:05:08,737 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 03:05:08,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 03:05:08,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 03:05:08,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 03:05:08,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 03:05:08,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 03:05:08,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-02-11 03:05:08,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 03:05:08,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 03:05:08,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 03:05:08,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 03:05:08,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 03:05:08,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-11 03:05:08,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-11 03:05:08,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-02-11 03:05:09,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 03:05:09,176 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 03:05:09,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 03:05:09,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1116605654, now seen corresponding path program 2 times [2022-02-11 03:05:09,176 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 03:05:09,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019237181] [2022-02-11 03:05:09,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 03:05:09,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 03:05:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 03:05:11,069 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-11 03:05:11,069 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 03:05:11,069 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019237181] [2022-02-11 03:05:11,069 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019237181] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 03:05:11,069 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771710629] [2022-02-11 03:05:11,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-11 03:05:11,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 03:05:11,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 03:05:11,071 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-11 03:05:11,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-11 03:05:11,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-11 03:05:11,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 03:05:11,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 33 conjunts are in the unsatisfiable core [2022-02-11 03:05:11,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 03:05:11,319 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 7 treesize of output 6 [2022-02-11 03:05:11,698 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-11 03:05:11,698 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-11 03:05:11,814 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 13 treesize of output 15 [2022-02-11 03:05:12,082 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-02-11 03:05:12,772 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 16 treesize of output 18 [2022-02-11 03:05:13,214 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-02-11 03:05:30,323 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 30 treesize of output 26 [2022-02-11 03:05:30,437 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-11 03:05:30,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 03:05:41,069 WARN L838 $PredicateComparison]: unable to prove that (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117| Int) (v_ArrVal_1549 Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1549)) |c_~#cache~0.base|) (+ (- 1) (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117|) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117| 28) |c_~#cache~0.offset|)) 0) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117| 28) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117|))) is different from false [2022-02-11 03:05:41,115 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (Array Int Int)) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117| Int) (v_ArrVal_1549 Int)) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117| 28) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117|) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1547))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1549))) |c_~#cache~0.base|) (+ (- 1) (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117|) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117| 28) |c_~#cache~0.offset|)) 0))) is different from false [2022-02-11 03:05:41,656 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (Array Int Int)) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117| Int) (v_ArrVal_1546 Int) (v_ArrVal_1549 Int)) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1546)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1547))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1549))) |c_~#cache~0.base|) (+ (- 1) (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117|) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117| 28) |c_~#cache~0.offset|)) 0) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117| 28) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117|))) is different from false [2022-02-11 03:05:42,069 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (Array Int Int)) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| Int) (v_ArrVal_1546 Int) (v_ArrVal_1549 Int)) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117| 28) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_1546)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1547))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74| v_ArrVal_1549))) |c_~#cache~0.base|) (+ (- 1) (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117|) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117| 28) |c_~#cache~0.offset|)) 0) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117|))) is different from false [2022-02-11 03:05:42,203 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (Array Int Int)) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| Int) (|~#cache~0.offset| Int) (v_ArrVal_1546 Int) (v_ArrVal_1549 Int)) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| 3)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| 28) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117| 28) (= 0 (select (let ((.cse0 (+ |~#cache~0.offset| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| 1))) (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) .cse0 v_ArrVal_1546)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1547) |c_~#cache~0.base|) .cse0 v_ArrVal_1549)) (+ (- 1) |~#cache~0.offset| (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117|) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117| 28)))) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117|))) is different from false [2022-02-11 03:05:42,569 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (Array Int Int)) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117| Int) (v_ArrVal_1544 (Array Int Int)) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| Int) (|~#cache~0.offset| Int) (v_ArrVal_1546 Int) (v_ArrVal_1549 Int)) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| 3)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| 28) (= (select (let ((.cse1 (+ |~#cache~0.offset| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113| 1))) (store (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1544))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) .cse1 v_ArrVal_1546))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1547) |c_~#cache~0.base|) .cse1 v_ArrVal_1549)) (+ (- 1) |~#cache~0.offset| (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117|) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117| 28))) 0) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117| 28) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_74_113|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72_117|))) is different from false [2022-02-11 03:05:48,590 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 163 [2022-02-11 03:05:48,594 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-11 03:05:48,596 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 61 [2022-02-11 03:05:48,673 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-11 03:05:48,674 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-02-11 03:05:48,686 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 13 not checked. [2022-02-11 03:05:48,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771710629] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 03:05:48,686 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 03:05:48,686 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 19] total 49 [2022-02-11 03:05:48,686 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166997461] [2022-02-11 03:05:48,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 03:05:48,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-02-11 03:05:48,687 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 03:05:48,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-02-11 03:05:48,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1587, Unknown=27, NotChecked=522, Total=2352 [2022-02-11 03:05:48,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 03:05:48,688 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 03:05:48,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 5.408163265306122) internal successors, (265), 49 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 03:05:48,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 03:05:48,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 03:05:48,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 03:05:48,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 03:05:48,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-02-11 03:05:48,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-11 03:05:48,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 03:05:59,586 WARN L228 SmtUtils]: Spent 6.09s on a formula simplification. DAG size of input: 54 DAG size of output: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-11 03:06:11,233 WARN L228 SmtUtils]: Spent 10.27s on a formula simplification. DAG size of input: 70 DAG size of output: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-11 03:06:29,140 WARN L228 SmtUtils]: Spent 8.77s on a formula simplification. DAG size of input: 82 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-11 03:06:48,026 WARN L228 SmtUtils]: Spent 16.89s on a formula simplification. DAG size of input: 68 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-11 03:07:19,741 WARN L228 SmtUtils]: Spent 8.60s on a formula simplification. DAG size of input: 79 DAG size of output: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-11 03:07:19,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 03:07:19,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 03:07:19,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 03:07:19,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 03:07:19,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-11 03:07:19,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-11 03:07:19,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-11 03:07:19,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-11 03:07:20,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 03:07:20,004 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 03:07:20,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 03:07:20,005 INFO L85 PathProgramCache]: Analyzing trace with hash -69176042, now seen corresponding path program 3 times [2022-02-11 03:07:20,005 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 03:07:20,005 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093725741] [2022-02-11 03:07:20,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 03:07:20,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 03:07:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 03:08:10,324 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-11 03:08:10,324 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 03:08:10,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093725741] [2022-02-11 03:08:10,325 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093725741] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 03:08:10,325 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253003309] [2022-02-11 03:08:10,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-11 03:08:10,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 03:08:10,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 03:08:10,326 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-11 03:08:10,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-11 03:08:10,670 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-11 03:08:10,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 03:08:10,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 57 conjunts are in the unsatisfiable core [2022-02-11 03:08:10,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 03:08:10,866 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 7 treesize of output 6 [2022-02-11 03:08:11,302 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-11 03:08:11,302 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-11 03:08:11,413 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 13 treesize of output 15 [2022-02-11 03:08:11,801 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-02-11 03:08:12,430 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-02-11 03:08:32,915 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-02-11 03:08:44,512 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-02-11 03:10:06,601 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 23 treesize of output 25 [2022-02-11 03:10:12,049 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-02-11 03:10:21,581 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-02-11 03:12:06,607 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 30 treesize of output 26 [2022-02-11 03:12:06,975 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 104 refuted. 35 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-11 03:12:06,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 03:12:13,542 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_51| Int)) (or (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_51| 28) |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) 0))) (not (<= (+ |c_t_funThread1of1ForFork0_#t~post41#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_51|)))) is different from false [2022-02-11 03:12:15,579 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_51| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_51| 28) |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_51| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) 0))) is different from false [2022-02-11 03:12:17,748 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_51| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (v_ArrVal_1722 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_51| 28) |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_51| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1722)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) 0))) is different from false [2022-02-11 03:12:17,983 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_51| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (v_ArrVal_1718 (Array Int Int)) (v_ArrVal_1722 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_51| 28) |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_51| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1718))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1722))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) 0))) is different from false [2022-02-11 03:12:18,517 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_51| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| Int) (v_ArrVal_1718 (Array Int Int)) (v_ArrVal_1722 Int)) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1718))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| v_ArrVal_1722))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_51| 28) |c_~#cache~0.offset|)) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_51| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2022-02-11 03:12:18,593 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_51| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| Int) (v_ArrVal_1718 (Array Int Int)) (v_ArrVal_1722 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_51| 28) |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_51| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1718) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| v_ArrVal_1722) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) 0) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79|))) is different from false [2022-02-11 03:12:18,884 WARN L838 $PredicateComparison]: unable to prove that (forall ((|aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| Int) (v_ArrVal_1718 (Array Int Int)) (v_ArrVal_1722 Int) (|aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int)) (let ((.cse0 (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| 28) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|)) (.cse1 (* |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28))) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| (+ |c_t_funThread1of1ForFork0_#t~post41#1| 3)) (>= |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28) (< .cse0 .cse1) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113|) (> 0 |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) (<= (+ .cse1 28) .cse0) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1718) |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| |c_~#cache~0.offset| 1) v_ArrVal_1722) (+ (- 1) (* (- 1) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) .cse1 |c_~#cache~0.offset|)) 0) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) (< |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 3))))) is different from false [2022-02-11 03:12:19,022 WARN L838 $PredicateComparison]: unable to prove that (forall ((|aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| Int) (v_ArrVal_1718 (Array Int Int)) (v_ArrVal_1722 Int) (|aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int)) (let ((.cse0 (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| 28) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|)) (.cse1 (* |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28))) (or (>= |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (< .cse0 .cse1) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113|) (> 0 |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) (<= (+ .cse1 28) .cse0) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1718) |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| |c_~#cache~0.offset| 1) v_ArrVal_1722) (+ (- 1) (* (- 1) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) .cse1 |c_~#cache~0.offset|)) 0) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) (< |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 3))))) is different from false [2022-02-11 03:12:19,918 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1716 Int) (|aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| Int) (v_ArrVal_1718 (Array Int Int)) (v_ArrVal_1722 Int) (|aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int)) (let ((.cse0 (* |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28)) (.cse1 (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| 28) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|))) (or (>= |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (select (store (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1716)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1718) |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| |c_~#cache~0.offset| 1) v_ArrVal_1722) (+ (- 1) (* (- 1) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) .cse0 |c_~#cache~0.offset|)) 0) (< .cse1 .cse0) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113|) (> 0 |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) (<= (+ .cse0 28) .cse1) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) (< |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 3))))) is different from false [2022-02-11 03:12:22,791 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1716 Int) (|aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| Int) (v_ArrVal_1718 (Array Int Int)) (v_ArrVal_1722 Int) (|aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int)) (let ((.cse1 (* |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28)) (.cse0 (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| 28) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|))) (or (>= |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (< .cse0 .cse1) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113|) (= (select (store (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| v_ArrVal_1716)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1718) |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| |c_~#cache~0.offset| 1) v_ArrVal_1722) (+ (- 1) (* (- 1) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) .cse1 |c_~#cache~0.offset|)) 0) (> 0 |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) (<= (+ .cse1 28) .cse0) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) (< |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 3))))) is different from false [2022-02-11 03:12:23,117 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1716 Int) (|aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| Int) (v_ArrVal_1718 (Array Int Int)) (v_ArrVal_1722 Int) (|aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int)) (let ((.cse1 (* |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28)) (.cse0 (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| 28) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|))) (or (>= |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (< .cse0 .cse1) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113|) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| v_ArrVal_1716)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1718) |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| |c_~#cache~0.offset| 1) v_ArrVal_1722) (+ (- 1) (* (- 1) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) .cse1 |c_~#cache~0.offset|)) 0) (> 0 |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) (<= (+ .cse1 28) .cse0) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) (< |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 3))))) is different from false [2022-02-11 03:12:24,175 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1716 Int) (|aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| Int) (v_ArrVal_1718 (Array Int Int)) (v_ArrVal_1722 Int) (|aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int)) (let ((.cse0 (* |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28)) (.cse1 (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| 28) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|))) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| (+ |c_t_funThread1of1ForFork0_#t~post41#1| 4)) (>= |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 4)) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| |c_~#cache~0.offset| 1) v_ArrVal_1716)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1718) |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| |c_~#cache~0.offset| 1) v_ArrVal_1722) (+ (- 1) (* (- 1) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) .cse0 |c_~#cache~0.offset|)) 0) (< .cse1 .cse0) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113|) (> 0 |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) (<= (+ .cse0 28) .cse1) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) (< |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 3))))) is different from false [2022-02-11 03:12:24,323 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1716 Int) (|aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| Int) (v_ArrVal_1718 (Array Int Int)) (v_ArrVal_1722 Int) (|aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int)) (let ((.cse0 (* |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28)) (.cse1 (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| 28) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|))) (or (>= |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 4)) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| |c_~#cache~0.offset| 1) v_ArrVal_1716)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1718) |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| |c_~#cache~0.offset| 1) v_ArrVal_1722) (+ (- 1) (* (- 1) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) .cse0 |c_~#cache~0.offset|)) 0) (< .cse1 .cse0) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| (+ |c_t_funThread1of1ForFork0_~i~0#1| 4)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113|) (> 0 |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) (<= (+ .cse0 28) .cse1) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) (< |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 3))))) is different from false [2022-02-11 03:12:25,933 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1716 Int) (|aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| Int) (v_ArrVal_1718 (Array Int Int)) (v_ArrVal_1722 Int) (|aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int) (v_ArrVal_1713 Int)) (let ((.cse1 (* |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28)) (.cse2 (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| 28) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|))) (or (= (select (store (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1713)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| |c_~#cache~0.offset| 1) v_ArrVal_1716))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1718) |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| |c_~#cache~0.offset| 1) v_ArrVal_1722) (+ (- 1) (* (- 1) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) .cse1 |c_~#cache~0.offset|)) 0) (>= |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 4)) (< .cse2 .cse1) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| (+ |c_t_funThread1of1ForFork0_~i~0#1| 4)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113|) (> 0 |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) (<= (+ .cse1 28) .cse2) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) (< |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 3))))) is different from false [2022-02-11 03:12:29,113 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1716 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| Int) (|aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83| Int) (|aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (v_ArrVal_1718 (Array Int Int)) (v_ArrVal_1722 Int) (v_ArrVal_1713 Int)) (let ((.cse1 (* |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28)) (.cse0 (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| 28) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|))) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (>= |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 4)) (< .cse0 .cse1) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| (+ |c_t_funThread1of1ForFork0_~i~0#1| 4)) (= (select (store (select (store (let ((.cse2 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83| v_ArrVal_1713)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| |c_~#cache~0.offset| 1) v_ArrVal_1716))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1718) |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| |c_~#cache~0.offset| 1) v_ArrVal_1722) (+ (- 1) (* (- 1) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) .cse1 |c_~#cache~0.offset|)) 0) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113|) (> 0 |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) (<= (+ .cse1 28) .cse0) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) (< |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 3))))) is different from false [2022-02-11 03:12:29,906 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1716 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| Int) (|aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int) (|aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|~#cache~0.offset| Int) (v_ArrVal_1718 (Array Int Int)) (v_ArrVal_1722 Int) (v_ArrVal_1713 Int)) (let ((.cse0 (* |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28)) (.cse1 (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| 28) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|))) (or (>= |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 28) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 4)) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 28) |~#cache~0.offset| |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 1) v_ArrVal_1713) (+ |~#cache~0.offset| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 1) v_ArrVal_1716)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1718) |c_~#cache~0.base|) (+ |~#cache~0.offset| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 1) v_ArrVal_1722) (+ (- 1) |~#cache~0.offset| (* (- 1) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) .cse0)) 0) (< .cse1 .cse0) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 5)) (> 0 |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) (<= (+ .cse0 28) .cse1) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) (< |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 3))))) is different from false [2022-02-11 03:12:31,620 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1716 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| Int) (|aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int) (|aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (v_ArrVal_1709 (Array Int Int)) (|~#cache~0.offset| Int) (v_ArrVal_1718 (Array Int Int)) (v_ArrVal_1722 Int) (v_ArrVal_1713 Int)) (let ((.cse1 (* |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28)) (.cse0 (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| 28) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|))) (or (>= |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 28) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 4)) (< .cse0 .cse1) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113|) (= 0 (select (store (select (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1709))) (store .cse2 |c_~#cache~0.base| (store (store (select .cse2 |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 28) |~#cache~0.offset| |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 1) v_ArrVal_1713) (+ |~#cache~0.offset| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 1) v_ArrVal_1716))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1718) |c_~#cache~0.base|) (+ |~#cache~0.offset| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 1) v_ArrVal_1722) (+ (- 1) |~#cache~0.offset| (* (- 1) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) .cse1))) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_83_113| 5)) (> 0 |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) (<= (+ .cse1 28) .cse0) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) (< |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 3))))) is different from false [2022-02-11 03:13:04,876 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-11 03:13:04,877 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-11 03:13:04,877 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-11 03:13:04,880 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-02-11 03:13:04,888 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 162 [2022-02-11 03:13:05,069 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-11 03:13:05,070 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-02-11 03:13:05,088 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 139 not checked. [2022-02-11 03:13:05,088 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253003309] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 03:13:05,088 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 03:13:05,088 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 30, 28] total 82 [2022-02-11 03:13:05,088 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664184696] [2022-02-11 03:13:05,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 03:13:05,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-02-11 03:13:05,089 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 03:13:05,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-02-11 03:13:05,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=3697, Unknown=185, NotChecked=2414, Total=6642 [2022-02-11 03:13:05,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 03:13:05,091 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 03:13:05,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 5.865853658536586) internal successors, (481), 82 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 03:13:05,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 03:13:05,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 03:13:05,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 03:13:05,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 03:13:05,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-02-11 03:13:05,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-11 03:13:05,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2022-02-11 03:13:05,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 03:13:47,761 WARN L228 SmtUtils]: Spent 20.11s on a formula simplification. DAG size of input: 188 DAG size of output: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-11 03:14:28,388 WARN L228 SmtUtils]: Spent 25.64s on a formula simplification. DAG size of input: 201 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-11 03:15:48,662 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse52 (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse45 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (let ((.cse81 (store .cse52 .cse45 0)) (.cse1 ((as const (Array Int Int)) 0))) (let ((.cse38 (@diff .cse81 .cse1))) (let ((.cse82 (store .cse81 .cse38 0))) (let ((.cse44 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse36 (@diff .cse82 .cse1)) (.cse79 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (let ((.cse76 (@diff .cse79 .cse1)) (.cse80 (store .cse82 .cse36 0)) (.cse72 (@diff .cse44 .cse1))) (let ((.cse73 (store .cse44 .cse72 0)) (.cse35 (@diff .cse80 .cse1)) (.cse77 (store .cse79 .cse76 0))) (let ((.cse78 (@diff .cse77 .cse1)) (.cse75 (store .cse80 .cse35 0)) (.cse74 (@diff .cse73 .cse1))) (let ((.cse70 (store .cse73 .cse74 0)) (.cse37 (= .cse1 .cse82)) (.cse31 (= .cse1 .cse75)) (.cse39 (= .cse81 .cse1)) (.cse32 (@diff .cse75 .cse1)) (.cse34 (= .cse1 .cse80)) (.cse15 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse63 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse10 (store .cse79 .cse45 0)) (.cse71 (= .cse1 .cse79)) (.cse26 (store .cse77 .cse78 0)) (.cse6 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (let ((.cse11 (or (= .cse1 .cse77) (<= (+ .cse78 28) .cse6))) (.cse13 (= .cse1 .cse26)) (.cse14 (or (<= (+ .cse76 28) .cse6) .cse71)) (.cse4 (= .cse1 .cse10)) (.cse7 (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|)) (.cse33 (+ |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (.cse30 (= .cse1 .cse63)) (.cse0 (not .cse15)) (.cse16 (or .cse34 (<= (+ .cse35 28) .cse6))) (.cse18 (= .cse1 (store .cse75 .cse32 0))) (.cse19 (or (<= (+ .cse38 28) .cse6) .cse39)) (.cse20 (or .cse31 (<= (+ .cse32 28) .cse6))) (.cse8 (= |c_ULTIMATE.start_main_~i~3#1| 0)) (.cse9 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse21 (or .cse37 (<= (+ .cse36 28) .cse6))) (.cse22 (<= 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (.cse17 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse69 (= .cse70 .cse1)) (.cse66 (or (= .cse1 .cse73) (<= (+ .cse74 28) .cse6))) (.cse67 (or (= .cse1 .cse44) (<= (+ .cse72 28) .cse6))) (.cse12 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (or .cse0 (let ((.cse5 (@diff .cse10 .cse1))) (let ((.cse2 (store .cse10 .cse5 0))) (let ((.cse3 (@diff .cse2 .cse1))) (and (= .cse1 (store .cse2 .cse3 0)) (or .cse4 (<= (+ 28 .cse5) .cse6)) .cse7 (or (= .cse1 .cse2) (<= (+ 28 .cse3) .cse6)) .cse8 .cse9))))) (or .cse0 .cse8) (or (and .cse11 .cse12 .cse13 .cse14) .cse15) (exists ((|aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (v_ArrVal_1716 Int) (|aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1722 Int)) (and (= (select |c_#memory_int| |c_~#cache~0.base|) (store (store ((as const (Array Int Int)) 0) (+ |c_~#cache~0.offset| (* 28 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (* (- 1) |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|)) v_ArrVal_1716) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1722)) (< |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 28) (<= 0 |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (<= (+ 2 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) |c_t_funThread1of1ForFork0_~i~0#1|))) (or .cse0 (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse8 .cse21 .cse22)) (exists ((|aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (v_ArrVal_1716 Int) (|aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1713 Int)) (and (= (select |c_#memory_int| |c_~#cache~0.base|) (store (store ((as const (Array Int Int)) 0) (+ |c_~#cache~0.offset| (* 28 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (* (- 1) |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|)) v_ArrVal_1713) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1716)) (< |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 28) (<= 0 |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (<= (+ |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 1) |c_t_funThread1of1ForFork0_~i~0#1|) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)))) (or (let ((.cse23 (@diff .cse26 .cse1))) (let ((.cse24 (store .cse26 .cse23 0))) (let ((.cse25 (@diff .cse24 .cse1))) (and .cse11 .cse12 (or (<= (+ .cse23 28) .cse6) .cse13) (= .cse1 (store .cse24 .cse25 0)) (or (= .cse1 .cse24) (<= (+ .cse25 28) .cse6)) .cse14)))) .cse15) .cse17 (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) .cse12 (forall ((v_ArrVal_1716 Int) (|aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| Int) (v_ArrVal_1718 (Array Int Int)) (v_ArrVal_1722 Int) (|aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int) (v_ArrVal_1713 Int)) (let ((.cse28 (* |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28)) (.cse29 (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| 28) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|))) (or (= (select (store (select (store (let ((.cse27 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1713)))) (store .cse27 |c_~#cache~0.base| (store (select .cse27 |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| |c_~#cache~0.offset| 1) v_ArrVal_1716))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1718) |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| |c_~#cache~0.offset| 1) v_ArrVal_1722) (+ (- 1) (* (- 1) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) .cse28 |c_~#cache~0.offset|)) 0) (>= |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 4)) (< .cse29 .cse28) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| (+ |c_t_funThread1of1ForFork0_~i~0#1| 4)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113|) (> 0 |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) (<= (+ .cse28 28) .cse29) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) (< |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 3))))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| .cse6) (or (and .cse17 .cse30) .cse15) (or .cse0 (and .cse4 .cse8 .cse9)) .cse30 (exists ((|aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (|aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (v_ArrVal_1722 Int)) (and (< |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 28) (<= 0 |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (<= (+ 3 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) |c_t_funThread1of1ForFork0_~i~0#1|) (= (store ((as const (Array Int Int)) 0) (+ |c_~#cache~0.offset| (* 28 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (* (- 1) |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|)) v_ArrVal_1722) (select |c_#memory_int| |c_~#cache~0.base|)))) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (or .cse0 (and (or .cse31 (<= .cse32 .cse33)) .cse18 (<= 1 |c_t_funThread1of1ForFork0_#t~post41#1|) (or .cse34 (<= .cse35 .cse33)) (or (<= .cse36 .cse33) .cse37) .cse8 (or (<= .cse38 .cse33) .cse39))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse6) (or .cse0 (let ((.cse43 (store .cse44 .cse45 0))) (let ((.cse42 (@diff .cse43 .cse1))) (let ((.cse41 (store .cse43 .cse42 0))) (let ((.cse40 (@diff .cse41 .cse1))) (and .cse7 (or (<= (+ .cse40 28) .cse6) (= .cse41 .cse1)) (or (<= (+ .cse42 28) .cse6) (= .cse1 .cse43)) .cse8 (= .cse1 (store .cse41 .cse40 0)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|))))))) (exists ((|aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (|aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (v_ArrVal_1713 Int)) (and (< |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 28) (<= 0 |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (<= (+ |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 1) |c_t_funThread1of1ForFork0_~i~0#1|) (= (store ((as const (Array Int Int)) 0) (+ |c_~#cache~0.offset| (* 28 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (* (- 1) |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|)) v_ArrVal_1713) (select |c_#memory_int| |c_~#cache~0.base|)))) (= |c_~#cache~0.offset| 0) (or .cse0 (and .cse17 .cse39 .cse8)) (or (let ((.cse53 (@diff .cse52 .cse1))) (let ((.cse54 (store .cse52 .cse53 0))) (let ((.cse55 (@diff .cse54 .cse1))) (let ((.cse47 (store .cse54 .cse55 0))) (let ((.cse46 (@diff .cse47 .cse1))) (let ((.cse50 (store .cse47 .cse46 0))) (let ((.cse51 (@diff .cse50 .cse1))) (let ((.cse48 (store .cse50 .cse51 0))) (let ((.cse49 (@diff .cse48 .cse1))) (and (or (<= (+ .cse46 28) .cse6) (= .cse1 .cse47)) (= .cse1 (store .cse48 .cse49 0)) (or (= .cse1 .cse50) (<= (+ 28 .cse51) .cse6)) (= |c_ULTIMATE.start_main_#t~post43#1| 0) (or (= .cse1 .cse48) (<= (+ .cse49 28) .cse6)) (or (= .cse1 .cse52) (<= (+ .cse53 28) .cse6)) (or (= .cse1 .cse54) (<= (+ .cse55 28) .cse6)) .cse9 .cse22)))))))))) .cse0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or (let ((.cse62 (@diff .cse63 .cse1))) (let ((.cse58 (store .cse63 .cse62 0))) (let ((.cse59 (@diff .cse58 .cse1))) (let ((.cse61 (store .cse58 .cse59 0))) (let ((.cse60 (@diff .cse61 .cse1))) (let ((.cse57 (store .cse61 .cse60 0))) (let ((.cse56 (@diff .cse57 .cse1))) (and (or (<= .cse56 .cse33) (= .cse1 .cse57)) (= .cse1 (store .cse57 .cse56 0)) (or (= .cse1 .cse58) (<= .cse59 .cse33)) (or (<= .cse60 .cse33) (= .cse1 .cse61)) (or (<= .cse62 .cse33) .cse30))))))))) .cse15) (exists ((|aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (v_ArrVal_1716 Int) (|aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int)) (and (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) (+ |c_~#cache~0.offset| (* 28 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (* (- 1) |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|)) v_ArrVal_1716)) (< |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 28) (<= 0 |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (<= (+ 2 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) |c_t_funThread1of1ForFork0_~i~0#1|))) (or (let ((.cse68 (@diff .cse70 .cse1))) (let ((.cse64 (store .cse70 .cse68 0))) (let ((.cse65 (@diff .cse64 .cse1))) (and .cse17 (= .cse1 (store .cse64 .cse65 0)) .cse66 .cse67 (or (<= (+ .cse68 28) .cse6) .cse69) (or (= .cse64 .cse1) (<= (+ .cse65 28) .cse6)))))) .cse15) (= |c_~#cache~0.base| 4) (or .cse0 (and .cse16 .cse18 .cse19 .cse20 .cse8 .cse9 .cse21 .cse22)) (or (and .cse17 .cse69 .cse66 .cse67) .cse15) (or (and .cse12 .cse71) .cse15)))))))))))) is different from true [2022-02-11 03:16:33,892 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (let ((.cse0 ((as const (Array Int Int)) 0)) (.cse8 (store .cse15 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse20 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) (let ((.cse10 (not .cse20)) (.cse9 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)) (.cse6 (= |c_ULTIMATE.start_main_~i~3#1| 0)) (.cse7 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse3 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse11 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse17 (= .cse0 .cse8))) (and (exists ((|aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (v_ArrVal_1715 Int) (|aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (v_ArrVal_1713 Int)) (and (< |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 28) (= (store (store ((as const (Array Int Int)) 0) (+ |c_~#cache~0.offset| (* 28 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (* (- 1) |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|)) v_ArrVal_1713) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1715) (select |c_#memory_int| |c_~#cache~0.base|)) (<= 0 |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (<= (+ |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 1) |c_t_funThread1of1ForFork0_~i~0#1|))) (or (let ((.cse4 (store .cse8 .cse9 0))) (let ((.cse5 (@diff .cse4 .cse0))) (let ((.cse1 (store .cse4 .cse5 0))) (let ((.cse2 (@diff .cse1 .cse0))) (and (or (= .cse0 .cse1) (<= (+ .cse2 28) .cse3)) (= .cse0 (store .cse1 .cse2 0)) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (or (= .cse0 .cse4) (<= (+ .cse5 28) .cse3)) .cse6 .cse7))))) .cse10) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (exists ((v_ArrVal_1711 Int)) (= (store ((as const (Array Int Int)) 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1711) (select |c_#memory_int| |c_~#cache~0.base|))) .cse11 (exists ((|aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (v_ArrVal_1716 Int) (|aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (v_ArrVal_1719 Int)) (and (< |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 28) (<= 0 |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (= (select |c_#memory_int| |c_~#cache~0.base|) (store (store ((as const (Array Int Int)) 0) (+ |c_~#cache~0.offset| (* 28 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (* (- 1) |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|)) v_ArrVal_1716) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1719)) (<= (+ 2 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) |c_t_funThread1of1ForFork0_~i~0#1|))) (forall ((v_ArrVal_1716 Int) (|aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| Int) (v_ArrVal_1718 (Array Int Int)) (v_ArrVal_1722 Int) (|aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int) (v_ArrVal_1713 Int)) (let ((.cse13 (* |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28)) (.cse14 (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| 28) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|))) (or (= (select (store (select (store (let ((.cse12 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1713)))) (store .cse12 |c_~#cache~0.base| (store (select .cse12 |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| |c_~#cache~0.offset| 1) v_ArrVal_1716))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1718) |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| |c_~#cache~0.offset| 1) v_ArrVal_1722) (+ (- 1) (* (- 1) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) .cse13 |c_~#cache~0.offset|)) 0) (>= |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 4)) (< .cse14 .cse13) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| (+ |c_t_funThread1of1ForFork0_~i~0#1| 4)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113|) (> 0 |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) (<= (+ .cse13 28) .cse14) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) (< |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 3))))) (or .cse10 (and (= .cse0 (store (store .cse15 .cse9 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) .cse6 .cse7)) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse3) (= |c_~#cache~0.offset| 0) (or (let ((.cse16 (@diff .cse8 .cse0))) (let ((.cse18 (store .cse8 .cse16 0))) (let ((.cse19 (@diff .cse18 .cse0))) (and (or (<= (+ .cse16 28) .cse3) .cse17) .cse11 (= .cse0 (store .cse18 .cse19 0)) (or (<= (+ 28 .cse19) .cse3) (= .cse0 .cse18)))))) .cse20) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or (and .cse11 .cse17) .cse20) (= |c_~#cache~0.base| 4))))) is different from false [2022-02-11 03:16:35,922 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (let ((.cse0 ((as const (Array Int Int)) 0)) (.cse8 (store .cse11 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse19 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) (let ((.cse10 (not .cse19)) (.cse9 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)) (.cse6 (= |c_ULTIMATE.start_main_~i~3#1| 0)) (.cse7 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse3 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse16 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse15 (= .cse0 .cse8))) (and (exists ((|aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (v_ArrVal_1716 Int) (|aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1722 Int)) (and (= (select |c_#memory_int| |c_~#cache~0.base|) (store (store ((as const (Array Int Int)) 0) (+ |c_~#cache~0.offset| (* 28 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (* (- 1) |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|)) v_ArrVal_1716) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1722)) (< |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 28) (<= 0 |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (<= (+ 2 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) |c_t_funThread1of1ForFork0_~i~0#1|))) (exists ((|aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (v_ArrVal_1716 Int) (|aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1713 Int)) (and (= (select |c_#memory_int| |c_~#cache~0.base|) (store (store ((as const (Array Int Int)) 0) (+ |c_~#cache~0.offset| (* 28 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (* (- 1) |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|)) v_ArrVal_1713) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1716)) (< |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 28) (<= 0 |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (<= (+ |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 1) |c_t_funThread1of1ForFork0_~i~0#1|) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)))) (or (let ((.cse4 (store .cse8 .cse9 0))) (let ((.cse5 (@diff .cse4 .cse0))) (let ((.cse1 (store .cse4 .cse5 0))) (let ((.cse2 (@diff .cse1 .cse0))) (and (or (= .cse0 .cse1) (<= (+ .cse2 28) .cse3)) (= .cse0 (store .cse1 .cse2 0)) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (or (= .cse0 .cse4) (<= (+ .cse5 28) .cse3)) .cse6 .cse7))))) .cse10) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (or .cse10 (and (= .cse0 (store (store .cse11 .cse9 0) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) .cse6 .cse7)) (forall ((v_ArrVal_1716 Int) (|aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| Int) (v_ArrVal_1718 (Array Int Int)) (v_ArrVal_1722 Int) (|aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int)) (let ((.cse12 (* |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28)) (.cse13 (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| 28) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|))) (or (>= |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 4)) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| |c_~#cache~0.offset| 1) v_ArrVal_1716)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1718) |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| |c_~#cache~0.offset| 1) v_ArrVal_1722) (+ (- 1) (* (- 1) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) .cse12 |c_~#cache~0.offset|)) 0) (< .cse13 .cse12) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| (+ |c_t_funThread1of1ForFork0_~i~0#1| 4)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113|) (> 0 |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) (<= (+ .cse12 28) .cse13) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) (< |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 3))))) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1713 Int)) (and (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= (store ((as const (Array Int Int)) 0) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1713) (select |c_#memory_int| |c_~#cache~0.base|)))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse3) (= |c_~#cache~0.offset| 0) (or (let ((.cse14 (@diff .cse8 .cse0))) (let ((.cse17 (store .cse8 .cse14 0))) (let ((.cse18 (@diff .cse17 .cse0))) (and (or (<= (+ .cse14 28) .cse3) .cse15) .cse16 (= .cse0 (store .cse17 .cse18 0)) (or (<= (+ 28 .cse18) .cse3) (= .cse0 .cse17)))))) .cse19) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or (and .cse16 .cse15) .cse19) (= |c_~#cache~0.base| 4))))) is different from false [2022-02-11 03:16:37,947 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse3 ((as const (Array Int Int)) 0))) (let ((.cse30 (@diff .cse10 .cse3))) (let ((.cse28 (store .cse10 .cse30 0))) (let ((.cse29 (@diff .cse28 .cse3))) (let ((.cse18 (store .cse28 .cse29 0)) (.cse6 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse19 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) (let ((.cse2 (not .cse19)) (.cse9 (= |c_ULTIMATE.start_main_~i~3#1| 0)) (.cse11 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)) (.cse14 (or (<= .cse30 .cse6) (= .cse3 .cse10))) (.cse15 (= .cse3 .cse18)) (.cse17 (or (= .cse3 .cse28) (<= .cse29 .cse6)))) (and (exists ((|aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (v_ArrVal_1716 Int) (|aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1722 Int)) (and (= (select |c_#memory_int| |c_~#cache~0.base|) (store (store ((as const (Array Int Int)) 0) (+ |c_~#cache~0.offset| (* 28 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (* (- 1) |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|)) v_ArrVal_1716) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1722)) (< |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 28) (<= 0 |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (<= (+ 2 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) |c_t_funThread1of1ForFork0_~i~0#1|))) (exists ((|aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (v_ArrVal_1716 Int) (|aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1713 Int)) (and (= (select |c_#memory_int| |c_~#cache~0.base|) (store (store ((as const (Array Int Int)) 0) (+ |c_~#cache~0.offset| (* 28 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (* (- 1) |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|)) v_ArrVal_1713) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1716)) (< |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 28) (<= 0 |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (<= (+ |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 1) |c_t_funThread1of1ForFork0_~i~0#1|) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)))) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (forall ((v_ArrVal_1716 Int) (|aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| Int) (v_ArrVal_1718 (Array Int Int)) (v_ArrVal_1722 Int) (|aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int)) (let ((.cse0 (* |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28)) (.cse1 (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| 28) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|))) (or (>= |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 4)) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| |c_~#cache~0.offset| 1) v_ArrVal_1716)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1718) |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| |c_~#cache~0.offset| 1) v_ArrVal_1722) (+ (- 1) (* (- 1) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) .cse0 |c_~#cache~0.offset|)) 0) (< .cse1 .cse0) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| (+ |c_t_funThread1of1ForFork0_~i~0#1| 4)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113|) (> 0 |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) (<= (+ .cse0 28) .cse1) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) (< |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 3))))) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1713 Int)) (and (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= (store ((as const (Array Int Int)) 0) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1713) (select |c_#memory_int| |c_~#cache~0.base|)))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or .cse2 (let ((.cse8 (store .cse10 .cse11 0))) (let ((.cse7 (@diff .cse8 .cse3))) (let ((.cse4 (store .cse8 .cse7 0))) (let ((.cse5 (@diff .cse4 .cse3))) (and (= .cse3 (store .cse4 .cse5 0)) (or (= .cse3 .cse4) (<= .cse5 .cse6)) (or (<= .cse7 .cse6) (= .cse3 .cse8)) .cse9)))))) (or (let ((.cse16 (@diff .cse18 .cse3))) (let ((.cse12 (store .cse18 .cse16 0))) (let ((.cse13 (@diff .cse12 .cse3))) (and (= .cse3 (store .cse12 .cse13 0)) .cse14 (or (<= .cse13 .cse6) (= .cse3 .cse12)) (or .cse15 (<= .cse16 .cse6)) .cse17)))) .cse19) (or .cse2 (let ((.cse23 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse11 0))) (let ((.cse22 (@diff .cse23 .cse3))) (let ((.cse20 (store .cse23 .cse22 0))) (let ((.cse21 (@diff .cse20 .cse3))) (let ((.cse26 (store .cse20 .cse21 0))) (let ((.cse27 (@diff .cse26 .cse3))) (let ((.cse24 (store .cse26 .cse27 0))) (let ((.cse25 (@diff .cse24 .cse3))) (and (or (= .cse3 .cse20) (<= .cse21 .cse6)) (or (<= .cse22 .cse6) (= .cse23 .cse3)) (= .cse3 (store .cse24 .cse25 0)) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (or (= .cse3 .cse26) (<= .cse27 .cse6)) (or (= .cse3 .cse24) (<= .cse25 .cse6)) .cse9)))))))))) (or (and .cse14 .cse15 .cse17) .cse19) (= |c_~#cache~0.base| 4)))))))) is different from false [2022-02-11 03:16:40,014 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse29 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse3 ((as const (Array Int Int)) 0))) (let ((.cse21 (@diff .cse29 .cse3))) (let ((.cse30 (store .cse29 .cse21 0))) (let ((.cse18 (@diff .cse30 .cse3))) (let ((.cse24 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse23 (store .cse30 .cse18 0))) (let ((.cse6 (+ |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (.cse17 (= .cse3 .cse30)) (.cse20 (= .cse3 .cse23)) (.cse22 (= .cse3 .cse29)) (.cse2 (not .cse24)) (.cse11 (= |c_ULTIMATE.start_main_~i~3#1| 0)) (.cse14 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (and (= |c_t_funThread1of1ForFork0_#t~post41#1| 0) (forall ((v_ArrVal_1716 Int) (|aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| Int) (v_ArrVal_1718 (Array Int Int)) (v_ArrVal_1722 Int) (|aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int)) (let ((.cse0 (* |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28)) (.cse1 (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| 28) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|))) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| (+ |c_t_funThread1of1ForFork0_#t~post41#1| 4)) (>= |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 4)) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113| |c_~#cache~0.offset| 1) v_ArrVal_1716)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1718) |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| |c_~#cache~0.offset| 1) v_ArrVal_1722) (+ (- 1) (* (- 1) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) .cse0 |c_~#cache~0.offset|)) 0) (< .cse1 .cse0) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81_113|) (> 0 |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) (<= (+ .cse0 28) .cse1) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) (< |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 3))))) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (exists ((|aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (|aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (v_ArrVal_1722 Int)) (and (<= (+ 2 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) |c_t_funThread1of1ForFork0_#t~post41#1|) (< |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 28) (<= 0 |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (= (store ((as const (Array Int Int)) 0) (+ |c_~#cache~0.offset| (* 28 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (* (- 1) |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|)) v_ArrVal_1722) (select |c_#memory_int| |c_~#cache~0.base|)))) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (or .cse2 (let ((.cse13 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse14 0))) (let ((.cse12 (@diff .cse13 .cse3))) (let ((.cse10 (store .cse13 .cse12 0))) (let ((.cse9 (@diff .cse10 .cse3))) (let ((.cse7 (store .cse10 .cse9 0))) (let ((.cse8 (@diff .cse7 .cse3))) (let ((.cse4 (store .cse7 .cse8 0))) (let ((.cse5 (@diff .cse4 .cse3))) (and (or (= .cse3 .cse4) (<= .cse5 .cse6)) (= .cse3 (store .cse4 .cse5 0)) (<= 1 |c_t_funThread1of1ForFork0_#t~post41#1|) (or (= .cse3 .cse7) (<= .cse8 .cse6)) (or (<= .cse9 .cse6) (= .cse3 .cse10)) .cse11 (or (<= .cse12 .cse6) (= .cse13 .cse3)))))))))))) (exists ((|aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (|aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (v_ArrVal_1713 Int)) (and (< |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 28) (<= 0 |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (= (store ((as const (Array Int Int)) 0) (+ |c_~#cache~0.offset| (* 28 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (* (- 1) |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|)) v_ArrVal_1713) (select |c_#memory_int| |c_~#cache~0.base|)) (<= |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| |c_t_funThread1of1ForFork0_#t~post41#1|))) (= |c_~#cache~0.offset| 0) (exists ((|aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (v_ArrVal_1716 Int) (|aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int)) (and (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) (+ |c_~#cache~0.offset| (* 28 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (* (- 1) |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|)) v_ArrVal_1716)) (< |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 28) (<= 0 |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (<= (+ |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 1) |c_t_funThread1of1ForFork0_#t~post41#1|))) (or (let ((.cse19 (@diff .cse23 .cse3))) (let ((.cse16 (store .cse23 .cse19 0))) (let ((.cse15 (@diff .cse16 .cse3))) (and (or (<= .cse15 .cse6) (= .cse3 .cse16)) (= .cse3 (store .cse16 .cse15 0)) (or .cse17 (<= .cse18 .cse6)) (or (<= .cse19 .cse6) .cse20) (or (<= .cse21 .cse6) .cse22))))) .cse24) (or (and (or .cse17 (<= .cse18 |c_~#cache~0.offset|)) .cse20 (or (<= .cse21 |c_~#cache~0.offset|) .cse22)) .cse24) (or .cse2 (let ((.cse28 (store .cse29 .cse14 0))) (let ((.cse27 (@diff .cse28 .cse3))) (let ((.cse25 (store .cse28 .cse27 0))) (let ((.cse26 (@diff .cse25 .cse3))) (and (= .cse3 (store .cse25 .cse26 0)) (or (<= .cse26 |c_~#cache~0.offset|) (= .cse3 .cse25)) (or (<= .cse27 |c_~#cache~0.offset|) (= .cse3 .cse28)) .cse11)))))) (= |c_~#cache~0.base| 4)))))))) is different from false [2022-02-11 03:16:42,061 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse2 ((as const (Array Int Int)) 0))) (let ((.cse28 (@diff .cse18 .cse2))) (let ((.cse29 (store .cse18 .cse28 0))) (let ((.cse30 (@diff .cse29 .cse2))) (let ((.cse11 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse10 (store .cse29 .cse30 0)) (.cse7 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (let ((.cse5 (or (= .cse2 .cse29) (<= (+ .cse30 28) .cse7))) (.cse8 (= .cse2 .cse10)) (.cse9 (or (= .cse2 .cse18) (<= (+ 28 .cse28) .cse7))) (.cse12 (not .cse11)) (.cse15 (= |c_ULTIMATE.start_main_~i~3#1| 0)) (.cse19 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (and (forall ((v_ArrVal_1716 Int) (|aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| Int) (v_ArrVal_1718 (Array Int Int)) (v_ArrVal_1722 Int) (|aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int)) (let ((.cse1 (* |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28)) (.cse0 (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| 28) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|))) (or (>= |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (< .cse0 .cse1) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113|) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| v_ArrVal_1716)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1718) |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| |c_~#cache~0.offset| 1) v_ArrVal_1722) (+ (- 1) (* (- 1) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) .cse1 |c_~#cache~0.offset|)) 0) (> 0 |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) (<= (+ .cse1 28) .cse0) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) (< |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 3))))) (or (let ((.cse6 (@diff .cse10 .cse2))) (let ((.cse3 (store .cse10 .cse6 0))) (let ((.cse4 (@diff .cse3 .cse2))) (and (= .cse2 (store .cse3 .cse4 0)) .cse5 (or (<= (+ .cse6 28) .cse7) .cse8) (or (<= (+ .cse4 28) .cse7) (= .cse2 .cse3)) .cse9)))) .cse11) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (or (and .cse5 .cse8 .cse9) .cse11) (or .cse12 (let ((.cse16 (store .cse18 .cse19 0))) (let ((.cse17 (@diff .cse16 .cse2))) (let ((.cse13 (store .cse16 .cse17 0))) (let ((.cse14 (@diff .cse13 .cse2))) (and (= .cse2 (store .cse13 .cse14 0)) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) .cse15 (or (= .cse2 .cse16) (<= (+ .cse17 28) .cse7)) (or (<= (+ .cse14 28) .cse7) (= .cse2 .cse13)))))))) (exists ((|aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (|aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (v_ArrVal_1722 Int)) (and (< |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 28) (<= 0 |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (<= (+ 3 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) |c_t_funThread1of1ForFork0_~i~0#1|) (= (store ((as const (Array Int Int)) 0) (+ |c_~#cache~0.offset| (* 28 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (* (- 1) |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|)) v_ArrVal_1722) (select |c_#memory_int| |c_~#cache~0.base|)))) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (exists ((|aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (|aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (v_ArrVal_1713 Int)) (and (< |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 28) (<= 0 |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (<= (+ |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 1) |c_t_funThread1of1ForFork0_~i~0#1|) (= (store ((as const (Array Int Int)) 0) (+ |c_~#cache~0.offset| (* 28 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (* (- 1) |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|)) v_ArrVal_1713) (select |c_#memory_int| |c_~#cache~0.base|)))) (= |c_~#cache~0.offset| 0) (or .cse12 (let ((.cse25 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse19 0))) (let ((.cse24 (@diff .cse25 .cse2))) (let ((.cse26 (store .cse25 .cse24 0))) (let ((.cse27 (@diff .cse26 .cse2))) (let ((.cse20 (store .cse26 .cse27 0))) (let ((.cse21 (@diff .cse20 .cse2))) (let ((.cse22 (store .cse20 .cse21 0))) (let ((.cse23 (@diff .cse22 .cse2))) (and (or (= .cse2 .cse20) (<= (+ .cse21 28) .cse7)) (= .cse2 (store .cse22 .cse23 0)) (or (<= (+ .cse24 28) .cse7) (= .cse25 .cse2)) (or (= .cse2 .cse22) (<= (+ .cse23 28) .cse7)) .cse15 (or (= .cse2 .cse26) (<= (+ .cse27 28) .cse7)) (<= 2 |c_t_funThread1of1ForFork0_~i~0#1|))))))))))) (exists ((|aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (v_ArrVal_1716 Int) (|aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int)) (and (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) (+ |c_~#cache~0.offset| (* 28 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (* (- 1) |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|)) v_ArrVal_1716)) (< |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 28) (<= 0 |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (<= (+ 2 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) |c_t_funThread1of1ForFork0_~i~0#1|))) (= |c_~#cache~0.base| 4)))))))) is different from false [2022-02-11 03:16:44,151 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0))) (let ((.cse29 (@diff .cse20 .cse1))) (let ((.cse30 (store .cse20 .cse29 0))) (let ((.cse31 (@diff .cse30 .cse1))) (let ((.cse4 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse27 (store .cse30 .cse31 0)) (.cse28 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) (let ((.cse0 (not .cse28)) (.cse10 (= |c_ULTIMATE.start_main_~i~3#1| 0)) (.cse13 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|)) (.cse5 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse26 (= .cse27 .cse1)) (.cse23 (or (= .cse1 .cse30) (<= (+ .cse31 28) .cse4))) (.cse24 (or (= .cse1 .cse20) (<= (+ .cse29 28) .cse4)))) (and (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| 4) (or .cse0 (let ((.cse9 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse13 0))) (let ((.cse8 (@diff .cse9 .cse1))) (let ((.cse11 (store .cse9 .cse8 0))) (let ((.cse12 (@diff .cse11 .cse1))) (let ((.cse2 (store .cse11 .cse12 0))) (let ((.cse3 (@diff .cse2 .cse1))) (let ((.cse6 (store .cse2 .cse3 0))) (let ((.cse7 (@diff .cse6 .cse1))) (and (or (= .cse1 .cse2) (<= (+ .cse3 28) .cse4)) .cse5 (= .cse1 (store .cse6 .cse7 0)) (or (<= (+ .cse8 28) .cse4) (= .cse9 .cse1)) (or (= .cse1 .cse6) (<= (+ .cse7 28) .cse4)) .cse10 (or (= .cse1 .cse11) (<= (+ .cse12 28) .cse4)) (<= 2 |c_t_funThread1of1ForFork0_~i~0#1|))))))))))) (exists ((|aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (|aux_mod_~#cache~0.offset_105| Int) (|aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (|aux_div_~#cache~0.offset_105| Int) (v_ArrVal_1722 Int)) (and (< |aux_mod_~#cache~0.offset_105| 28) (< |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 28) (<= 0 |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (<= 0 |aux_mod_~#cache~0.offset_105|) (<= (+ 3 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) |aux_div_~#cache~0.offset_105|) (= (store ((as const (Array Int Int)) 0) (+ (* (- 28) |aux_div_~#cache~0.offset_105|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| (* (- 1) |aux_mod_~#cache~0.offset_105|) (* 28 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (* (- 1) |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|)) v_ArrVal_1722) (select |c_#memory_int| 4)))) .cse5 (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| .cse4) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (forall ((v_ArrVal_1716 Int) (|aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| Int) (v_ArrVal_1718 (Array Int Int)) (v_ArrVal_1722 Int) (|aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int)) (let ((.cse15 (* |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28)) (.cse14 (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| 28) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|))) (or (>= |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (< .cse14 .cse15) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113|) (= (select (store (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_81| v_ArrVal_1716)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1718) |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| |c_~#cache~0.offset| 1) v_ArrVal_1722) (+ (- 1) (* (- 1) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) .cse15 |c_~#cache~0.offset|)) 0) (> 0 |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) (<= (+ .cse15 28) .cse14) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) (< |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 3))))) (or .cse0 (let ((.cse19 (store .cse20 .cse13 0))) (let ((.cse18 (@diff .cse19 .cse1))) (let ((.cse17 (store .cse19 .cse18 0))) (let ((.cse16 (@diff .cse17 .cse1))) (and (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (or (<= (+ .cse16 28) .cse4) (= .cse17 .cse1)) (or (<= (+ .cse18 28) .cse4) (= .cse1 .cse19)) .cse10 (= .cse1 (store .cse17 .cse16 0)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|))))))) (exists ((|aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (|aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (v_ArrVal_1713 Int)) (and (< |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 28) (<= 0 |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (<= (+ |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 1) |c_t_funThread1of1ForFork0_~i~0#1|) (= (store ((as const (Array Int Int)) 0) (+ |c_~#cache~0.offset| (* 28 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (* (- 1) |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|)) v_ArrVal_1713) (select |c_#memory_int| |c_~#cache~0.base|)))) (= |c_~#cache~0.offset| 0) (exists ((|aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (v_ArrVal_1716 Int) (|aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int)) (and (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) (+ |c_~#cache~0.offset| (* 28 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (* (- 1) |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|)) v_ArrVal_1716)) (< |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 28) (<= 0 |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (<= (+ 2 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) |c_t_funThread1of1ForFork0_~i~0#1|))) (or (let ((.cse25 (@diff .cse27 .cse1))) (let ((.cse21 (store .cse27 .cse25 0))) (let ((.cse22 (@diff .cse21 .cse1))) (and .cse5 (= .cse1 (store .cse21 .cse22 0)) .cse23 .cse24 (or (<= (+ .cse25 28) .cse4) .cse26) (or (= .cse21 .cse1) (<= (+ .cse22 28) .cse4)))))) .cse28) (= |c_~#cache~0.base| 4) (or (and .cse5 .cse26 .cse23 .cse24) .cse28)))))))) is different from false [2022-02-11 03:16:46,206 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0))) (let ((.cse30 (@diff .cse9 .cse1))) (let ((.cse31 (store .cse9 .cse30 0))) (let ((.cse32 (@diff .cse31 .cse1))) (let ((.cse15 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse19 (store .cse31 .cse32 0)) (.cse6 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (let ((.cse11 (or (= .cse1 .cse31) (<= (+ .cse32 28) .cse6))) (.cse13 (= .cse1 .cse19)) (.cse14 (or (<= (+ .cse30 28) .cse6) (= .cse1 .cse9))) (.cse12 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse0 (not .cse15)) (.cse7 (= |c_ULTIMATE.start_main_~i~3#1| 0)) (.cse8 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse10 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (and (or .cse0 (let ((.cse4 (store .cse9 .cse10 0))) (let ((.cse5 (@diff .cse4 .cse1))) (let ((.cse2 (store .cse4 .cse5 0))) (let ((.cse3 (@diff .cse2 .cse1))) (and (= .cse1 (store .cse2 .cse3 0)) (or (= .cse1 .cse4) (<= (+ 28 .cse5) .cse6)) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (or (= .cse1 .cse2) (<= (+ 28 .cse3) .cse6)) .cse7 .cse8)))))) (or (and .cse11 .cse12 .cse13 .cse14) .cse15) (or (let ((.cse16 (@diff .cse19 .cse1))) (let ((.cse17 (store .cse19 .cse16 0))) (let ((.cse18 (@diff .cse17 .cse1))) (and .cse11 .cse12 (or (<= (+ .cse16 28) .cse6) .cse13) (= .cse1 (store .cse17 .cse18 0)) (or (= .cse1 .cse17) (<= (+ .cse18 28) .cse6)) .cse14)))) .cse15) (exists ((|aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (|t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| Int) (|aux_mod_~#cache~0.offset_105| Int) (|aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (|aux_div_~#cache~0.offset_105| Int) (v_ArrVal_1722 Int)) (and (< |aux_mod_~#cache~0.offset_105| 28) (<= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= (store ((as const (Array Int Int)) 0) (+ (* (- 28) |aux_div_~#cache~0.offset_105|) (* (- 1) |aux_mod_~#cache~0.offset_105|) |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| (* 28 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (* (- 1) |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|)) v_ArrVal_1722) (select |c_#memory_int| 4)) (< |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 28) (<= 0 |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (<= 0 |aux_mod_~#cache~0.offset_105|) (<= (+ 3 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) |aux_div_~#cache~0.offset_105|))) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) .cse12 (forall ((v_ArrVal_1716 Int) (|aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| Int) (v_ArrVal_1718 (Array Int Int)) (v_ArrVal_1722 Int) (|aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int)) (let ((.cse20 (* |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28)) (.cse21 (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| 28) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|))) (or (>= |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (select (store (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1716)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1718) |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| |c_~#cache~0.offset| 1) v_ArrVal_1722) (+ (- 1) (* (- 1) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) .cse20 |c_~#cache~0.offset|)) 0) (< .cse21 .cse20) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113|) (> 0 |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) (<= (+ .cse20 28) .cse21) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) (< |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 3))))) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse6) (exists ((|aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (|aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (v_ArrVal_1713 Int)) (and (< |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 28) (<= 0 |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (<= (+ |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 1) |c_t_funThread1of1ForFork0_~i~0#1|) (= (store ((as const (Array Int Int)) 0) (+ |c_~#cache~0.offset| (* 28 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (* (- 1) |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|)) v_ArrVal_1713) (select |c_#memory_int| |c_~#cache~0.base|)))) (= |c_~#cache~0.offset| 0) (exists ((|aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (v_ArrVal_1716 Int) (|aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int)) (and (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) (+ |c_~#cache~0.offset| (* 28 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (* (- 1) |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|)) v_ArrVal_1716)) (< |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 28) (<= 0 |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (<= (+ 2 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) |c_t_funThread1of1ForFork0_~i~0#1|))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 4) (= |c_~#cache~0.base| 4) (or .cse0 (let ((.cse27 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse10 0))) (let ((.cse26 (@diff .cse27 .cse1))) (let ((.cse28 (store .cse27 .cse26 0))) (let ((.cse29 (@diff .cse28 .cse1))) (let ((.cse22 (store .cse28 .cse29 0))) (let ((.cse23 (@diff .cse22 .cse1))) (let ((.cse24 (store .cse22 .cse23 0))) (let ((.cse25 (@diff .cse24 .cse1))) (and (or (= .cse1 .cse22) (<= (+ .cse23 28) .cse6)) (= .cse1 (store .cse24 .cse25 0)) (or (<= (+ .cse26 28) .cse6) (= .cse27 .cse1)) (or (= .cse1 .cse24) (<= (+ .cse25 28) .cse6)) .cse7 .cse8 (or (= .cse1 .cse28) (<= (+ .cse29 28) .cse6)) (<= 2 |c_t_funThread1of1ForFork0_~i~0#1|)))))))))))))))))) is different from false [2022-02-11 03:16:48,270 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0))) (let ((.cse30 (@diff .cse9 .cse1))) (let ((.cse31 (store .cse9 .cse30 0))) (let ((.cse32 (@diff .cse31 .cse1))) (let ((.cse15 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse19 (store .cse31 .cse32 0)) (.cse6 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (let ((.cse11 (or (= .cse1 .cse31) (<= (+ .cse32 28) .cse6))) (.cse13 (= .cse1 .cse19)) (.cse14 (or (<= (+ .cse30 28) .cse6) (= .cse1 .cse9))) (.cse12 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse0 (not .cse15)) (.cse7 (= |c_ULTIMATE.start_main_~i~3#1| 0)) (.cse8 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse10 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (and (or .cse0 (let ((.cse4 (store .cse9 .cse10 0))) (let ((.cse5 (@diff .cse4 .cse1))) (let ((.cse2 (store .cse4 .cse5 0))) (let ((.cse3 (@diff .cse2 .cse1))) (and (= .cse1 (store .cse2 .cse3 0)) (or (= .cse1 .cse4) (<= (+ 28 .cse5) .cse6)) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (or (= .cse1 .cse2) (<= (+ 28 .cse3) .cse6)) .cse7 .cse8)))))) (or (and .cse11 .cse12 .cse13 .cse14) .cse15) (or (let ((.cse16 (@diff .cse19 .cse1))) (let ((.cse17 (store .cse19 .cse16 0))) (let ((.cse18 (@diff .cse17 .cse1))) (and .cse11 .cse12 (or (<= (+ .cse16 28) .cse6) .cse13) (= .cse1 (store .cse17 .cse18 0)) (or (= .cse1 .cse17) (<= (+ .cse18 28) .cse6)) .cse14)))) .cse15) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) .cse12 (forall ((v_ArrVal_1716 Int) (|aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| Int) (v_ArrVal_1718 (Array Int Int)) (v_ArrVal_1722 Int) (|aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int)) (let ((.cse20 (* |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28)) (.cse21 (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| 28) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|))) (or (>= |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (select (store (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1716)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1718) |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| |c_~#cache~0.offset| 1) v_ArrVal_1722) (+ (- 1) (* (- 1) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) .cse20 |c_~#cache~0.offset|)) 0) (< .cse21 .cse20) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113|) (> 0 |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) (<= (+ .cse20 28) .cse21) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) (< |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 3))))) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse6) (exists ((|aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (|aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (v_ArrVal_1713 Int)) (and (< |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 28) (<= 0 |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (<= (+ |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 1) |c_t_funThread1of1ForFork0_~i~0#1|) (= (store ((as const (Array Int Int)) 0) (+ |c_~#cache~0.offset| (* 28 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (* (- 1) |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|)) v_ArrVal_1713) (select |c_#memory_int| |c_~#cache~0.base|)))) (= |c_~#cache~0.offset| 0) (exists ((|aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (v_ArrVal_1716 Int) (|aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int)) (and (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) (+ |c_~#cache~0.offset| (* 28 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (* (- 1) |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|)) v_ArrVal_1716)) (< |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 28) (<= 0 |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (<= (+ 2 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) |c_t_funThread1of1ForFork0_~i~0#1|))) (= |c_~#cache~0.base| 4) (or .cse0 (let ((.cse27 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse10 0))) (let ((.cse26 (@diff .cse27 .cse1))) (let ((.cse28 (store .cse27 .cse26 0))) (let ((.cse29 (@diff .cse28 .cse1))) (let ((.cse22 (store .cse28 .cse29 0))) (let ((.cse23 (@diff .cse22 .cse1))) (let ((.cse24 (store .cse22 .cse23 0))) (let ((.cse25 (@diff .cse24 .cse1))) (and (or (= .cse1 .cse22) (<= (+ .cse23 28) .cse6)) (= .cse1 (store .cse24 .cse25 0)) (or (<= (+ .cse26 28) .cse6) (= .cse27 .cse1)) (or (= .cse1 .cse24) (<= (+ .cse25 28) .cse6)) .cse7 .cse8 (or (= .cse1 .cse28) (<= (+ .cse29 28) .cse6)) (<= 2 |c_t_funThread1of1ForFork0_~i~0#1|)))))))))))))))))) is different from false [2022-02-11 03:16:50,633 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse3 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse6 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse0 ((as const (Array Int Int)) 0)) (.cse7 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) (and (exists ((|aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (v_ArrVal_1715 Int) (|aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (v_ArrVal_1713 Int)) (and (< |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 28) (= (store (store ((as const (Array Int Int)) 0) (+ |c_~#cache~0.offset| (* 28 |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (* (- 1) |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|)) v_ArrVal_1713) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1715) (select |c_#memory_int| |c_~#cache~0.base|)) (<= 0 |aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (<= (+ |aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| 1) |c_t_funThread1of1ForFork0_~i~0#1|))) (or (let ((.cse4 (store .cse6 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|) 0))) (let ((.cse5 (@diff .cse4 .cse0))) (let ((.cse1 (store .cse4 .cse5 0))) (let ((.cse2 (@diff .cse1 .cse0))) (and (or (= .cse0 .cse1) (<= (+ .cse2 28) .cse3)) (= .cse0 (store .cse1 .cse2 0)) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (or (= .cse0 .cse4) (<= (+ .cse5 28) .cse3)) (= |c_ULTIMATE.start_main_~i~3#1| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)))))) (not .cse7)) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) .cse8 (forall ((v_ArrVal_1716 Int) (|aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| Int) (v_ArrVal_1718 (Array Int Int)) (v_ArrVal_1722 Int) (|aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| Int)) (let ((.cse9 (* |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28)) (.cse10 (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| 28) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|))) (or (>= |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (select (store (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1716)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1718) |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| |c_~#cache~0.offset| 1) v_ArrVal_1722) (+ (- 1) (* (- 1) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) .cse9 |c_~#cache~0.offset|)) 0) (< .cse10 .cse9) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113|) (> 0 |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183|) (<= (+ .cse9 28) .cse10) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 28) (< |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_117_183| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79_113| 3))))) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse3) (= |c_~#cache~0.offset| 0) (or (let ((.cse11 (@diff .cse6 .cse0))) (let ((.cse12 (store .cse6 .cse11 0))) (let ((.cse13 (@diff .cse12 .cse0))) (and (or (<= (+ .cse11 28) .cse3) (= .cse0 .cse6)) .cse8 (= .cse0 (store .cse12 .cse13 0)) (or (<= (+ 28 .cse13) .cse3) (= .cse0 .cse12)))))) .cse7) (= |c_~#cache~0.base| 4))) is different from false [2022-02-11 03:18:35,683 WARN L228 SmtUtils]: Spent 1.04m on a formula simplification. DAG size of input: 115 DAG size of output: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2022-02-11 03:19:30,273 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-11 03:19:30,289 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-11 03:19:30,312 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-11 03:19:31,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-11 03:19:31,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-02-11 03:19:31,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 03:19:31,397 WARN L594 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 103 known predicates. [2022-02-11 03:19:31,399 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-11 03:19:31,413 INFO L733 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2022-02-11 03:19:31,414 INFO L313 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was TIMEOUT (1/2) [2022-02-11 03:19:31,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-11 03:19:31,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 03:19:31,423 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-02-11 03:19:31,454 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-02-11 03:19:31,454 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, 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 [2022-02-11 03:19:31,454 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-11 03:19:31,454 WARN L594 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was constructing initial abstraction,while executing PartialOrderCegarLoop. [2022-02-11 03:19:31,454 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-02-11 03:19:31,455 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-02-11 03:19:31,455 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 3 remaining) [2022-02-11 03:19:31,455 INFO L733 BasicCegarLoop]: Path program histogram: [] [2022-02-11 03:19:31,456 INFO L313 ceAbstractionStarter]: Result for error location ULTIMATE.start was TIMEOUT,TIMEOUT,TIMEOUT (2/2) [2022-02-11 03:19:31,456 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-11 03:19:31,456 INFO L184 ceAbstractionStarter]: Computing trace abstraction results [2022-02-11 03:19:31,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.02 03:19:31 BasicIcfg [2022-02-11 03:19:31,458 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-11 03:19:31,458 INFO L158 Benchmark]: Toolchain (without parser) took 870898.99ms. Allocated memory was 165.7MB in the beginning and 672.1MB in the end (delta: 506.5MB). Free memory was 112.3MB in the beginning and 427.5MB in the end (delta: -315.3MB). Peak memory consumption was 192.0MB. Max. memory is 8.0GB. [2022-02-11 03:19:31,458 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 165.7MB. Free memory is still 130.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-11 03:19:31,459 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.00ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 112.0MB in the beginning and 156.6MB in the end (delta: -44.6MB). Peak memory consumption was 8.9MB. Max. memory is 8.0GB. [2022-02-11 03:19:31,459 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.20ms. Allocated memory is still 199.2MB. Free memory was 156.6MB in the beginning and 153.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-02-11 03:19:31,459 INFO L158 Benchmark]: Boogie Preprocessor took 26.49ms. Allocated memory is still 199.2MB. Free memory was 153.5MB in the beginning and 151.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-11 03:19:31,459 INFO L158 Benchmark]: RCFGBuilder took 453.28ms. Allocated memory is still 199.2MB. Free memory was 151.4MB in the beginning and 132.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-02-11 03:19:31,459 INFO L158 Benchmark]: TraceAbstraction took 869956.21ms. Allocated memory was 199.2MB in the beginning and 672.1MB in the end (delta: 472.9MB). Free memory was 132.0MB in the beginning and 427.5MB in the end (delta: -295.6MB). Peak memory consumption was 177.9MB. Max. memory is 8.0GB. [2022-02-11 03:19:31,460 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 165.7MB. Free memory is still 130.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 419.00ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 112.0MB in the beginning and 156.6MB in the end (delta: -44.6MB). Peak memory consumption was 8.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.20ms. Allocated memory is still 199.2MB. Free memory was 156.6MB in the beginning and 153.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.49ms. Allocated memory is still 199.2MB. Free memory was 153.5MB in the beginning and 151.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 453.28ms. Allocated memory is still 199.2MB. Free memory was 151.4MB in the beginning and 132.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 869956.21ms. Allocated memory was 199.2MB in the beginning and 672.1MB in the end (delta: 472.9MB). Free memory was 132.0MB in the beginning and 427.5MB in the end (delta: -295.6MB). Peak memory consumption was 177.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 36666, positive: 35095, positive conditional: 3772, positive unconditional: 31323, negative: 1571, negative conditional: 1441, negative unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35274, positive: 35095, positive conditional: 3772, positive unconditional: 31323, negative: 179, negative conditional: 49, negative unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 35274, positive: 35095, positive conditional: 3772, positive unconditional: 31323, negative: 179, negative conditional: 49, negative unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35291, positive: 35095, positive conditional: 1485, positive unconditional: 33610, negative: 196, negative conditional: 17, negative unconditional: 179, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 35291, positive: 35095, positive conditional: 73, positive unconditional: 35022, negative: 196, negative conditional: 3, negative unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35291, positive: 35095, positive conditional: 73, positive unconditional: 35022, negative: 196, negative conditional: 3, negative unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15410, positive: 15278, positive conditional: 0, positive unconditional: 15278, negative: 132, negative conditional: 2, negative unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15410, positive: 15187, positive conditional: 0, positive unconditional: 15187, negative: 223, negative conditional: 0, negative unconditional: 223, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 223, positive: 91, positive conditional: 0, positive unconditional: 91, negative: 132, negative conditional: 2, negative unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 351, positive: 159, positive conditional: 0, positive unconditional: 159, negative: 192, negative conditional: 3, negative unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 35291, positive: 19817, positive conditional: 73, positive unconditional: 19744, negative: 64, negative conditional: 1, negative unconditional: 63, unknown: 15410, unknown conditional: 2, unknown unconditional: 15408] , Statistics on independence cache: Total cache size (in pairs): 15410, Positive cache size: 15278, Positive conditional cache size: 0, Positive unconditional cache size: 15278, Negative cache size: 132, Negative conditional cache size: 2, Negative unconditional cache size: 130, Eliminated conditions: 1426, Maximal queried relation: 1, Independence queries for same thread: 1392 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.5s, Number of persistent set computation: 974, Number of trivial persistent sets: 459, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31453, positive: 31323, positive conditional: 0, positive unconditional: 31323, negative: 130, negative conditional: 0, negative unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 36666, positive: 35095, positive conditional: 3772, positive unconditional: 31323, negative: 1571, negative conditional: 1441, negative unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35274, positive: 35095, positive conditional: 3772, positive unconditional: 31323, negative: 179, negative conditional: 49, negative unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 35274, positive: 35095, positive conditional: 3772, positive unconditional: 31323, negative: 179, negative conditional: 49, negative unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35291, positive: 35095, positive conditional: 1485, positive unconditional: 33610, negative: 196, negative conditional: 17, negative unconditional: 179, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 35291, positive: 35095, positive conditional: 73, positive unconditional: 35022, negative: 196, negative conditional: 3, negative unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35291, positive: 35095, positive conditional: 73, positive unconditional: 35022, negative: 196, negative conditional: 3, negative unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15410, positive: 15278, positive conditional: 0, positive unconditional: 15278, negative: 132, negative conditional: 2, negative unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15410, positive: 15187, positive conditional: 0, positive unconditional: 15187, negative: 223, negative conditional: 0, negative unconditional: 223, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 223, positive: 91, positive conditional: 0, positive unconditional: 91, negative: 132, negative conditional: 2, negative unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 351, positive: 159, positive conditional: 0, positive unconditional: 159, negative: 192, negative conditional: 3, negative unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 35291, positive: 19817, positive conditional: 73, positive unconditional: 19744, negative: 64, negative conditional: 1, negative unconditional: 63, unknown: 15410, unknown conditional: 2, unknown unconditional: 15408] , Statistics on independence cache: Total cache size (in pairs): 15410, Positive cache size: 15278, Positive conditional cache size: 0, Positive unconditional cache size: 15278, Negative cache size: 132, Negative conditional cache size: 2, Negative unconditional cache size: 130, Eliminated conditions: 1426, Maximal queried relation: 1, Independence queries for same thread: 1392 - 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 - 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: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence 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: 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: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 103 known predicates. - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was constructing initial abstraction,while executing PartialOrderCegarLoop. - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was constructing initial abstraction,while executing PartialOrderCegarLoop. - TimeoutResultAtElement [Line: 954]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was constructing initial abstraction,while executing PartialOrderCegarLoop. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t_funThread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 266 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 869.8s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 478.5s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 115, 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.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 388.0s InterpolantComputationTime, 4433 NumberOfCodeBlocks, 4398 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 5908 ConstructedInterpolants, 462 QuantifiedInterpolants, 188721 SizeOfPredicates, 76 NumberOfNonLiveVariables, 4150 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 19 InterpolantComputations, 3 PerfectInterpolantSequences, 15322/16155 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 3 procedures, 266 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, 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: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown [2022-02-11 03:19:31,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Waiting until timeout for monitored process [2022-02-11 03:19:31,476 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end