/usr/bin/java -Xmx16000000000 -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-NewStatesSleepPersistentFixedOrder-NoLbe-Lockstep.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-lit/sssc12_variant.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-ba0fd47f62a02cd5486659f03d300faf678a2e90-ba0fd47 [2021-11-14 01:34:45,407 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-14 01:34:45,409 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-14 01:34:45,472 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-14 01:34:45,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-14 01:34:45,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-14 01:34:45,473 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-14 01:34:45,474 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-14 01:34:45,475 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-14 01:34:45,476 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-14 01:34:45,476 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-14 01:34:45,477 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-14 01:34:45,477 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-14 01:34:45,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-14 01:34:45,478 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-14 01:34:45,479 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-14 01:34:45,479 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-14 01:34:45,480 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-14 01:34:45,481 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-14 01:34:45,482 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-14 01:34:45,483 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-14 01:34:45,492 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-14 01:34:45,493 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-14 01:34:45,493 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-14 01:34:45,495 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-14 01:34:45,495 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-14 01:34:45,495 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-14 01:34:45,496 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-14 01:34:45,496 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-14 01:34:45,496 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-14 01:34:45,497 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-14 01:34:45,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-14 01:34:45,497 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-14 01:34:45,498 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-14 01:34:45,498 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-14 01:34:45,498 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-14 01:34:45,499 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-14 01:34:45,499 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-14 01:34:45,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-14 01:34:45,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-14 01:34:45,500 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-14 01:34:45,504 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-NewStatesSleepPersistentFixedOrder-NoLbe-Lockstep.epf [2021-11-14 01:34:45,531 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-14 01:34:45,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-14 01:34:45,532 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-14 01:34:45,532 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-14 01:34:45,533 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-14 01:34:45,533 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-14 01:34:45,533 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-14 01:34:45,533 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-14 01:34:45,533 INFO L138 SettingsManager]: * Use SBE=true [2021-11-14 01:34:45,533 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-14 01:34:45,534 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-14 01:34:45,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-14 01:34:45,534 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-14 01:34:45,534 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-14 01:34:45,534 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-14 01:34:45,534 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-14 01:34:45,535 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-14 01:34:45,535 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-14 01:34:45,535 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-14 01:34:45,535 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-14 01:34:45,535 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-14 01:34:45,535 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-14 01:34:45,535 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-14 01:34:45,535 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-11-14 01:34:45,535 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-14 01:34:45,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-14 01:34:45,535 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-14 01:34:45,536 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-14 01:34:45,536 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-14 01:34:45,536 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-14 01:34:45,536 INFO L138 SettingsManager]: * DFS Order used in POR=PSEUDO_LOCKSTEP [2021-11-14 01:34:45,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-14 01:34:45,536 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-14 01:34:45,536 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2021-11-14 01:34:45,536 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-14 01:34:45,536 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2021-11-14 01:34:45,536 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2021-11-14 01:34:45,536 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 [2021-11-14 01:34:45,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-14 01:34:45,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-14 01:34:45,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-14 01:34:45,754 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-14 01:34:45,755 INFO L275 PluginConnector]: CDTParser initialized [2021-11-14 01:34:45,756 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-lit/sssc12_variant.i [2021-11-14 01:34:45,807 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9145f263/03281815708e4b81a0b8ec7cccb479a0/FLAG563feef9f [2021-11-14 01:34:46,244 INFO L306 CDTParser]: Found 1 translation units. [2021-11-14 01:34:46,244 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/sssc12_variant.i [2021-11-14 01:34:46,257 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9145f263/03281815708e4b81a0b8ec7cccb479a0/FLAG563feef9f [2021-11-14 01:34:46,266 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9145f263/03281815708e4b81a0b8ec7cccb479a0 [2021-11-14 01:34:46,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-14 01:34:46,269 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-11-14 01:34:46,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-14 01:34:46,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-14 01:34:46,273 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-14 01:34:46,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 01:34:46" (1/1) ... [2021-11-14 01:34:46,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@661838e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:34:46, skipping insertion in model container [2021-11-14 01:34:46,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 01:34:46" (1/1) ... [2021-11-14 01:34:46,279 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-14 01:34:46,319 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-14 01:34:46,687 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/sssc12_variant.i[46865,46878] [2021-11-14 01:34:46,704 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-14 01:34:46,709 INFO L203 MainTranslator]: Completed pre-run [2021-11-14 01:34:46,742 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/sssc12_variant.i[46865,46878] [2021-11-14 01:34:46,745 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-14 01:34:46,786 INFO L208 MainTranslator]: Completed translation [2021-11-14 01:34:46,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:34:46 WrapperNode [2021-11-14 01:34:46,786 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-14 01:34:46,787 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-14 01:34:46,787 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-14 01:34:46,787 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-14 01:34:46,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:34:46" (1/1) ... [2021-11-14 01:34:46,814 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:34:46" (1/1) ... [2021-11-14 01:34:46,837 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-14 01:34:46,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-14 01:34:46,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-14 01:34:46,838 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-14 01:34:46,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:34:46" (1/1) ... [2021-11-14 01:34:46,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:34:46" (1/1) ... [2021-11-14 01:34:46,854 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:34:46" (1/1) ... [2021-11-14 01:34:46,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:34:46" (1/1) ... [2021-11-14 01:34:46,860 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:34:46" (1/1) ... [2021-11-14 01:34:46,863 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:34:46" (1/1) ... [2021-11-14 01:34:46,864 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:34:46" (1/1) ... [2021-11-14 01:34:46,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-14 01:34:46,866 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-14 01:34:46,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-14 01:34:46,866 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-14 01:34:46,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:34:46" (1/1) ... [2021-11-14 01:34:46,875 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-14 01:34:46,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-14 01:34:46,892 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) [2021-11-14 01:34:46,910 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 [2021-11-14 01:34:46,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-14 01:34:46,919 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2021-11-14 01:34:46,919 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2021-11-14 01:34:46,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-14 01:34:46,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-14 01:34:46,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-14 01:34:46,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-14 01:34:46,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-14 01:34:46,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-14 01:34:46,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-14 01:34:46,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-14 01:34:46,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-14 01:34:46,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-14 01:34:46,921 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-14 01:34:47,209 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-14 01:34:47,209 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-14 01:34:47,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 01:34:47 BoogieIcfgContainer [2021-11-14 01:34:47,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-14 01:34:47,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-14 01:34:47,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-14 01:34:47,214 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-14 01:34:47,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 01:34:46" (1/3) ... [2021-11-14 01:34:47,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@286fe42c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 01:34:47, skipping insertion in model container [2021-11-14 01:34:47,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 01:34:46" (2/3) ... [2021-11-14 01:34:47,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@286fe42c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 01:34:47, skipping insertion in model container [2021-11-14 01:34:47,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 01:34:47" (3/3) ... [2021-11-14 01:34:47,215 INFO L111 eAbstractionObserver]: Analyzing ICFG sssc12_variant.i [2021-11-14 01:34:47,218 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-14 01:34:47,218 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-14 01:34:47,218 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-14 01:34:47,218 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-14 01:34:47,232 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,233 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,233 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,233 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,233 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,233 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,233 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,233 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,233 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,233 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,234 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,234 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,234 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,234 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,234 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,234 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,234 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,234 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,234 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,234 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,235 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,235 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,235 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,235 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,235 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,235 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,235 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,235 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,236 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,236 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,236 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,236 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,236 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,236 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,236 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,236 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,236 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,236 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,237 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,237 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,237 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,237 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,237 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,237 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,237 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,238 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,238 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,238 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,238 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,238 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,238 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,238 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,238 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,238 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,238 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,239 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,239 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,239 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,239 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,239 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,239 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,239 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,239 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,239 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,240 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,240 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,240 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,240 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,240 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,240 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,242 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,242 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,242 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,242 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,242 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,242 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,242 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,242 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,242 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,242 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,243 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,243 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-11-14 01:34:47,270 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-11-14 01:34:47,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-14 01:34:47,271 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) [2021-11-14 01:34:47,272 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 [2021-11-14 01:34:47,292 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2021-11-14 01:34:47,296 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 [2021-11-14 01:34:47,296 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-14 01:34:47,384 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2021-11-14 01:34:47,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:34:47,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1868266872, now seen corresponding path program 1 times [2021-11-14 01:34:47,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:34:47,402 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776900129] [2021-11-14 01:34:47,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:34:47,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:34:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:34:47,558 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-14 01:34:47,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:34:47,559 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776900129] [2021-11-14 01:34:47,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776900129] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-14 01:34:47,559 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-14 01:34:47,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-14 01:34:47,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674611246] [2021-11-14 01:34:47,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-14 01:34:47,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-14 01:34:47,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:34:47,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-14 01:34:47,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-14 01:34:47,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:34:47,583 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:34:47,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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) [2021-11-14 01:34:47,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:34:47,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:34:47,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-14 01:34:47,602 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2021-11-14 01:34:47,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:34:47,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1135740194, now seen corresponding path program 1 times [2021-11-14 01:34:47,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:34:47,605 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614187783] [2021-11-14 01:34:47,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:34:47,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:34:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-14 01:34:47,635 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-14 01:34:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-14 01:34:47,679 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-14 01:34:47,679 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-14 01:34:47,680 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 1 remaining) [2021-11-14 01:34:47,681 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-14 01:34:47,693 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2021-11-14 01:34:47,694 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/2) [2021-11-14 01:34:47,695 WARN L234 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2021-11-14 01:34:47,695 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2021-11-14 01:34:47,708 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,709 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,709 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,709 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,709 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,709 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,709 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,709 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,709 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,710 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,710 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,710 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,710 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,710 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,710 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,710 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,711 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,711 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,711 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,711 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,711 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,711 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,711 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,712 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,712 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,712 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,712 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,712 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,712 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,712 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,712 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,712 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,712 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,713 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,713 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,713 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,713 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,713 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,713 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,713 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,714 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,714 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,715 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,715 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,715 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,715 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,715 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,715 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,715 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,715 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,716 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,716 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,716 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,716 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,716 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,716 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,716 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,716 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,717 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,717 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,717 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,717 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,717 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,717 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,718 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,718 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,718 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,718 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,718 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,718 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,720 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,720 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,720 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,720 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,720 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,720 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,720 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,720 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,721 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,721 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,721 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,721 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,721 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,721 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,722 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,724 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,725 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,726 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,726 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,726 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,727 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,727 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,727 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,727 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,727 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,728 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,728 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,728 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,728 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,728 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,728 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,728 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,728 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,728 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,728 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,728 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,729 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,729 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,729 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,729 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,729 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,729 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,729 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,729 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,729 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,729 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,729 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,730 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,730 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,730 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,730 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,730 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,730 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,730 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,730 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,730 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,730 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,730 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,731 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,731 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,731 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,731 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,731 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,731 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,736 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,736 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,736 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,736 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,736 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,736 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,737 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,737 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,737 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,737 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,737 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,737 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,737 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,737 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,737 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,738 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,738 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,738 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,739 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,739 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,739 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,739 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,739 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,739 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,739 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,739 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,739 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,739 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:34:47,740 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-11-14 01:34:47,749 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-11-14 01:34:47,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-14 01:34:47,750 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2021-11-14 01:34:47,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2021-11-14 01:34:47,753 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thrThread2of2ForFork0 ======== [2021-11-14 01:34:47,754 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 [2021-11-14 01:34:47,754 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-14 01:34:48,021 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:34:48,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:34:48,022 INFO L85 PathProgramCache]: Analyzing trace with hash 755426955, now seen corresponding path program 1 times [2021-11-14 01:34:48,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:34:48,022 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12075922] [2021-11-14 01:34:48,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:34:48,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:34:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:34:48,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-14 01:34:48,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:34:48,065 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12075922] [2021-11-14 01:34:48,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12075922] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-14 01:34:48,065 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-14 01:34:48,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-14 01:34:48,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449844291] [2021-11-14 01:34:48,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-14 01:34:48,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-14 01:34:48,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:34:48,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-14 01:34:48,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-14 01:34:48,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:34:48,067 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:34:48,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 46.5) internal successors, (93), 2 states have internal predecessors, (93), 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) [2021-11-14 01:34:48,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:34:48,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:34:48,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-14 01:34:48,093 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:34:48,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:34:48,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1151645105, now seen corresponding path program 1 times [2021-11-14 01:34:48,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:34:48,093 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117297746] [2021-11-14 01:34:48,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:34:48,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:34:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:34:48,169 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-14 01:34:48,169 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:34:48,169 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117297746] [2021-11-14 01:34:48,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117297746] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-14 01:34:48,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-14 01:34:48,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-14 01:34:48,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076860931] [2021-11-14 01:34:48,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-14 01:34:48,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-14 01:34:48,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:34:48,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-14 01:34:48,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-14 01:34:48,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:34:48,171 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:34:48,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-14 01:34:48,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:34:48,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:34:48,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:34:48,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:34:48,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-14 01:34:48,374 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:34:48,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:34:48,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1768343934, now seen corresponding path program 1 times [2021-11-14 01:34:48,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:34:48,374 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122970197] [2021-11-14 01:34:48,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:34:48,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:34:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:34:48,651 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 4 proven. 55 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-14 01:34:48,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:34:48,651 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122970197] [2021-11-14 01:34:48,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122970197] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-14 01:34:48,651 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081813706] [2021-11-14 01:34:48,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:34:48,652 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:34:48,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-14 01:34:48,825 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) [2021-11-14 01:34:48,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-14 01:34:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:34:48,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-14 01:34:48,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-14 01:34:49,299 INFO L388 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 15 treesize of output 11 [2021-11-14 01:34:49,346 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-14 01:34:49,349 INFO L388 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 1 case distinctions, treesize of input 32 treesize of output 31 [2021-11-14 01:34:49,438 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-11-14 01:34:49,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 15 [2021-11-14 01:34:49,486 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 13 proven. 31 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-14 01:34:49,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-14 01:34:49,529 INFO L388 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 25 treesize of output 23 [2021-11-14 01:34:49,785 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 38 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-11-14 01:34:49,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081813706] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-14 01:34:49,785 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-14 01:34:49,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 27 [2021-11-14 01:34:49,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619356199] [2021-11-14 01:34:49,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-14 01:34:49,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-14 01:34:49,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:34:49,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-14 01:34:49,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2021-11-14 01:34:49,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:34:49,788 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:34:49,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 9.777777777777779) internal successors, (264), 27 states have internal predecessors, (264), 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) [2021-11-14 01:34:49,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:34:49,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:34:49,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:34:50,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:34:50,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:34:50,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-14 01:34:50,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-14 01:34:50,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:34:50,692 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:34:50,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:34:50,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1200748933, now seen corresponding path program 2 times [2021-11-14 01:34:50,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:34:50,693 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220714068] [2021-11-14 01:34:50,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:34:50,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:34:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:34:50,935 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 13 proven. 110 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-14 01:34:50,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:34:50,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220714068] [2021-11-14 01:34:50,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220714068] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-14 01:34:50,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386461253] [2021-11-14 01:34:50,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-14 01:34:50,936 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:34:50,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-14 01:34:50,937 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) [2021-11-14 01:34:50,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-14 01:34:51,007 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-14 01:34:51,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-14 01:34:51,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-14 01:34:51,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-14 01:34:51,209 INFO L388 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 15 treesize of output 11 [2021-11-14 01:34:51,245 INFO L388 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 34 treesize of output 29 [2021-11-14 01:34:51,252 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-14 01:34:51,253 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 34 treesize of output 38 [2021-11-14 01:34:51,286 INFO L354 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2021-11-14 01:34:51,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 29 [2021-11-14 01:34:51,443 INFO L354 Elim1Store]: treesize reduction 80, result has 27.9 percent of original size [2021-11-14 01:34:51,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 58 [2021-11-14 01:34:51,541 INFO L354 Elim1Store]: treesize reduction 100, result has 30.1 percent of original size [2021-11-14 01:34:51,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 81 [2021-11-14 01:34:51,844 INFO L354 Elim1Store]: treesize reduction 140, result has 26.3 percent of original size [2021-11-14 01:34:51,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 85 [2021-11-14 01:34:52,120 INFO L354 Elim1Store]: treesize reduction 72, result has 25.8 percent of original size [2021-11-14 01:34:52,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 71 [2021-11-14 01:34:52,162 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 23 proven. 94 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-14 01:34:52,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-14 01:34:52,551 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread1of2ForFork0_~c~0#1_32| Int)) (or (< (+ |c_thrThread1of2ForFork0_~c~0#1| 1) |v_thrThread1of2ForFork0_~c~0#1_32|) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_32| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1))) is different from false [2021-11-14 01:34:53,026 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread1of2ForFork0_~c~0#1_32| Int)) (or (< (+ |c_thrThread1of2ForFork0_~c~0#1| 1) |v_thrThread1of2ForFork0_~c~0#1_32|) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_32| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1))) is different from false [2021-11-14 01:34:55,079 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread1of2ForFork0_~c~0#1_33| Int)) (or (forall ((|v_thrThread1of2ForFork0_~c~0#1_32| Int)) (or (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_33| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_32| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< (+ |v_thrThread1of2ForFork0_~c~0#1_33| 1) |v_thrThread1of2ForFork0_~c~0#1_32|))) (< (+ |c_thrThread1of2ForFork0_~c~0#1| 1) |v_thrThread1of2ForFork0_~c~0#1_33|))) is different from false [2021-11-14 01:34:56,617 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread1of2ForFork0_~c~0#1_32| Int) (|v_thrThread1of2ForFork0_~c~0#1_33| Int)) (or (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_33| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_32| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< (+ |v_thrThread1of2ForFork0_~c~0#1_33| 1) |v_thrThread1of2ForFork0_~c~0#1_32|) (< (+ |c_thrThread1of2ForFork0_~c~0#1| 1) |v_thrThread1of2ForFork0_~c~0#1_33|))) is different from false [2021-11-14 01:34:58,696 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread1of2ForFork0_~c~0#1_34| Int)) (or (< (+ |c_thrThread1of2ForFork0_~c~0#1| 1) |v_thrThread1of2ForFork0_~c~0#1_34|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_32| Int) (|v_thrThread1of2ForFork0_~c~0#1_33| Int)) (or (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_34| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_33| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_32| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< (+ |v_thrThread1of2ForFork0_~c~0#1_33| 1) |v_thrThread1of2ForFork0_~c~0#1_32|) (< (+ |v_thrThread1of2ForFork0_~c~0#1_34| 1) |v_thrThread1of2ForFork0_~c~0#1_33|))))) is different from false [2021-11-14 01:34:58,744 INFO L388 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 55 treesize of output 53 [2021-11-14 01:34:58,987 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 14 proven. 27 refuted. 0 times theorem prover too weak. 13 trivial. 76 not checked. [2021-11-14 01:34:58,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386461253] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-14 01:34:58,987 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-14 01:34:58,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 17] total 39 [2021-11-14 01:34:58,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270002840] [2021-11-14 01:34:58,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-14 01:34:58,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-14 01:34:58,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:34:58,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-14 01:34:58,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=972, Unknown=5, NotChecked=340, Total=1482 [2021-11-14 01:34:58,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:34:58,989 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:34:58,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 8.64102564102564) internal successors, (337), 39 states have internal predecessors, (337), 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) [2021-11-14 01:34:58,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:34:58,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:34:58,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2021-11-14 01:34:58,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:35:01,169 WARN L838 $PredicateComparison]: unable to prove that (and (<= 10 |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_34| Int)) (or (< (+ |c_thrThread1of2ForFork0_~c~0#1| 1) |v_thrThread1of2ForFork0_~c~0#1_34|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_32| Int) (|v_thrThread1of2ForFork0_~c~0#1_33| Int)) (or (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_34| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_33| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_32| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< (+ |v_thrThread1of2ForFork0_~c~0#1_33| 1) |v_thrThread1of2ForFork0_~c~0#1_32|) (< (+ |v_thrThread1of2ForFork0_~c~0#1_34| 1) |v_thrThread1of2ForFork0_~c~0#1_33|))))) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) |c_thrThread2of2ForFork0_~c~0#1|) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (= |c_thrThread1of2ForFork0_~c~0#1| 0)) is different from false [2021-11-14 01:35:03,172 WARN L838 $PredicateComparison]: unable to prove that (and (<= 10 |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_34| Int)) (or (< (+ |c_thrThread1of2ForFork0_~c~0#1| 1) |v_thrThread1of2ForFork0_~c~0#1_34|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_32| Int) (|v_thrThread1of2ForFork0_~c~0#1_33| Int)) (or (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_34| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_33| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_32| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< (+ |v_thrThread1of2ForFork0_~c~0#1_33| 1) |v_thrThread1of2ForFork0_~c~0#1_32|) (< (+ |v_thrThread1of2ForFork0_~c~0#1_34| 1) |v_thrThread1of2ForFork0_~c~0#1_33|))))) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) |c_thrThread2of2ForFork0_~c~0#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (= |c_thrThread1of2ForFork0_~c~0#1| 0)) is different from false [2021-11-14 01:35:04,037 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_32| Int) (|v_thrThread1of2ForFork0_~c~0#1_33| Int)) (or (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_33| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_32| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< (+ |v_thrThread1of2ForFork0_~c~0#1_33| 1) |v_thrThread1of2ForFork0_~c~0#1_32|) (< (+ |c_thrThread1of2ForFork0_~c~0#1| 1) |v_thrThread1of2ForFork0_~c~0#1_33|)))) is different from false [2021-11-14 01:35:06,111 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_34| Int)) (or (< (+ |c_thrThread1of2ForFork0_~c~0#1| 1) |v_thrThread1of2ForFork0_~c~0#1_34|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_32| Int) (|v_thrThread1of2ForFork0_~c~0#1_33| Int)) (or (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_34| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_33| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_32| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< (+ |v_thrThread1of2ForFork0_~c~0#1_33| 1) |v_thrThread1of2ForFork0_~c~0#1_32|) (< (+ |v_thrThread1of2ForFork0_~c~0#1_34| 1) |v_thrThread1of2ForFork0_~c~0#1_33|))))) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) |c_thrThread2of2ForFork0_~c~0#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0))) is different from false [2021-11-14 01:35:08,115 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_34| Int)) (or (< (+ |c_thrThread1of2ForFork0_~c~0#1| 1) |v_thrThread1of2ForFork0_~c~0#1_34|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_32| Int) (|v_thrThread1of2ForFork0_~c~0#1_33| Int)) (or (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_34| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_33| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_32| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< (+ |v_thrThread1of2ForFork0_~c~0#1_33| 1) |v_thrThread1of2ForFork0_~c~0#1_32|) (< (+ |v_thrThread1of2ForFork0_~c~0#1_34| 1) |v_thrThread1of2ForFork0_~c~0#1_33|))))) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) |c_thrThread2of2ForFork0_~c~0#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1)) is different from false [2021-11-14 01:35:09,132 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~data~0.base))) (and (<= (+ 9 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (= (select .cse0 (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (= (select .cse0 (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 0) (forall ((|v_thrThread1of2ForFork0_~c~0#1_32| Int) (|v_thrThread1of2ForFork0_~c~0#1_33| Int)) (or (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_33| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_32| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< (+ |v_thrThread1of2ForFork0_~c~0#1_33| 1) |v_thrThread1of2ForFork0_~c~0#1_32|) (< (+ |c_thrThread1of2ForFork0_~c~0#1| 1) |v_thrThread1of2ForFork0_~c~0#1_33|))))) is different from false [2021-11-14 01:35:11,137 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~data~0.base))) (and (<= (+ 9 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (= (select .cse0 (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (= (select .cse0 (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_33| Int)) (or (forall ((|v_thrThread1of2ForFork0_~c~0#1_32| Int)) (or (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_33| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_32| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< (+ |v_thrThread1of2ForFork0_~c~0#1_33| 1) |v_thrThread1of2ForFork0_~c~0#1_32|))) (< (+ |c_thrThread1of2ForFork0_~c~0#1| 1) |v_thrThread1of2ForFork0_~c~0#1_33|))))) is different from false [2021-11-14 01:35:11,566 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_32| Int)) (or (< (+ |c_thrThread1of2ForFork0_~c~0#1| 1) |v_thrThread1of2ForFork0_~c~0#1_32|) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_32| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (exists ((|v_thrThread1of2ForFork0_~c~0#1_30| Int)) (and (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_30| 4))) 1) (<= |c_thrThread1of2ForFork0_~c~0#1| (+ |v_thrThread1of2ForFork0_~c~0#1_30| 1)) (<= (+ 9 |v_thrThread1of2ForFork0_~c~0#1_30|) |c_thrThread2of2ForFork0_~c~0#1|)))) is different from false [2021-11-14 01:35:11,999 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~data~0.base))) (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_32| Int)) (or (< (+ |c_thrThread1of2ForFork0_~c~0#1| 1) |v_thrThread1of2ForFork0_~c~0#1_32|) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_32| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1))) (= (select .cse0 (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (= (select .cse0 (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 0) (exists ((|v_thrThread1of2ForFork0_~c~0#1_30| Int)) (and (or (= (* 4 |c_thrThread1of2ForFork0_~c~0#1|) (* 4 |v_thrThread1of2ForFork0_~c~0#1_30|)) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_30| 4))) 1)) (<= |c_thrThread1of2ForFork0_~c~0#1| (+ |v_thrThread1of2ForFork0_~c~0#1_30| 1)) (<= (+ 9 |v_thrThread1of2ForFork0_~c~0#1_30|) |c_thrThread2of2ForFork0_~c~0#1|))))) is different from false [2021-11-14 01:35:12,376 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~data~0.base))) (and (= (select .cse0 (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_32| Int)) (or (< (+ |c_thrThread1of2ForFork0_~c~0#1| 1) |v_thrThread1of2ForFork0_~c~0#1_32|) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_32| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1))) (= (select .cse0 (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (exists ((|v_thrThread1of2ForFork0_~c~0#1_30| Int)) (and (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_30| 4))) 1) (<= |c_thrThread1of2ForFork0_~c~0#1| (+ |v_thrThread1of2ForFork0_~c~0#1_30| 1)) (<= (+ 9 |v_thrThread1of2ForFork0_~c~0#1_30|) |c_thrThread2of2ForFork0_~c~0#1|))))) is different from false [2021-11-14 01:35:12,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:35:12,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:35:12,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-11-14 01:35:12,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-11-14 01:35:12,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-14 01:35:12,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:35:12,678 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:35:12,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:35:12,678 INFO L85 PathProgramCache]: Analyzing trace with hash 569685618, now seen corresponding path program 3 times [2021-11-14 01:35:12,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:35:12,679 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316829177] [2021-11-14 01:35:12,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:35:12,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:35:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:35:12,966 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 14 proven. 165 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-14 01:35:12,966 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:35:12,966 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316829177] [2021-11-14 01:35:12,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316829177] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-14 01:35:12,966 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089832636] [2021-11-14 01:35:12,966 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-14 01:35:12,967 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:35:12,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-14 01:35:12,967 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) [2021-11-14 01:35:12,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-14 01:35:13,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-11-14 01:35:13,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-14 01:35:13,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-14 01:35:13,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-14 01:35:13,265 INFO L388 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 15 treesize of output 11 [2021-11-14 01:35:13,306 INFO L354 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2021-11-14 01:35:13,307 INFO L388 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 1 case distinctions, treesize of input 27 treesize of output 34 [2021-11-14 01:35:13,353 INFO L354 Elim1Store]: treesize reduction 32, result has 50.0 percent of original size [2021-11-14 01:35:13,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 57 [2021-11-14 01:35:13,443 INFO L354 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2021-11-14 01:35:13,444 INFO L388 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 1 case distinctions, treesize of input 27 treesize of output 34 [2021-11-14 01:35:13,470 INFO L354 Elim1Store]: treesize reduction 32, result has 50.0 percent of original size [2021-11-14 01:35:13,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 57 [2021-11-14 01:35:15,620 INFO L354 Elim1Store]: treesize reduction 80, result has 27.9 percent of original size [2021-11-14 01:35:15,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 53 [2021-11-14 01:35:15,691 INFO L354 Elim1Store]: treesize reduction 100, result has 30.1 percent of original size [2021-11-14 01:35:15,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 76 [2021-11-14 01:35:24,005 INFO L354 Elim1Store]: treesize reduction 156, result has 17.9 percent of original size [2021-11-14 01:35:24,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 69 [2021-11-14 01:35:24,081 INFO L354 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2021-11-14 01:35:24,081 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 31 [2021-11-14 01:35:24,133 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 120 proven. 45 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-14 01:35:24,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-14 01:35:27,911 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= 1 (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)))) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) is different from false [2021-11-14 01:35:28,259 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-14 01:35:51,161 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|v_thrThread1of2ForFork0_~c~0#1_42| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= (select (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_42| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |v_thrThread1of2ForFork0_~c~0#1_42| 1)))) is different from false [2021-11-14 01:35:51,344 INFO L388 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 60 treesize of output 58 [2021-11-14 01:35:53,636 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 17 proven. 77 refuted. 12 times theorem prover too weak. 16 trivial. 64 not checked. [2021-11-14 01:35:53,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089832636] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-14 01:35:53,637 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-14 01:35:53,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 42 [2021-11-14 01:35:53,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480088283] [2021-11-14 01:35:53,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-14 01:35:53,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-11-14 01:35:53,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:35:53,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-11-14 01:35:53,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1354, Unknown=19, NotChecked=154, Total=1722 [2021-11-14 01:35:53,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:35:53,639 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:35:53,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 9.071428571428571) internal successors, (381), 42 states have internal predecessors, (381), 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) [2021-11-14 01:35:53,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:35:53,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:35:53,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2021-11-14 01:35:53,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2021-11-14 01:35:53,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:35:55,450 WARN L838 $PredicateComparison]: unable to prove that (and (<= 10 |c_thrThread2of2ForFork0_~c~0#1|) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) |c_thrThread2of2ForFork0_~c~0#1|) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|v_thrThread1of2ForFork0_~c~0#1_42| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= (select (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_42| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |v_thrThread1of2ForFork0_~c~0#1_42| 1)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0)) is different from false [2021-11-14 01:35:56,108 WARN L838 $PredicateComparison]: unable to prove that (and (<= 10 |c_thrThread2of2ForFork0_~c~0#1|) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) |c_thrThread2of2ForFork0_~c~0#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|v_thrThread1of2ForFork0_~c~0#1_42| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= (select (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_42| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |v_thrThread1of2ForFork0_~c~0#1_42| 1)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0)) is different from false [2021-11-14 01:35:57,109 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|v_thrThread1of2ForFork0_~c~0#1_42| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= (select (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_42| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |v_thrThread1of2ForFork0_~c~0#1_42| 1))))) is different from false [2021-11-14 01:36:01,263 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) |c_thrThread2of2ForFork0_~c~0#1|) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|v_thrThread1of2ForFork0_~c~0#1_42| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= (select (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_42| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |v_thrThread1of2ForFork0_~c~0#1_42| 1)))) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0))) is different from false [2021-11-14 01:36:02,215 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) |c_thrThread2of2ForFork0_~c~0#1|) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|v_thrThread1of2ForFork0_~c~0#1_42| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= (select (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_42| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |v_thrThread1of2ForFork0_~c~0#1_42| 1))))) is different from false [2021-11-14 01:36:03,033 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~data~0.base)) (.cse1 (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)))) (and (<= (+ 9 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (= (select (store .cse0 (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 0) .cse1) 1) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (= (select .cse0 .cse1) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|v_thrThread1of2ForFork0_~c~0#1_42| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= (select (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_42| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |v_thrThread1of2ForFork0_~c~0#1_42| 1)))))) is different from false [2021-11-14 01:36:05,872 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|v_thrThread1of2ForFork0_~c~0#1_42| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= (select (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_42| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |v_thrThread1of2ForFork0_~c~0#1_42| 1)))) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0))) is different from false [2021-11-14 01:36:07,884 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|v_thrThread1of2ForFork0_~c~0#1_42| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= (select (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_42| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |v_thrThread1of2ForFork0_~c~0#1_42| 1))))) is different from false [2021-11-14 01:36:09,576 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~data~0.base))) (and (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= 1 (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)))) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (= (select .cse0 (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (= (select .cse0 (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1))) is different from false [2021-11-14 01:36:10,411 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= 1 (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)))) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (exists ((|v_thrThread1of2ForFork0_~c~0#1_37| Int)) (and (<= (+ |v_thrThread1of2ForFork0_~c~0#1_37| 1) |c_thrThread1of2ForFork0_~c~0#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_37| 4) c_~data~0.offset)) 1)))) is different from false [2021-11-14 01:36:11,189 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~data~0.base)) (.cse1 (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)))) (and (= (select (store .cse0 (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 0) .cse1) 1) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= 1 (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)))) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (= (select .cse0 .cse1) 1) (exists ((|v_thrThread1of2ForFork0_~c~0#1_37| Int)) (and (<= (+ |v_thrThread1of2ForFork0_~c~0#1_37| 1) |c_thrThread1of2ForFork0_~c~0#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_37| 4) c_~data~0.offset)) 1))))) is different from false [2021-11-14 01:36:12,110 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~data~0.base))) (and (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= 1 (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)))) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (= (select .cse0 (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (exists ((|v_thrThread1of2ForFork0_~c~0#1_37| Int)) (and (<= (+ |v_thrThread1of2ForFork0_~c~0#1_37| 1) |c_thrThread1of2ForFork0_~c~0#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_37| 4) c_~data~0.offset)) 1))) (= (select .cse0 (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1))) is different from false [2021-11-14 01:36:12,962 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= 1 (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)))) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (exists ((|v_thrThread1of2ForFork0_~c~0#1_37| Int) (|v_thrThread1of2ForFork0_~c~0#1_38| Int)) (let ((.cse0 (select |c_#memory_int| c_~data~0.base))) (and (<= (+ |v_thrThread1of2ForFork0_~c~0#1_38| 1) |c_thrThread1of2ForFork0_~c~0#1|) (= (select .cse0 (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_38| 4))) 1) (<= (+ |v_thrThread1of2ForFork0_~c~0#1_37| 1) |v_thrThread1of2ForFork0_~c~0#1_38|) (= (select .cse0 (+ (* |v_thrThread1of2ForFork0_~c~0#1_37| 4) c_~data~0.offset)) 1))))) is different from false [2021-11-14 01:36:14,654 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= 1 (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)))) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (< (+ |c_thrThread1of2ForFork0_~c~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (exists ((|v_thrThread1of2ForFork0_~c~0#1_37| Int)) (and (<= (+ |v_thrThread1of2ForFork0_~c~0#1_37| 1) |c_thrThread1of2ForFork0_~c~0#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_37| 4) c_~data~0.offset)) 1))) (exists ((|v_thrThread1of2ForFork0_~c~0#1_37| Int) (|v_thrThread1of2ForFork0_~c~0#1_38| Int)) (let ((.cse0 (select |c_#memory_int| c_~data~0.base))) (and (<= (+ |v_thrThread1of2ForFork0_~c~0#1_38| 1) |c_thrThread1of2ForFork0_~c~0#1|) (= (select .cse0 (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_38| 4))) 1) (<= (+ |v_thrThread1of2ForFork0_~c~0#1_37| 1) |v_thrThread1of2ForFork0_~c~0#1_38|) (= (select .cse0 (+ (* |v_thrThread1of2ForFork0_~c~0#1_37| 4) c_~data~0.offset)) 1))))) is different from false [2021-11-14 01:36:22,872 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_34| Int)) (or (< (+ |c_thrThread1of2ForFork0_~c~0#1| 1) |v_thrThread1of2ForFork0_~c~0#1_34|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_32| Int) (|v_thrThread1of2ForFork0_~c~0#1_33| Int)) (or (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_34| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_33| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_32| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< (+ |v_thrThread1of2ForFork0_~c~0#1_33| 1) |v_thrThread1of2ForFork0_~c~0#1_32|) (< (+ |v_thrThread1of2ForFork0_~c~0#1_34| 1) |v_thrThread1of2ForFork0_~c~0#1_33|))))) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) |c_thrThread2of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|)) is different from false [2021-11-14 01:36:23,646 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|v_thrThread1of2ForFork0_~c~0#1_42| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= (select (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_42| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |v_thrThread1of2ForFork0_~c~0#1_42| 1)))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|)) is different from false [2021-11-14 01:36:26,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:36:26,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:36:26,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-11-14 01:36:26,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-14 01:36:26,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-11-14 01:36:26,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-14 01:36:26,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:36:26,819 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:36:26,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:36:26,820 INFO L85 PathProgramCache]: Analyzing trace with hash 897208326, now seen corresponding path program 4 times [2021-11-14 01:36:26,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:36:26,820 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682369599] [2021-11-14 01:36:26,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:36:26,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:36:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:36:27,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 968 proven. 164 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-14 01:36:27,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:36:27,051 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682369599] [2021-11-14 01:36:27,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682369599] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-14 01:36:27,052 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550086357] [2021-11-14 01:36:27,052 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-14 01:36:27,052 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:36:27,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-14 01:36:27,053 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) [2021-11-14 01:36:27,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-14 01:36:27,150 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-14 01:36:27,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-14 01:36:27,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-14 01:36:27,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-14 01:36:27,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 1102 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-11-14 01:36:27,725 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-14 01:36:27,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550086357] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-14 01:36:27,726 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-14 01:36:27,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [17] total 19 [2021-11-14 01:36:27,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441882430] [2021-11-14 01:36:27,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-14 01:36:27,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-14 01:36:27,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:36:27,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-14 01:36:27,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2021-11-14 01:36:27,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:36:27,727 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:36:27,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 20.642857142857142) internal successors, (289), 14 states have internal predecessors, (289), 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) [2021-11-14 01:36:27,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:36:27,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:36:27,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2021-11-14 01:36:27,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2021-11-14 01:36:27,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2021-11-14 01:36:27,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:37:09,716 WARN L227 SmtUtils]: Spent 24.98s on a formula simplification. DAG size of input: 65 DAG size of output: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-14 01:37:11,738 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_40| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1))))) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= 1 (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)))) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |c_thrThread1of2ForFork0_~c~0#1| 1))))) is different from false [2021-11-14 01:37:11,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:37:11,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:37:11,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-11-14 01:37:11,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-14 01:37:11,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-11-14 01:37:11,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:37:11,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-14 01:37:11,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:37:11,947 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:37:11,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:37:11,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1510437816, now seen corresponding path program 5 times [2021-11-14 01:37:11,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:37:11,948 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136583696] [2021-11-14 01:37:11,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:37:11,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:37:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:37:12,177 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 11 proven. 502 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2021-11-14 01:37:12,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:37:12,177 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136583696] [2021-11-14 01:37:12,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136583696] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-14 01:37:12,177 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519040455] [2021-11-14 01:37:12,177 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-14 01:37:12,177 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:37:12,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-14 01:37:12,178 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) [2021-11-14 01:37:12,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-14 01:37:13,532 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2021-11-14 01:37:13,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-14 01:37:13,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-14 01:37:13,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-14 01:37:14,041 INFO L388 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 15 treesize of output 11 [2021-11-14 01:37:14,071 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-14 01:37:14,071 INFO L388 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 1 case distinctions, treesize of input 32 treesize of output 31 [2021-11-14 01:37:14,103 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-11-14 01:37:14,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 15 [2021-11-14 01:37:14,148 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 20 proven. 458 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2021-11-14 01:37:14,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-14 01:37:14,206 INFO L388 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 25 treesize of output 23 [2021-11-14 01:37:14,872 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 19 proven. 460 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2021-11-14 01:37:14,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519040455] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-14 01:37:14,873 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-14 01:37:14,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 17] total 34 [2021-11-14 01:37:14,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827565929] [2021-11-14 01:37:14,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-14 01:37:14,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-11-14 01:37:14,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:37:14,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-11-14 01:37:14,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2021-11-14 01:37:14,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:37:14,874 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:37:14,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 10.911764705882353) internal successors, (371), 34 states have internal predecessors, (371), 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) [2021-11-14 01:37:14,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:37:14,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:37:14,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2021-11-14 01:37:14,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2021-11-14 01:37:14,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2021-11-14 01:37:14,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:37:14,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:37:16,833 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) (.cse0 (select |c_#memory_int| c_~data~0.base)) (.cse1 (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)))) (and (<= (+ 9 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (= (select (store .cse0 .cse1 0) .cse2) 1) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= 1 (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)))) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (= (select .cse0 .cse2) 1) (= (select .cse0 .cse1) 1))) is different from false [2021-11-14 01:37:17,548 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~data~0.base)) (.cse1 (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)))) (and (= (select (store .cse0 (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 0) .cse1) 1) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= 1 (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)))) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (= (select .cse0 .cse1) 1) (exists ((|v_thrThread1of2ForFork0_~c~0#1_37| Int)) (and (<= (+ |v_thrThread1of2ForFork0_~c~0#1_37| 1) |c_thrThread1of2ForFork0_~c~0#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_37| 4) c_~data~0.offset)) 1))) (<= (+ 8 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|))) is different from false [2021-11-14 01:37:19,590 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) (.cse0 (select |c_#memory_int| c_~data~0.base)) (.cse1 (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)))) (and (= (select (store .cse0 .cse1 0) .cse2) 1) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= 1 (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)))) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (= (select .cse0 .cse2) 1) (exists ((|v_thrThread1of2ForFork0_~c~0#1_37| Int)) (and (<= (+ |v_thrThread1of2ForFork0_~c~0#1_37| 1) |c_thrThread1of2ForFork0_~c~0#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_37| 4) c_~data~0.offset)) 1))) (= (select .cse0 .cse1) 1) (<= (+ 8 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|))) is different from false [2021-11-14 01:37:21,290 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~data~0.base)) (.cse1 (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)))) (and (= (select (store .cse0 (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 0) .cse1) 1) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= 1 (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)))) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (= (select .cse0 .cse1) 1) (exists ((|v_thrThread1of2ForFork0_~c~0#1_37| Int) (|v_thrThread1of2ForFork0_~c~0#1_38| Int)) (let ((.cse2 (select |c_#memory_int| c_~data~0.base))) (and (<= (+ |v_thrThread1of2ForFork0_~c~0#1_38| 1) |c_thrThread1of2ForFork0_~c~0#1|) (= (select .cse2 (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_38| 4))) 1) (<= (+ |v_thrThread1of2ForFork0_~c~0#1_37| 1) |v_thrThread1of2ForFork0_~c~0#1_38|) (= (select .cse2 (+ (* |v_thrThread1of2ForFork0_~c~0#1_37| 4) c_~data~0.offset)) 1)))) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|))) is different from false [2021-11-14 01:37:22,090 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~data~0.base)) (.cse1 (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)))) (and (= (select (store .cse0 (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 0) .cse1) 1) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= 1 (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)))) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (< (+ |c_thrThread1of2ForFork0_~c~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (= (select .cse0 .cse1) 1) (exists ((|v_thrThread1of2ForFork0_~c~0#1_37| Int)) (and (<= (+ |v_thrThread1of2ForFork0_~c~0#1_37| 1) |c_thrThread1of2ForFork0_~c~0#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_37| 4) c_~data~0.offset)) 1))) (exists ((|v_thrThread1of2ForFork0_~c~0#1_37| Int) (|v_thrThread1of2ForFork0_~c~0#1_38| Int)) (let ((.cse2 (select |c_#memory_int| c_~data~0.base))) (and (<= (+ |v_thrThread1of2ForFork0_~c~0#1_38| 1) |c_thrThread1of2ForFork0_~c~0#1|) (= (select .cse2 (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_38| 4))) 1) (<= (+ |v_thrThread1of2ForFork0_~c~0#1_37| 1) |v_thrThread1of2ForFork0_~c~0#1_38|) (= (select .cse2 (+ (* |v_thrThread1of2ForFork0_~c~0#1_37| 4) c_~data~0.offset)) 1)))) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|))) is different from false [2021-11-14 01:37:30,165 WARN L227 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 52 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-14 01:37:31,653 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) (.cse0 (select |c_#memory_int| c_~data~0.base)) (.cse1 (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)))) (and (= (select (store .cse0 .cse1 0) .cse2) 1) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= 1 (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)))) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (= (select .cse0 .cse2) 1) (exists ((|v_thrThread1of2ForFork0_~c~0#1_37| Int)) (and (<= (+ |v_thrThread1of2ForFork0_~c~0#1_37| 1) |c_thrThread1of2ForFork0_~c~0#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_37| 4) c_~data~0.offset)) 1))) (= (select .cse0 .cse1) 1) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|))) is different from false [2021-11-14 01:37:32,854 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~data~0.base)) (.cse1 (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)))) (and (= (select (store .cse0 (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 0) .cse1) 1) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= 1 (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)))) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (= (select .cse0 .cse1) 1) (exists ((|v_thrThread1of2ForFork0_~c~0#1_37| Int) (|v_thrThread1of2ForFork0_~c~0#1_38| Int)) (let ((.cse2 (select |c_#memory_int| c_~data~0.base))) (and (<= (+ |v_thrThread1of2ForFork0_~c~0#1_38| 1) |c_thrThread1of2ForFork0_~c~0#1|) (= (select .cse2 (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_38| 4))) 1) (<= (+ |v_thrThread1of2ForFork0_~c~0#1_37| 1) |v_thrThread1of2ForFork0_~c~0#1_38|) (= (select .cse2 (+ (* |v_thrThread1of2ForFork0_~c~0#1_37| 4) c_~data~0.offset)) 1)))))) is different from false [2021-11-14 01:37:35,223 WARN L838 $PredicateComparison]: unable to prove that (and (<= 10 |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_34| Int)) (or (< (+ |c_thrThread1of2ForFork0_~c~0#1| 1) |v_thrThread1of2ForFork0_~c~0#1_34|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_32| Int) (|v_thrThread1of2ForFork0_~c~0#1_33| Int)) (or (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_34| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_33| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_32| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< (+ |v_thrThread1of2ForFork0_~c~0#1_33| 1) |v_thrThread1of2ForFork0_~c~0#1_32|) (< (+ |v_thrThread1of2ForFork0_~c~0#1_34| 1) |v_thrThread1of2ForFork0_~c~0#1_33|))))) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) |c_thrThread2of2ForFork0_~c~0#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0))) is different from false [2021-11-14 01:37:36,062 WARN L838 $PredicateComparison]: unable to prove that (and (<= 10 |c_thrThread2of2ForFork0_~c~0#1|) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) |c_thrThread2of2ForFork0_~c~0#1|) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|v_thrThread1of2ForFork0_~c~0#1_42| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= (select (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_42| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |v_thrThread1of2ForFork0_~c~0#1_42| 1)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0))) is different from false [2021-11-14 01:37:38,251 WARN L838 $PredicateComparison]: unable to prove that (and (<= 10 |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_34| Int)) (or (< (+ |c_thrThread1of2ForFork0_~c~0#1| 1) |v_thrThread1of2ForFork0_~c~0#1_34|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_32| Int) (|v_thrThread1of2ForFork0_~c~0#1_33| Int)) (or (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_34| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_33| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_32| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< (+ |v_thrThread1of2ForFork0_~c~0#1_33| 1) |v_thrThread1of2ForFork0_~c~0#1_32|) (< (+ |v_thrThread1of2ForFork0_~c~0#1_34| 1) |v_thrThread1of2ForFork0_~c~0#1_33|))))) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) |c_thrThread2of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|)) is different from false [2021-11-14 01:37:38,995 WARN L838 $PredicateComparison]: unable to prove that (and (<= 10 |c_thrThread2of2ForFork0_~c~0#1|) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) |c_thrThread2of2ForFork0_~c~0#1|) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|v_thrThread1of2ForFork0_~c~0#1_42| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= (select (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_42| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |v_thrThread1of2ForFork0_~c~0#1_42| 1)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|)) is different from false [2021-11-14 01:37:40,308 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|v_thrThread1of2ForFork0_~c~0#1_42| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= (select (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_42| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |v_thrThread1of2ForFork0_~c~0#1_42| 1)))) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1)) is different from false [2021-11-14 01:37:41,208 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= 1 (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)))) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |thrThread1of2ForFork0_~c~0#1| 1))))) is different from false [2021-11-14 01:37:42,164 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= 1 (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)))) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (<= (+ 8 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:37:49,000 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_40| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1))))) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= 1 (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)))) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (<= (+ 8 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:37:51,024 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= 1 (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)))) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int)) (or (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:38:01,030 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_40| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1))))) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= 1 (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)))) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:38:02,417 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= 1 (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)))) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int)) (or (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |c_thrThread1of2ForFork0_~c~0#1| 1))))) is different from false [2021-11-14 01:38:03,659 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~data~0.base)) (.cse1 (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)))) (and (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_40| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1))))) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= 1 (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)))) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (or (= (select (store .cse0 (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 0) .cse1) 1) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread1of2ForFork0_~c~0#1|)) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select .cse0 .cse1) 1))) is different from false [2021-11-14 01:38:04,523 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= 1 (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)))) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread1of2ForFork0_~c~0#1|)) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int)) (or (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |c_thrThread1of2ForFork0_~c~0#1| 1))))) is different from false [2021-11-14 01:38:06,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:38:06,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:38:06,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-11-14 01:38:06,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-11-14 01:38:06,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2021-11-14 01:38:06,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:38:06,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2021-11-14 01:38:06,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-11-14 01:38:06,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:38:06,742 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:38:06,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:38:06,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1967851266, now seen corresponding path program 1 times [2021-11-14 01:38:06,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:38:06,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306913045] [2021-11-14 01:38:06,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:38:06,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:38:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:38:06,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 945 trivial. 0 not checked. [2021-11-14 01:38:06,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:38:06,814 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306913045] [2021-11-14 01:38:06,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306913045] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-14 01:38:06,814 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-14 01:38:06,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-14 01:38:06,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872925641] [2021-11-14 01:38:06,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-14 01:38:06,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-14 01:38:06,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:38:06,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-14 01:38:06,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-14 01:38:06,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:38:06,815 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:38:06,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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) [2021-11-14 01:38:06,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:38:06,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:38:06,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2021-11-14 01:38:06,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2021-11-14 01:38:06,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2021-11-14 01:38:06,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:38:06,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2021-11-14 01:38:06,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:38:11,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:38:11,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:38:11,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2021-11-14 01:38:11,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-11-14 01:38:11,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2021-11-14 01:38:11,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:38:11,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2021-11-14 01:38:11,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:38:11,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-14 01:38:11,683 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:38:11,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:38:11,684 INFO L85 PathProgramCache]: Analyzing trace with hash -499318750, now seen corresponding path program 1 times [2021-11-14 01:38:11,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:38:11,684 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037421297] [2021-11-14 01:38:11,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:38:11,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:38:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:38:11,716 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-14 01:38:11,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:38:11,716 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037421297] [2021-11-14 01:38:11,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037421297] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-14 01:38:11,716 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-14 01:38:11,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-14 01:38:11,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647577094] [2021-11-14 01:38:11,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-14 01:38:11,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-14 01:38:11,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:38:11,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-14 01:38:11,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-14 01:38:11,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:38:11,717 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:38:11,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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) [2021-11-14 01:38:11,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:38:11,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:38:11,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2021-11-14 01:38:11,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2021-11-14 01:38:11,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2021-11-14 01:38:11,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:38:11,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2021-11-14 01:38:11,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:38:11,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:38:11,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:38:11,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:38:11,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2021-11-14 01:38:11,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-11-14 01:38:11,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2021-11-14 01:38:11,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:38:11,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2021-11-14 01:38:11,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:38:11,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-14 01:38:11,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-14 01:38:11,827 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:38:11,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:38:11,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1473695299, now seen corresponding path program 1 times [2021-11-14 01:38:11,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:38:11,828 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899251271] [2021-11-14 01:38:11,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:38:11,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:38:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:38:11,903 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-14 01:38:11,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:38:11,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899251271] [2021-11-14 01:38:11,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899251271] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-14 01:38:11,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864919675] [2021-11-14 01:38:11,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:38:11,904 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:38:11,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-14 01:38:11,916 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-14 01:38:11,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-14 01:38:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:38:11,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-14 01:38:12,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-14 01:38:12,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-14 01:38:12,045 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-14 01:38:12,045 INFO L388 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 [2021-11-14 01:38:12,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-14 01:38:12,190 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-14 01:38:12,191 INFO L388 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 1 case distinctions, treesize of input 56 treesize of output 55 [2021-11-14 01:38:12,208 INFO L388 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 23 treesize of output 7 [2021-11-14 01:38:12,283 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-14 01:38:12,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-14 01:38:17,180 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 6 refuted. 2 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-14 01:38:17,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864919675] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-14 01:38:17,181 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-14 01:38:17,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 14 [2021-11-14 01:38:17,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042412664] [2021-11-14 01:38:17,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-14 01:38:17,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-14 01:38:17,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:38:17,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-14 01:38:17,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=142, Unknown=8, NotChecked=0, Total=182 [2021-11-14 01:38:17,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:38:17,182 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:38:17,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.0) internal successors, (126), 14 states have internal predecessors, (126), 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) [2021-11-14 01:38:17,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:38:17,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:38:17,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 101 states. [2021-11-14 01:38:17,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2021-11-14 01:38:17,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 109 states. [2021-11-14 01:38:17,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:38:17,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2021-11-14 01:38:17,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:38:17,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2021-11-14 01:38:17,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:38:18,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:38:18,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:38:18,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2021-11-14 01:38:18,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2021-11-14 01:38:18,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2021-11-14 01:38:18,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:38:18,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-11-14 01:38:18,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:38:18,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:38:18,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-14 01:38:18,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-11-14 01:38:18,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-14 01:38:18,807 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:38:18,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:38:18,807 INFO L85 PathProgramCache]: Analyzing trace with hash 808692934, now seen corresponding path program 6 times [2021-11-14 01:38:18,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:38:18,807 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112717803] [2021-11-14 01:38:18,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:38:18,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:38:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:38:18,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 2 proven. 110 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2021-11-14 01:38:18,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:38:18,975 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112717803] [2021-11-14 01:38:18,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112717803] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-14 01:38:18,975 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509792144] [2021-11-14 01:38:18,975 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-14 01:38:18,976 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:38:18,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-14 01:38:18,976 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-14 01:38:18,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-14 01:38:19,044 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-11-14 01:38:19,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-14 01:38:19,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-14 01:38:19,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-14 01:38:19,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1021 trivial. 0 not checked. [2021-11-14 01:38:19,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-14 01:38:19,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509792144] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-14 01:38:19,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-14 01:38:19,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2021-11-14 01:38:19,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666599901] [2021-11-14 01:38:19,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-14 01:38:19,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-14 01:38:19,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:38:19,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-14 01:38:19,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-14 01:38:19,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:38:19,544 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:38:19,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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) [2021-11-14 01:38:19,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:38:19,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:38:19,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2021-11-14 01:38:19,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2021-11-14 01:38:19,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 126 states. [2021-11-14 01:38:19,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:38:19,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2021-11-14 01:38:19,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:38:19,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:38:19,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2021-11-14 01:38:19,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:38:22,452 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~data~0.base)) (.cse1 (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)))) (and (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (or (= (select (store .cse0 (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 0) .cse1) 1) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread1of2ForFork0_~c~0#1|)) (= (select .cse0 .cse1) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_39| Int) (|v_thrThread1of2ForFork0_~c~0#1_40| Int) (|v_thrThread1of2ForFork0_~c~0#1_42| Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_39| (+ |v_thrThread1of2ForFork0_~c~0#1_40| 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| |v_thrThread1of2ForFork0_~c~0#1_39|) (= (select (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread1of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_42| 4)) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_40| 4)) 1) (+ (* |v_thrThread1of2ForFork0_~c~0#1_39| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_40| (+ |v_thrThread1of2ForFork0_~c~0#1_42| 1)))))) is different from false [2021-11-14 01:38:25,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:38:25,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:38:25,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2021-11-14 01:38:25,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-11-14 01:38:25,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2021-11-14 01:38:25,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:38:25,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2021-11-14 01:38:25,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:38:25,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:38:25,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-14 01:38:25,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:38:25,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-14 01:38:26,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-14 01:38:26,115 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:38:26,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:38:26,116 INFO L85 PathProgramCache]: Analyzing trace with hash 151548569, now seen corresponding path program 7 times [2021-11-14 01:38:26,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:38:26,116 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760413365] [2021-11-14 01:38:26,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:38:26,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:38:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:38:26,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1151 backedges. 968 proven. 166 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-14 01:38:26,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:38:26,283 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760413365] [2021-11-14 01:38:26,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760413365] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-14 01:38:26,283 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25328381] [2021-11-14 01:38:26,283 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-14 01:38:26,283 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:38:26,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-14 01:38:26,284 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-14 01:38:26,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-14 01:38:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:38:26,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-14 01:38:26,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-14 01:38:26,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1151 backedges. 1134 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-14 01:38:26,975 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-14 01:38:26,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25328381] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-14 01:38:26,975 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-14 01:38:26,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 17 [2021-11-14 01:38:26,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156293392] [2021-11-14 01:38:26,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-14 01:38:26,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-14 01:38:26,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:38:26,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-14 01:38:26,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2021-11-14 01:38:26,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:38:26,976 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:38:26,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 22.785714285714285) internal successors, (319), 14 states have internal predecessors, (319), 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) [2021-11-14 01:38:26,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:38:26,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:38:26,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2021-11-14 01:38:26,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2021-11-14 01:38:26,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 133 states. [2021-11-14 01:38:26,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:38:26,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2021-11-14 01:38:26,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:38:26,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:38:26,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2021-11-14 01:38:26,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:38:26,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:38:27,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:38:27,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:38:27,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2021-11-14 01:38:27,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-11-14 01:38:27,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2021-11-14 01:38:27,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:38:27,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2021-11-14 01:38:27,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:38:27,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:38:27,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-14 01:38:27,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:38:27,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:38:27,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-14 01:38:27,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-14 01:38:27,335 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:38:27,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:38:27,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1999151708, now seen corresponding path program 8 times [2021-11-14 01:38:27,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:38:27,336 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632265238] [2021-11-14 01:38:27,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:38:27,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:38:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:38:27,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 25 proven. 272 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2021-11-14 01:38:27,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:38:27,549 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632265238] [2021-11-14 01:38:27,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632265238] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-14 01:38:27,549 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23360344] [2021-11-14 01:38:27,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-14 01:38:27,549 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:38:27,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-14 01:38:27,550 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-14 01:38:27,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-14 01:38:27,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-14 01:38:27,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-14 01:38:27,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 19 conjunts are in the unsatisfiable core [2021-11-14 01:38:27,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-14 01:38:28,320 INFO L388 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 15 treesize of output 11 [2021-11-14 01:38:28,369 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-14 01:38:28,369 INFO L388 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 1 case distinctions, treesize of input 32 treesize of output 31 [2021-11-14 01:38:28,406 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-11-14 01:38:28,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 15 [2021-11-14 01:38:28,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 831 proven. 184 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-14 01:38:28,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-14 01:38:29,025 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) is different from false [2021-11-14 01:38:29,041 INFO L388 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 31 treesize of output 29 [2021-11-14 01:38:29,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 831 proven. 168 refuted. 0 times theorem prover too weak. 19 trivial. 16 not checked. [2021-11-14 01:38:29,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23360344] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-14 01:38:29,676 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-14 01:38:29,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 19] total 41 [2021-11-14 01:38:29,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415353496] [2021-11-14 01:38:29,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-14 01:38:29,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-11-14 01:38:29,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:38:29,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-11-14 01:38:29,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=1309, Unknown=1, NotChecked=76, Total=1640 [2021-11-14 01:38:29,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:38:29,678 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:38:29,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 15.560975609756097) internal successors, (638), 41 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-14 01:38:29,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:38:29,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:38:29,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2021-11-14 01:38:29,678 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2021-11-14 01:38:29,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 133 states. [2021-11-14 01:38:29,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:38:29,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2021-11-14 01:38:29,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:38:29,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:38:29,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2021-11-14 01:38:29,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:38:29,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:38:29,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:38:30,342 WARN L838 $PredicateComparison]: unable to prove that (and (<= 10 |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (<= 10 c_~next~0) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (<= 10 |c_thrThread2of2ForFork0_~end~0#1|) (= |c_thrThread2of2ForFork0_~c~0#1| 0) (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 10) |c_thrThread1of2ForFork0_~c~0#1|) (<= |c_thrThread2of2ForFork0_~end~0#1| c_~next~0) (<= |c_thrThread2of2ForFork0_~end~0#1| |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:38:30,961 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0)) (<= |c_thrThread2of2ForFork0_~end~0#1| |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:38:31,478 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (<= |c_thrThread2of2ForFork0_~end~0#1| |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:38:32,130 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (<= (+ |c_thrThread2of2ForFork0_~end~0#1| 1) |c_thrThread1of2ForFork0_~c~0#1|) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0))) is different from false [2021-11-14 01:38:32,649 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (<= (+ |c_thrThread2of2ForFork0_~end~0#1| 1) |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:38:33,289 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0)) (<= (+ 2 |c_thrThread2of2ForFork0_~end~0#1|) |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:38:33,789 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (<= (+ 2 |c_thrThread2of2ForFork0_~end~0#1|) |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:38:34,442 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (<= (+ 3 |c_thrThread2of2ForFork0_~end~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0))) is different from false [2021-11-14 01:38:34,939 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (<= (+ 3 |c_thrThread2of2ForFork0_~end~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1)) is different from false [2021-11-14 01:38:35,557 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (<= (+ 4 |c_thrThread2of2ForFork0_~end~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0))) is different from false [2021-11-14 01:38:36,094 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (<= (+ 4 |c_thrThread2of2ForFork0_~end~0#1|) |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:38:36,713 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0)) (<= (+ 5 |c_thrThread2of2ForFork0_~end~0#1|) |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:38:37,210 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (<= (+ 5 |c_thrThread2of2ForFork0_~end~0#1|) |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:38:37,834 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0)) (<= (+ 6 |c_thrThread2of2ForFork0_~end~0#1|) |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:38:38,354 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (<= (+ 6 |c_thrThread2of2ForFork0_~end~0#1|) |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:38:38,984 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 7 |c_thrThread2of2ForFork0_~end~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0))) is different from false [2021-11-14 01:38:39,497 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 7 |c_thrThread2of2ForFork0_~end~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1)) is different from false [2021-11-14 01:38:40,148 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (<= (+ 8 |c_thrThread2of2ForFork0_~end~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0))) is different from false [2021-11-14 01:38:40,900 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 7 |c_thrThread2of2ForFork0_~end~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |c_thrThread2of2ForFork0_~c~0#1| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0))) is different from false [2021-11-14 01:38:41,530 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 7 |c_thrThread2of2ForFork0_~end~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |c_thrThread2of2ForFork0_~c~0#1| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|)) is different from false [2021-11-14 01:38:41,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:38:41,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:38:41,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2021-11-14 01:38:41,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-11-14 01:38:41,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2021-11-14 01:38:41,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:38:41,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2021-11-14 01:38:41,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:38:41,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-14 01:38:41,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-14 01:38:41,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:38:41,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:38:41,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2021-11-14 01:38:41,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-11-14 01:38:41,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-14 01:38:41,854 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:38:41,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:38:41,855 INFO L85 PathProgramCache]: Analyzing trace with hash 713573411, now seen corresponding path program 9 times [2021-11-14 01:38:41,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:38:41,855 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186568660] [2021-11-14 01:38:41,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:38:41,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:38:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:38:42,078 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 8 proven. 397 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2021-11-14 01:38:42,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:38:42,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186568660] [2021-11-14 01:38:42,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186568660] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-14 01:38:42,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405603749] [2021-11-14 01:38:42,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-14 01:38:42,079 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:38:42,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-14 01:38:42,080 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-14 01:38:42,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-14 01:38:42,371 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2021-11-14 01:38:42,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-14 01:38:42,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-14 01:38:42,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-14 01:38:42,878 INFO L388 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 15 treesize of output 11 [2021-11-14 01:38:42,941 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-14 01:38:42,943 INFO L388 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 1 case distinctions, treesize of input 32 treesize of output 31 [2021-11-14 01:38:42,979 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-11-14 01:38:42,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 15 [2021-11-14 01:38:43,025 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 8 proven. 296 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2021-11-14 01:38:43,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-14 01:38:43,660 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread1of2ForFork0_~c~0#1_106| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_106| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_106| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1))) is different from false [2021-11-14 01:38:43,725 INFO L388 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 31 treesize of output 29 [2021-11-14 01:38:44,213 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 8 proven. 229 refuted. 0 times theorem prover too weak. 626 trivial. 67 not checked. [2021-11-14 01:38:44,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405603749] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-14 01:38:44,214 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-14 01:38:44,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 30 [2021-11-14 01:38:44,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231882036] [2021-11-14 01:38:44,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-14 01:38:44,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-11-14 01:38:44,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:38:44,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-11-14 01:38:44,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=703, Unknown=1, NotChecked=54, Total=870 [2021-11-14 01:38:44,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:38:44,215 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:38:44,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 9.433333333333334) internal successors, (283), 30 states have internal predecessors, (283), 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) [2021-11-14 01:38:44,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:38:44,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:38:44,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2021-11-14 01:38:44,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2021-11-14 01:38:44,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 133 states. [2021-11-14 01:38:44,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:38:44,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2021-11-14 01:38:44,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:38:44,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2021-11-14 01:38:44,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2021-11-14 01:38:44,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:38:44,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:38:44,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2021-11-14 01:38:44,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:38:44,939 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_106| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_106| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_106| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1))) (<= 10 |c_thrThread1of2ForFork0_~c~0#1|) (<= 10 c_~next~0) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (<= 10 |c_thrThread2of2ForFork0_~end~0#1|) (= |c_thrThread2of2ForFork0_~c~0#1| 0)) is different from false [2021-11-14 01:38:45,578 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_106| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_106| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_106| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0))) is different from false [2021-11-14 01:38:46,094 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 8) |c_thrThread1of2ForFork0_~c~0#1|) (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_106| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_106| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_106| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1)) is different from false [2021-11-14 01:38:46,743 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 8) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_106| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_106| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_106| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|)) is different from false [2021-11-14 01:38:47,437 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |c_thrThread2of2ForFork0_~c~0#1| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0)) (<= (+ 6 |c_thrThread2of2ForFork0_~end~0#1|) |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:38:47,969 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 8) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_106| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_106| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_106| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0))) is different from false [2021-11-14 01:38:48,549 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |c_thrThread2of2ForFork0_~c~0#1| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= (+ 6 |c_thrThread2of2ForFork0_~end~0#1|) |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:38:49,127 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_106| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_106| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_106| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1))) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|)) is different from false [2021-11-14 01:38:49,951 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |c_thrThread2of2ForFork0_~c~0#1| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0)) (<= (+ 5 |c_thrThread2of2ForFork0_~end~0#1|) |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:38:50,554 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |c_thrThread2of2ForFork0_~c~0#1| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= (+ 5 |c_thrThread2of2ForFork0_~end~0#1|) |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:38:51,082 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_106| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_106| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_106| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |c_thrThread2of2ForFork0_~c~0#1| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|)) is different from false [2021-11-14 01:38:51,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:38:51,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:38:51,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2021-11-14 01:38:51,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-11-14 01:38:51,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2021-11-14 01:38:51,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:38:51,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2021-11-14 01:38:51,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:38:51,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-14 01:38:51,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-14 01:38:51,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:38:51,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:38:51,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2021-11-14 01:38:51,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-11-14 01:38:51,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-14 01:38:51,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-14 01:38:51,528 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:38:51,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:38:51,528 INFO L85 PathProgramCache]: Analyzing trace with hash 789946728, now seen corresponding path program 10 times [2021-11-14 01:38:51,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:38:51,528 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132294213] [2021-11-14 01:38:51,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:38:51,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:38:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:38:51,805 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 16 proven. 561 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2021-11-14 01:38:51,805 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:38:51,805 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132294213] [2021-11-14 01:38:51,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132294213] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-14 01:38:51,805 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855251043] [2021-11-14 01:38:51,805 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-14 01:38:51,805 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:38:51,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-14 01:38:51,807 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-14 01:38:51,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-14 01:38:51,887 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-14 01:38:51,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-14 01:38:51,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 29 conjunts are in the unsatisfiable core [2021-11-14 01:38:51,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-14 01:38:52,404 INFO L388 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 15 treesize of output 11 [2021-11-14 01:38:52,464 INFO L388 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 34 treesize of output 29 [2021-11-14 01:38:52,473 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-14 01:38:52,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 34 treesize of output 38 [2021-11-14 01:38:52,509 INFO L354 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2021-11-14 01:38:52,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 29 [2021-11-14 01:38:52,643 INFO L354 Elim1Store]: treesize reduction 88, result has 20.7 percent of original size [2021-11-14 01:38:52,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 50 [2021-11-14 01:38:52,709 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-11-14 01:38:52,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 23 [2021-11-14 01:38:52,757 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 18 proven. 488 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2021-11-14 01:38:52,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-14 01:38:53,375 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread1of2ForFork0_~c~0#1_122| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_122| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_122| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) is different from false [2021-11-14 01:39:01,256 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread1of2ForFork0_~c~0#1_123| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_123| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (forall ((|v_thrThread1of2ForFork0_~c~0#1_122| Int)) (or (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_123| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_122| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_122| (+ |v_thrThread1of2ForFork0_~c~0#1_123| 1)))))) is different from false [2021-11-14 01:39:01,372 INFO L388 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 43 treesize of output 41 [2021-11-14 01:39:03,054 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 7 proven. 392 refuted. 0 times theorem prover too weak. 332 trivial. 107 not checked. [2021-11-14 01:39:03,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855251043] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-14 01:39:03,055 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-14 01:39:03,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 18] total 39 [2021-11-14 01:39:03,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36553092] [2021-11-14 01:39:03,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-14 01:39:03,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-14 01:39:03,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:39:03,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-14 01:39:03,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1123, Unknown=10, NotChecked=142, Total=1482 [2021-11-14 01:39:03,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:39:03,056 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:39:03,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 9.35897435897436) internal successors, (365), 39 states have internal predecessors, (365), 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) [2021-11-14 01:39:03,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:39:03,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:39:03,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2021-11-14 01:39:03,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2021-11-14 01:39:03,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 133 states. [2021-11-14 01:39:03,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:39:03,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 108 states. [2021-11-14 01:39:03,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:39:03,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2021-11-14 01:39:03,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2021-11-14 01:39:03,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:39:03,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:39:03,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 123 states. [2021-11-14 01:39:03,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2021-11-14 01:39:03,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:39:05,201 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (<= 10 |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_123| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_123| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (forall ((|v_thrThread1of2ForFork0_~c~0#1_122| Int)) (or (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_123| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_122| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_122| (+ |v_thrThread1of2ForFork0_~c~0#1_123| 1)))))) (<= 10 c_~next~0) (<= (+ 7 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (<= 10 |c_thrThread2of2ForFork0_~end~0#1|) (= |c_thrThread2of2ForFork0_~c~0#1| 0)) is different from false [2021-11-14 01:39:07,293 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_123| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_123| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (forall ((|v_thrThread1of2ForFork0_~c~0#1_122| Int)) (or (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_123| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_122| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_122| (+ |v_thrThread1of2ForFork0_~c~0#1_123| 1)))))) (<= (+ 7 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0))) is different from false [2021-11-14 01:39:09,296 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_123| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_123| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (forall ((|v_thrThread1of2ForFork0_~c~0#1_122| Int)) (or (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_123| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_122| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_122| (+ |v_thrThread1of2ForFork0_~c~0#1_123| 1)))))) (<= (+ 7 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:39:11,460 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 8) |c_thrThread1of2ForFork0_~c~0#1|) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_123| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_123| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (forall ((|v_thrThread1of2ForFork0_~c~0#1_122| Int)) (or (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_123| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_122| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_122| (+ |v_thrThread1of2ForFork0_~c~0#1_123| 1)))))) (<= (+ 7 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|)) is different from false [2021-11-14 01:39:13,527 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_123| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_123| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (forall ((|v_thrThread1of2ForFork0_~c~0#1_122| Int)) (or (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_123| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_122| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_122| (+ |v_thrThread1of2ForFork0_~c~0#1_123| 1)))))) (<= (+ 7 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|)) is different from false [2021-11-14 01:39:15,589 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 6 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_123| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_123| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (forall ((|v_thrThread1of2ForFork0_~c~0#1_122| Int)) (or (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_123| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_122| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_122| (+ |v_thrThread1of2ForFork0_~c~0#1_123| 1)))))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|)) is different from false [2021-11-14 01:39:16,307 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |c_thrThread2of2ForFork0_~c~0#1| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (<= (+ 4 |c_thrThread2of2ForFork0_~end~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0))) is different from false [2021-11-14 01:39:18,311 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 8) |c_thrThread1of2ForFork0_~c~0#1|) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_123| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_123| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (forall ((|v_thrThread1of2ForFork0_~c~0#1_122| Int)) (or (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_123| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_122| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_122| (+ |v_thrThread1of2ForFork0_~c~0#1_123| 1)))))) (<= (+ 7 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0))) is different from false [2021-11-14 01:39:18,880 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |c_thrThread2of2ForFork0_~c~0#1| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (<= (+ 4 |c_thrThread2of2ForFork0_~end~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|)) is different from false [2021-11-14 01:39:20,898 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< (+ |c_thrThread2of2ForFork0_~c~0#1| 1) |c_thrThread1of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_123| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_123| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (forall ((|v_thrThread1of2ForFork0_~c~0#1_122| Int)) (or (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_123| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_122| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_122| (+ |v_thrThread1of2ForFork0_~c~0#1_123| 1)))))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|)) is different from false [2021-11-14 01:39:21,568 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~data~0.base))) (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_122| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_122| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_122| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (<= (+ 7 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (= (select .cse0 (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (= (select .cse0 (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 10) |c_thrThread1of2ForFork0_~c~0#1|))) is different from false [2021-11-14 01:39:22,086 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~data~0.base))) (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_122| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_122| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_122| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (<= (+ 7 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (= (select .cse0 (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (= (select .cse0 (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1))) is different from false [2021-11-14 01:39:23,647 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 3 |c_thrThread2of2ForFork0_~end~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |c_thrThread2of2ForFork0_~c~0#1| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0))) is different from false [2021-11-14 01:39:24,226 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 3 |c_thrThread2of2ForFork0_~end~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |c_thrThread2of2ForFork0_~c~0#1| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|)) is different from false [2021-11-14 01:39:26,232 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_123| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_123| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (forall ((|v_thrThread1of2ForFork0_~c~0#1_122| Int)) (or (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_123| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_122| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_122| (+ |v_thrThread1of2ForFork0_~c~0#1_123| 1)))))) (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|)) is different from false [2021-11-14 01:39:27,083 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |c_thrThread2of2ForFork0_~c~0#1| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0)) (<= (+ 2 |c_thrThread2of2ForFork0_~end~0#1|) |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:39:27,677 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |c_thrThread2of2ForFork0_~c~0#1| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= (+ 2 |c_thrThread2of2ForFork0_~end~0#1|) |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:39:29,683 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_123| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_123| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (forall ((|v_thrThread1of2ForFork0_~c~0#1_122| Int)) (or (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_123| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_122| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_122| (+ |v_thrThread1of2ForFork0_~c~0#1_123| 1)))))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |c_thrThread2of2ForFork0_~c~0#1| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|)) is different from false [2021-11-14 01:39:30,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:39:30,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:39:30,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2021-11-14 01:39:30,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2021-11-14 01:39:30,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2021-11-14 01:39:30,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:39:30,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2021-11-14 01:39:30,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:39:30,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-14 01:39:30,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-14 01:39:30,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:39:30,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:39:30,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2021-11-14 01:39:30,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-11-14 01:39:30,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-11-14 01:39:30,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-14 01:39:30,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-14 01:39:30,311 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:39:30,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:39:30,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1762107686, now seen corresponding path program 11 times [2021-11-14 01:39:30,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:39:30,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466368322] [2021-11-14 01:39:30,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:39:30,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:39:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:39:30,547 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 3 proven. 542 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-14 01:39:30,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:39:30,548 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466368322] [2021-11-14 01:39:30,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466368322] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-14 01:39:30,548 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73227186] [2021-11-14 01:39:30,548 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-14 01:39:30,548 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:39:30,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-14 01:39:30,549 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-14 01:39:30,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-14 01:39:30,792 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2021-11-14 01:39:30,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-14 01:39:30,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-14 01:39:30,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-14 01:39:31,234 INFO L388 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 15 treesize of output 11 [2021-11-14 01:39:31,309 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-14 01:39:31,310 INFO L388 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 1 case distinctions, treesize of input 32 treesize of output 31 [2021-11-14 01:39:31,345 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-11-14 01:39:31,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 15 [2021-11-14 01:39:31,394 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 3 proven. 516 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-11-14 01:39:31,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-14 01:39:31,991 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread1of2ForFork0_~c~0#1_133| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_133| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_133| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) is different from false [2021-11-14 01:39:32,040 INFO L388 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 31 treesize of output 29 [2021-11-14 01:39:32,458 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 3 proven. 494 refuted. 0 times theorem prover too weak. 71 trivial. 22 not checked. [2021-11-14 01:39:32,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73227186] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-14 01:39:32,458 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-14 01:39:32,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 35 [2021-11-14 01:39:32,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480751212] [2021-11-14 01:39:32,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-14 01:39:32,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-11-14 01:39:32,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:39:32,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-11-14 01:39:32,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=958, Unknown=1, NotChecked=64, Total=1190 [2021-11-14 01:39:32,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:39:32,460 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:39:32,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 10.142857142857142) internal successors, (355), 35 states have internal predecessors, (355), 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) [2021-11-14 01:39:32,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:39:32,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:39:32,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 132 states. [2021-11-14 01:39:32,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2021-11-14 01:39:32,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 133 states. [2021-11-14 01:39:32,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:39:32,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 111 states. [2021-11-14 01:39:32,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:39:32,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2021-11-14 01:39:32,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2021-11-14 01:39:32,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:39:32,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:39:32,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 162 states. [2021-11-14 01:39:32,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2021-11-14 01:39:32,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2021-11-14 01:39:32,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:39:33,113 WARN L838 $PredicateComparison]: unable to prove that (and (<= 10 |c_thrThread1of2ForFork0_~c~0#1|) (<= 10 c_~next~0) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_133| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_133| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_133| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (<= 10 |c_thrThread2of2ForFork0_~end~0#1|) (= |c_thrThread2of2ForFork0_~c~0#1| 0) (<= (+ 3 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:39:33,722 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_133| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_133| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_133| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0)) (<= (+ 3 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:39:34,242 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_133| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_133| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_133| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (<= (+ 3 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:39:34,861 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 8) |c_thrThread1of2ForFork0_~c~0#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_133| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_133| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_133| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0)) (<= (+ 3 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:39:35,423 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 7 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_133| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_133| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_133| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0)) (<= (+ 3 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:39:35,946 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 6 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_133| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_133| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_133| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0)) (<= (+ 3 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:39:36,482 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_133| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_133| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_133| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0)) (<= (+ 5 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (<= (+ 3 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:39:37,033 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_133| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_133| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_133| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0)) (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 4) |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:39:37,682 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_133| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_133| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_133| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= (+ 3 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:39:38,389 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |c_thrThread2of2ForFork0_~c~0#1| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (<= (+ |c_thrThread2of2ForFork0_~end~0#1| 1) |c_thrThread1of2ForFork0_~c~0#1|) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0))) is different from false [2021-11-14 01:39:39,057 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |c_thrThread2of2ForFork0_~c~0#1| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (<= (+ |c_thrThread2of2ForFork0_~end~0#1| 1) |c_thrThread1of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|)) is different from false [2021-11-14 01:39:41,065 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_123| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_123| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (forall ((|v_thrThread1of2ForFork0_~c~0#1_122| Int)) (or (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_123| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_122| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_122| (+ |v_thrThread1of2ForFork0_~c~0#1_123| 1)))))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (< |c_thrThread2of2ForFork0_~c~0#1| (+ 2 |c_thrThread1of2ForFork0_~c~0#1|))) is different from false [2021-11-14 01:39:41,595 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ |c_thrThread2of2ForFork0_~c~0#1| 1) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_133| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_133| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_133| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0))) is different from false [2021-11-14 01:39:43,721 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |c_thrThread2of2ForFork0_~c~0#1| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0)) (<= |c_thrThread2of2ForFork0_~end~0#1| |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:39:44,322 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |c_thrThread2of2ForFork0_~c~0#1| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread2of2ForFork0_~end~0#1| |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:39:44,886 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_133| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_133| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_133| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0))) is different from false [2021-11-14 01:39:46,648 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_88| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_88| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_88| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread2of2ForFork0_~end~0#1| |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:39:47,165 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_106| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_106| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_106| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|)) is different from false [2021-11-14 01:39:49,172 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (forall ((|v_thrThread1of2ForFork0_~c~0#1_123| Int)) (or (< |v_thrThread1of2ForFork0_~c~0#1_123| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (forall ((|v_thrThread1of2ForFork0_~c~0#1_122| Int)) (or (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_123| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread1of2ForFork0_~c~0#1_122| 4)) 0) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread1of2ForFork0_~c~0#1_122| (+ |v_thrThread1of2ForFork0_~c~0#1_123| 1)))))) (<= (+ 7 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|)) is different from false [2021-11-14 01:39:52,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:39:52,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:39:52,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2021-11-14 01:39:52,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-11-14 01:39:52,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2021-11-14 01:39:52,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:39:52,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2021-11-14 01:39:52,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:39:52,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-14 01:39:52,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-14 01:39:52,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:39:52,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:39:52,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 222 states. [2021-11-14 01:39:52,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-11-14 01:39:52,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2021-11-14 01:39:52,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-11-14 01:39:52,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-14 01:39:52,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:39:52,391 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:39:52,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:39:52,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1462196813, now seen corresponding path program 1 times [2021-11-14 01:39:52,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:39:52,392 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617575999] [2021-11-14 01:39:52,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:39:52,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:39:52,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:39:52,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1150 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 1118 trivial. 0 not checked. [2021-11-14 01:39:52,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:39:52,516 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617575999] [2021-11-14 01:39:52,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617575999] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-14 01:39:52,516 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-14 01:39:52,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-14 01:39:52,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152995098] [2021-11-14 01:39:52,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-14 01:39:52,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-14 01:39:52,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:39:52,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-14 01:39:52,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-14 01:39:52,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:39:52,517 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:39:52,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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) [2021-11-14 01:39:52,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:39:52,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:39:52,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 142 states. [2021-11-14 01:39:52,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2021-11-14 01:39:52,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 139 states. [2021-11-14 01:39:52,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:39:52,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 118 states. [2021-11-14 01:39:52,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:39:52,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2021-11-14 01:39:52,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2021-11-14 01:39:52,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:39:52,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:39:52,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 222 states. [2021-11-14 01:39:52,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2021-11-14 01:39:52,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2021-11-14 01:39:52,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2021-11-14 01:39:52,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:40:32,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:40:32,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:40:32,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2021-11-14 01:40:32,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-11-14 01:40:32,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2021-11-14 01:40:32,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:40:32,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2021-11-14 01:40:32,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:40:32,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-14 01:40:32,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-14 01:40:32,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:40:32,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:40:32,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2021-11-14 01:40:32,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2021-11-14 01:40:32,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2021-11-14 01:40:32,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-11-14 01:40:32,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:40:32,743 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-14 01:40:32,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-14 01:40:32,745 INFO L732 BasicCegarLoop]: Path program histogram: [11, 1, 1, 1, 1, 1, 1] [2021-11-14 01:40:32,745 INFO L308 ceAbstractionStarter]: Result for error location thrThread2of2ForFork0 was SAFE (1/3) [2021-11-14 01:40:32,747 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-11-14 01:40:32,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-14 01:40:32,748 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2021-11-14 01:40:32,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (16)] Waiting until timeout for monitored process [2021-11-14 01:40:32,753 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thrThread1of2ForFork0 ======== [2021-11-14 01:40:32,753 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 [2021-11-14 01:40:32,753 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-14 01:40:32,803 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:40:32,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:40:32,803 INFO L85 PathProgramCache]: Analyzing trace with hash -503997415, now seen corresponding path program 1 times [2021-11-14 01:40:32,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:40:32,803 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446764392] [2021-11-14 01:40:32,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:40:32,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:40:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:40:32,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-14 01:40:32,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:40:32,811 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446764392] [2021-11-14 01:40:32,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446764392] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-14 01:40:32,811 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-14 01:40:32,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-14 01:40:32,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330824278] [2021-11-14 01:40:32,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-14 01:40:32,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-14 01:40:32,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:40:32,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-14 01:40:32,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-14 01:40:32,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:40:32,812 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:40:32,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 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) [2021-11-14 01:40:32,812 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:40:32,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:40:32,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-14 01:40:32,848 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:40:32,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:40:32,848 INFO L85 PathProgramCache]: Analyzing trace with hash 169184233, now seen corresponding path program 1 times [2021-11-14 01:40:32,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:40:32,849 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515186312] [2021-11-14 01:40:32,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:40:32,849 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:40:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:40:32,878 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-14 01:40:32,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:40:32,878 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515186312] [2021-11-14 01:40:32,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515186312] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-14 01:40:32,878 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-14 01:40:32,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-14 01:40:32,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496456475] [2021-11-14 01:40:32,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-14 01:40:32,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-14 01:40:32,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:40:32,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-14 01:40:32,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-14 01:40:32,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:40:32,879 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:40:32,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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) [2021-11-14 01:40:32,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:40:32,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:40:32,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:40:32,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-14 01:40:32,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-14 01:40:32,991 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:40:32,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:40:32,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1580659396, now seen corresponding path program 1 times [2021-11-14 01:40:32,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:40:32,991 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825867666] [2021-11-14 01:40:32,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:40:32,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:40:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:40:33,021 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-14 01:40:33,021 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:40:33,021 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825867666] [2021-11-14 01:40:33,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825867666] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-14 01:40:33,022 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-14 01:40:33,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-14 01:40:33,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207180835] [2021-11-14 01:40:33,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-14 01:40:33,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-14 01:40:33,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:40:33,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-14 01:40:33,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-14 01:40:33,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:40:33,023 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:40:33,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 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) [2021-11-14 01:40:33,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:40:33,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2021-11-14 01:40:33,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:40:33,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:40:33,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-14 01:40:33,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:40:33,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-14 01:40:33,169 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:40:33,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:40:33,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1561797561, now seen corresponding path program 1 times [2021-11-14 01:40:33,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:40:33,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680809501] [2021-11-14 01:40:33,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:40:33,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:40:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:40:33,338 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 83 proven. 93 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-14 01:40:33,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:40:33,338 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680809501] [2021-11-14 01:40:33,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680809501] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-14 01:40:33,338 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873763680] [2021-11-14 01:40:33,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:40:33,339 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:40:33,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-14 01:40:33,340 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-14 01:40:33,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-14 01:40:33,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:40:33,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-14 01:40:33,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-14 01:40:33,699 INFO L388 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 15 treesize of output 11 [2021-11-14 01:40:33,765 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-14 01:40:33,765 INFO L388 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 1 case distinctions, treesize of input 32 treesize of output 31 [2021-11-14 01:40:33,796 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-11-14 01:40:33,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 15 [2021-11-14 01:40:33,842 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 107 proven. 49 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-11-14 01:40:33,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-14 01:40:34,457 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_133| Int)) (or (< |v_thrThread2of2ForFork0_~c~0#1_133| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)) (= 1 (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_133| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)))))) is different from false [2021-11-14 01:40:34,641 INFO L388 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 31 treesize of output 29 [2021-11-14 01:40:34,939 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 75 proven. 54 refuted. 0 times theorem prover too weak. 44 trivial. 27 not checked. [2021-11-14 01:40:34,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873763680] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-14 01:40:34,940 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-14 01:40:34,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 29 [2021-11-14 01:40:34,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020685507] [2021-11-14 01:40:34,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-14 01:40:34,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-14 01:40:34,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:40:34,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-14 01:40:34,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=652, Unknown=1, NotChecked=52, Total=812 [2021-11-14 01:40:34,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:40:34,941 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:40:34,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 11.068965517241379) internal successors, (321), 29 states have internal predecessors, (321), 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) [2021-11-14 01:40:34,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:40:34,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2021-11-14 01:40:34,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:40:34,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:40:35,615 WARN L838 $PredicateComparison]: unable to prove that (and (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (< |c_thrThread1of2ForFork0_~c~0#1| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)) (<= 10 c_~next~0) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread2of2ForFork0_~c~0#1_133| Int)) (or (< |v_thrThread2of2ForFork0_~c~0#1_133| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)) (= 1 (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_133| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))))))) is different from false [2021-11-14 01:40:36,144 WARN L838 $PredicateComparison]: unable to prove that (and (<= 10 |c_thrThread2of2ForFork0_~c~0#1|) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) |c_thrThread2of2ForFork0_~c~0#1|) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (<= 10 c_~next~0) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread2of2ForFork0_~c~0#1_133| Int)) (or (< |v_thrThread2of2ForFork0_~c~0#1_133| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)) (= 1 (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_133| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))))))) is different from false [2021-11-14 01:40:36,800 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (<= |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (not (= |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (forall ((|v_thrThread2of2ForFork0_~c~0#1_133| Int)) (or (< |v_thrThread2of2ForFork0_~c~0#1_133| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)) (= 1 (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_133| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)))))) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1)) is different from false [2021-11-14 01:40:37,375 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|v_thrThread2of2ForFork0_~c~0#1_133| Int)) (or (< |v_thrThread2of2ForFork0_~c~0#1_133| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)) (= 1 (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_133| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))))))) is different from false [2021-11-14 01:40:38,181 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (forall ((|v_thrThread2of2ForFork0_~c~0#1_133| Int)) (or (< |v_thrThread2of2ForFork0_~c~0#1_133| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)) (= 1 (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_133| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)))))) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1)) is different from false [2021-11-14 01:40:38,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:40:38,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-14 01:40:38,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:40:38,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2021-11-14 01:40:38,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-14 01:40:38,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-11-14 01:40:38,842 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:40:38,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:40:38,843 INFO L85 PathProgramCache]: Analyzing trace with hash 348862888, now seen corresponding path program 2 times [2021-11-14 01:40:38,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:40:38,843 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424442936] [2021-11-14 01:40:38,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:40:38,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:40:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:40:39,005 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 39 proven. 279 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-11-14 01:40:39,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:40:39,006 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424442936] [2021-11-14 01:40:39,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424442936] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-14 01:40:39,006 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219727291] [2021-11-14 01:40:39,006 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-14 01:40:39,006 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:40:39,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-14 01:40:39,007 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-14 01:40:39,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-14 01:40:39,076 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-14 01:40:39,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-14 01:40:39,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-14 01:40:39,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-14 01:40:39,425 INFO L388 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 15 treesize of output 11 [2021-11-14 01:40:39,489 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-14 01:40:39,489 INFO L388 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 1 case distinctions, treesize of input 32 treesize of output 31 [2021-11-14 01:40:39,519 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-11-14 01:40:39,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 15 [2021-11-14 01:40:39,565 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 51 proven. 259 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-11-14 01:40:39,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-14 01:40:40,209 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_144| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_144| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread2of2ForFork0_~c~0#1_144| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)))) is different from false [2021-11-14 01:40:40,251 INFO L388 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 31 treesize of output 29 [2021-11-14 01:40:40,669 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 31 proven. 252 refuted. 0 times theorem prover too weak. 61 trivial. 27 not checked. [2021-11-14 01:40:40,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219727291] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-14 01:40:40,669 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-14 01:40:40,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2021-11-14 01:40:40,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734215084] [2021-11-14 01:40:40,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-14 01:40:40,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-14 01:40:40,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:40:40,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-14 01:40:40,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=800, Unknown=1, NotChecked=58, Total=992 [2021-11-14 01:40:40,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:40:40,670 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:40:40,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 11.28125) internal successors, (361), 32 states have internal predecessors, (361), 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) [2021-11-14 01:40:40,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:40:40,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2021-11-14 01:40:40,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:40:40,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2021-11-14 01:40:40,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:40:41,348 WARN L838 $PredicateComparison]: unable to prove that (and (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (forall ((|v_thrThread2of2ForFork0_~c~0#1_144| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_144| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread2of2ForFork0_~c~0#1_144| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)))) (< |c_thrThread1of2ForFork0_~c~0#1| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)) (<= 10 c_~next~0) (= |c_thrThread1of2ForFork0_~c~0#1| 0)) is different from false [2021-11-14 01:40:41,914 WARN L838 $PredicateComparison]: unable to prove that (and (<= 10 |c_thrThread2of2ForFork0_~c~0#1|) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (forall ((|v_thrThread2of2ForFork0_~c~0#1_144| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_144| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread2of2ForFork0_~c~0#1_144| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)))) (<= 10 c_~next~0) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:40:42,557 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|v_thrThread2of2ForFork0_~c~0#1_144| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_144| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread2of2ForFork0_~c~0#1_144| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)))) (not (= |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:40:43,085 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|v_thrThread2of2ForFork0_~c~0#1_144| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_144| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread2of2ForFork0_~c~0#1_144| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:40:43,758 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_144| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_144| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread2of2ForFork0_~c~0#1_144| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)))) (not (= |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (<= (+ 8 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:40:44,325 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_144| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_144| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread2of2ForFork0_~c~0#1_144| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)))) (not (= |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:40:44,892 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_144| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_144| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread2of2ForFork0_~c~0#1_144| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)))) (not (= |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (< (+ 2 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:40:45,492 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_144| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_144| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread2of2ForFork0_~c~0#1_144| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)))) (< (+ |c_thrThread1of2ForFork0_~c~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (not (= |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1| 0))) is different from false [2021-11-14 01:40:46,047 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_144| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_144| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread2of2ForFork0_~c~0#1_144| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)))) (not (= |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread2of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:40:46,633 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_144| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_144| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread2of2ForFork0_~c~0#1_144| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)))) (< |c_thrThread1of2ForFork0_~c~0#1| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)) (not (= |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1| 0))) is different from false [2021-11-14 01:40:47,144 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_144| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_144| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread2of2ForFork0_~c~0#1_144| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)))) (< |c_thrThread1of2ForFork0_~c~0#1| (+ |c_thrThread2of2ForFork0_~c~0#1| 1))) is different from false [2021-11-14 01:40:47,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:40:47,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-14 01:40:47,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:40:47,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-11-14 01:40:47,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-14 01:40:47,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-11-14 01:40:47,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:40:47,577 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:40:47,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:40:47,577 INFO L85 PathProgramCache]: Analyzing trace with hash -761166269, now seen corresponding path program 3 times [2021-11-14 01:40:47,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:40:47,577 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979978627] [2021-11-14 01:40:47,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:40:47,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:40:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:40:47,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1322 backedges. 1132 proven. 171 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-14 01:40:47,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:40:47,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979978627] [2021-11-14 01:40:47,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979978627] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-14 01:40:47,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294090145] [2021-11-14 01:40:47,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-14 01:40:47,801 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:40:47,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-14 01:40:47,802 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-14 01:40:47,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-14 01:40:47,963 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-11-14 01:40:47,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-14 01:40:47,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-14 01:40:47,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-14 01:40:48,244 INFO L388 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 15 treesize of output 11 [2021-11-14 01:40:48,266 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-14 01:40:48,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2021-11-14 01:40:48,600 INFO L388 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 15 treesize of output 11 [2021-11-14 01:40:48,696 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-14 01:40:48,696 INFO L388 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 1 case distinctions, treesize of input 35 treesize of output 34 [2021-11-14 01:40:48,746 INFO L354 Elim1Store]: treesize reduction 8, result has 50.0 percent of original size [2021-11-14 01:40:48,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2021-11-14 01:40:48,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1322 backedges. 682 proven. 223 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2021-11-14 01:40:48,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-14 01:40:49,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1322 backedges. 686 proven. 203 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2021-11-14 01:40:49,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294090145] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-14 01:40:49,487 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-14 01:40:49,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 15] total 39 [2021-11-14 01:40:49,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354422810] [2021-11-14 01:40:49,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-14 01:40:49,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-11-14 01:40:49,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:40:49,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-11-14 01:40:49,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1308, Unknown=0, NotChecked=0, Total=1482 [2021-11-14 01:40:49,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:40:49,489 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:40:49,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 13.717948717948717) internal successors, (535), 39 states have internal predecessors, (535), 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) [2021-11-14 01:40:49,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:40:49,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2021-11-14 01:40:49,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:40:49,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2021-11-14 01:40:49,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2021-11-14 01:40:49,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:40:53,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:40:53,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-14 01:40:53,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:40:53,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-11-14 01:40:53,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-14 01:40:53,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2021-11-14 01:40:53,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-14 01:40:53,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:40:53,705 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:40:53,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:40:53,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1770408351, now seen corresponding path program 4 times [2021-11-14 01:40:53,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:40:53,720 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996397046] [2021-11-14 01:40:53,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:40:53,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:40:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:40:53,918 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 12 proven. 512 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-11-14 01:40:53,918 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:40:53,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996397046] [2021-11-14 01:40:53,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996397046] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-14 01:40:53,918 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218405508] [2021-11-14 01:40:53,919 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-14 01:40:53,919 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:40:53,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-14 01:40:53,919 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-14 01:40:53,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-14 01:40:53,986 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-14 01:40:53,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-14 01:40:53,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-14 01:40:53,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-14 01:40:54,361 INFO L388 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 15 treesize of output 11 [2021-11-14 01:40:54,388 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-14 01:40:54,388 INFO L388 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 1 case distinctions, treesize of input 32 treesize of output 31 [2021-11-14 01:40:54,419 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-11-14 01:40:54,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 15 [2021-11-14 01:40:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 20 proven. 489 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-11-14 01:40:54,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-14 01:40:54,525 INFO L388 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 25 treesize of output 23 [2021-11-14 01:40:54,911 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 20 proven. 489 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-11-14 01:40:54,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218405508] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-14 01:40:54,911 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-14 01:40:54,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 32 [2021-11-14 01:40:54,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027495871] [2021-11-14 01:40:54,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-14 01:40:54,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-14 01:40:54,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:40:54,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-14 01:40:54,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2021-11-14 01:40:54,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:40:54,913 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:40:54,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 10.65625) internal successors, (341), 32 states have internal predecessors, (341), 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) [2021-11-14 01:40:54,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:40:54,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2021-11-14 01:40:54,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:40:54,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2021-11-14 01:40:54,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2021-11-14 01:40:54,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 109 states. [2021-11-14 01:40:54,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:41:02,483 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (forall ((|v_thrThread2of2ForFork0_~c~0#1_133| Int)) (or (< |v_thrThread2of2ForFork0_~c~0#1_133| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)) (= 1 (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_133| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)))))) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1)) is different from false [2021-11-14 01:41:04,920 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_thrThread1of2ForFork0_~c~0#1| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (forall ((|v_thrThread2of2ForFork0_~c~0#1_133| Int)) (or (< |v_thrThread2of2ForFork0_~c~0#1_133| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)) (= 1 (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_133| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))))))) is different from false [2021-11-14 01:41:05,570 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_thrThread1of2ForFork0_~c~0#1| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)) (forall ((|v_thrThread2of2ForFork0_~c~0#1_133| Int)) (or (< |v_thrThread2of2ForFork0_~c~0#1_133| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)) (= 1 (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_133| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))))))) is different from false [2021-11-14 01:41:06,402 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_thrThread1of2ForFork0_~c~0#1| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)) (<= |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (not (= |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread2of2ForFork0_~c~0#1_133| Int)) (or (< |v_thrThread2of2ForFork0_~c~0#1_133| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)) (= 1 (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_133| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))))))) is different from false [2021-11-14 01:41:10,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:41:10,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:41:10,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:41:10,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-11-14 01:41:10,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-11-14 01:41:10,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 419 states. [2021-11-14 01:41:10,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2021-11-14 01:41:10,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-14 01:41:10,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:41:10,452 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:41:10,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:41:10,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1033607807, now seen corresponding path program 1 times [2021-11-14 01:41:10,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:41:10,452 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219070103] [2021-11-14 01:41:10,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:41:10,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:41:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:41:10,581 INFO L134 CoverageAnalysis]: Checked inductivity of 5759 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 5642 trivial. 0 not checked. [2021-11-14 01:41:10,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:41:10,581 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219070103] [2021-11-14 01:41:10,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219070103] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-14 01:41:10,582 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-14 01:41:10,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-14 01:41:10,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175946526] [2021-11-14 01:41:10,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-14 01:41:10,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-14 01:41:10,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:41:10,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-14 01:41:10,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-14 01:41:10,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:41:10,583 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:41:10,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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) [2021-11-14 01:41:10,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:41:10,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:41:10,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:41:10,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2021-11-14 01:41:10,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2021-11-14 01:41:10,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 419 states. [2021-11-14 01:41:10,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 119 states. [2021-11-14 01:41:10,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:41:12,288 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (not (= |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|v_thrThread2of2ForFork0_~c~0#1_133| Int)) (or (< |v_thrThread2of2ForFork0_~c~0#1_133| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)) (= 1 (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_133| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)))))) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1)) is different from false [2021-11-14 01:41:14,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:41:14,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:41:14,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:41:14,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2021-11-14 01:41:14,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-11-14 01:41:14,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 470 states. [2021-11-14 01:41:14,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2021-11-14 01:41:14,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:41:14,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-14 01:41:14,771 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:41:14,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:41:14,771 INFO L85 PathProgramCache]: Analyzing trace with hash -61087329, now seen corresponding path program 2 times [2021-11-14 01:41:14,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:41:14,771 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987548955] [2021-11-14 01:41:14,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:41:14,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:41:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:41:14,789 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-14 01:41:14,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:41:14,789 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987548955] [2021-11-14 01:41:14,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987548955] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-14 01:41:14,790 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-14 01:41:14,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-14 01:41:14,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499775413] [2021-11-14 01:41:14,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-14 01:41:14,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-14 01:41:14,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:41:14,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-14 01:41:14,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-14 01:41:14,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:41:14,790 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:41:14,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-14 01:41:14,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:41:14,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:41:14,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:41:14,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 85 states. [2021-11-14 01:41:14,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2021-11-14 01:41:14,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 470 states. [2021-11-14 01:41:14,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 125 states. [2021-11-14 01:41:14,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:41:14,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:41:14,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:41:14,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:41:14,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:41:14,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2021-11-14 01:41:14,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-11-14 01:41:14,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 470 states. [2021-11-14 01:41:14,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2021-11-14 01:41:14,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:41:14,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:41:14,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-14 01:41:14,826 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:41:14,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:41:14,826 INFO L85 PathProgramCache]: Analyzing trace with hash 642425270, now seen corresponding path program 1 times [2021-11-14 01:41:14,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:41:14,826 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398404621] [2021-11-14 01:41:14,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:41:14,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:41:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:41:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-14 01:41:14,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:41:14,891 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398404621] [2021-11-14 01:41:14,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398404621] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-14 01:41:14,891 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112743604] [2021-11-14 01:41:14,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:41:14,891 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:41:14,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-14 01:41:14,895 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-14 01:41:14,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-14 01:41:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:41:15,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-14 01:41:15,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-14 01:41:15,391 INFO L388 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 15 treesize of output 11 [2021-11-14 01:41:15,421 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-14 01:41:15,422 INFO L388 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 1 case distinctions, treesize of input 28 treesize of output 27 [2021-11-14 01:41:15,433 INFO L388 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 23 treesize of output 7 [2021-11-14 01:41:15,481 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-14 01:41:15,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-14 01:41:16,102 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_#t~pre6#1| Int) (|ULTIMATE.start_main_~#t~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base|) |ULTIMATE.start_main_~#t~0#1.offset| |ULTIMATE.start_main_#t~pre6#1|)) c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1)) is different from false [2021-11-14 01:41:16,222 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 2 not checked. [2021-11-14 01:41:16,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112743604] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-14 01:41:16,222 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-14 01:41:16,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18 [2021-11-14 01:41:16,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604756923] [2021-11-14 01:41:16,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-14 01:41:16,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-14 01:41:16,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:41:16,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-14 01:41:16,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=231, Unknown=1, NotChecked=30, Total=306 [2021-11-14 01:41:16,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:41:16,223 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:41:16,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.555555555555555) internal successors, (172), 18 states have internal predecessors, (172), 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) [2021-11-14 01:41:16,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:41:16,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:41:16,223 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:41:16,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 85 states. [2021-11-14 01:41:16,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2021-11-14 01:41:16,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 470 states. [2021-11-14 01:41:16,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 125 states. [2021-11-14 01:41:16,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:41:16,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:41:16,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:41:17,605 WARN L838 $PredicateComparison]: unable to prove that (and (<= 10 |c_thrThread2of2ForFork0_~c~0#1|) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) |c_thrThread2of2ForFork0_~c~0#1|) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread2of2ForFork0_~c~0#1_133| Int)) (or (< |v_thrThread2of2ForFork0_~c~0#1_133| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)) (= 1 (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_133| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))))))) is different from false [2021-11-14 01:41:18,127 WARN L838 $PredicateComparison]: unable to prove that (and (<= 10 |c_thrThread2of2ForFork0_~c~0#1|) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (forall ((|v_thrThread2of2ForFork0_~c~0#1_144| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_144| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread2of2ForFork0_~c~0#1_144| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)))) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:41:18,724 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) |c_thrThread2of2ForFork0_~c~0#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread2of2ForFork0_~c~0#1_133| Int)) (or (< |v_thrThread2of2ForFork0_~c~0#1_133| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)) (= 1 (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_133| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))))))) is different from false [2021-11-14 01:41:20,113 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 10) |c_thrThread2of2ForFork0_~c~0#1|) (<= |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|) (not (= |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread2of2ForFork0_~c~0#1_133| Int)) (or (< |v_thrThread2of2ForFork0_~c~0#1_133| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)) (= 1 (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_133| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))))))) is different from false [2021-11-14 01:41:22,481 WARN L838 $PredicateComparison]: unable to prove that (and (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (< |c_thrThread1of2ForFork0_~c~0#1| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread2of2ForFork0_~c~0#1_133| Int)) (or (< |v_thrThread2of2ForFork0_~c~0#1_133| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)) (= 1 (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_133| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))))))) is different from false [2021-11-14 01:41:22,986 WARN L838 $PredicateComparison]: unable to prove that (and (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (forall ((|v_thrThread2of2ForFork0_~c~0#1_144| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_144| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (< |v_thrThread2of2ForFork0_~c~0#1_144| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)))) (< |c_thrThread1of2ForFork0_~c~0#1| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)) (= |c_thrThread1of2ForFork0_~c~0#1| 0)) is different from false [2021-11-14 01:41:27,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:41:27,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:41:27,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:41:27,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2021-11-14 01:41:27,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-11-14 01:41:27,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 604 states. [2021-11-14 01:41:27,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2021-11-14 01:41:27,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:41:27,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:41:27,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-14 01:41:27,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-11-14 01:41:27,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-11-14 01:41:27,486 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:41:27,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:41:27,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1329965674, now seen corresponding path program 5 times [2021-11-14 01:41:27,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:41:27,486 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176507206] [2021-11-14 01:41:27,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:41:27,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:41:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:41:27,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1070 backedges. 2 proven. 110 refuted. 0 times theorem prover too weak. 958 trivial. 0 not checked. [2021-11-14 01:41:27,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:41:27,657 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176507206] [2021-11-14 01:41:27,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176507206] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-14 01:41:27,657 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154844518] [2021-11-14 01:41:27,657 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-14 01:41:27,657 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:41:27,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-14 01:41:27,668 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-14 01:41:27,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-14 01:41:34,168 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2021-11-14 01:41:34,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-14 01:41:34,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-14 01:41:34,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-14 01:41:34,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1070 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1057 trivial. 0 not checked. [2021-11-14 01:41:34,584 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-14 01:41:34,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154844518] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-14 01:41:34,584 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-14 01:41:34,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2021-11-14 01:41:34,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136843363] [2021-11-14 01:41:34,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-14 01:41:34,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-14 01:41:34,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:41:34,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-14 01:41:34,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-14 01:41:34,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:41:34,585 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:41:34,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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) [2021-11-14 01:41:34,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:41:34,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:41:34,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:41:34,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 97 states. [2021-11-14 01:41:34,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2021-11-14 01:41:34,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 604 states. [2021-11-14 01:41:34,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 144 states. [2021-11-14 01:41:34,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:41:34,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:41:34,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2021-11-14 01:41:34,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:41:40,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:41:40,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:41:40,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:41:40,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2021-11-14 01:41:40,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-11-14 01:41:40,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 719 states. [2021-11-14 01:41:40,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2021-11-14 01:41:40,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:41:40,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-14 01:41:40,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-14 01:41:40,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-14 01:41:40,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2021-11-14 01:41:40,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:41:40,330 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:41:40,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:41:40,330 INFO L85 PathProgramCache]: Analyzing trace with hash 11771269, now seen corresponding path program 6 times [2021-11-14 01:41:40,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:41:40,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836987111] [2021-11-14 01:41:40,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:41:40,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:41:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:41:40,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2009 backedges. 1937 proven. 11 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-11-14 01:41:40,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:41:40,486 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836987111] [2021-11-14 01:41:40,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836987111] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-14 01:41:40,486 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688546266] [2021-11-14 01:41:40,487 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-14 01:41:40,487 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:41:40,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-14 01:41:40,487 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-14 01:41:40,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-14 01:41:50,192 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2021-11-14 01:41:50,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-14 01:41:50,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-14 01:41:50,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-14 01:41:51,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2009 backedges. 1968 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-11-14 01:41:51,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-14 01:41:51,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688546266] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-14 01:41:51,034 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-14 01:41:51,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [16] total 31 [2021-11-14 01:41:51,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402242655] [2021-11-14 01:41:51,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-14 01:41:51,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-14 01:41:51,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:41:51,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-14 01:41:51,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=702, Unknown=0, NotChecked=0, Total=930 [2021-11-14 01:41:51,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:41:51,035 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:41:51,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 21.823529411764707) internal successors, (371), 17 states have internal predecessors, (371), 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) [2021-11-14 01:41:51,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:41:51,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:41:51,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:41:51,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 123 states. [2021-11-14 01:41:51,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2021-11-14 01:41:51,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 719 states. [2021-11-14 01:41:51,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 154 states. [2021-11-14 01:41:51,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:41:51,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2021-11-14 01:41:51,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2021-11-14 01:41:51,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-14 01:41:51,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:41:52,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:41:52,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:41:52,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:41:52,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2021-11-14 01:41:52,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-11-14 01:41:52,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 748 states. [2021-11-14 01:41:52,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2021-11-14 01:41:52,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:41:52,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-14 01:41:52,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-14 01:41:52,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-14 01:41:52,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:41:52,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2021-11-14 01:41:52,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:41:52,383 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:41:52,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:41:52,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1750096341, now seen corresponding path program 7 times [2021-11-14 01:41:52,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:41:52,384 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306970942] [2021-11-14 01:41:52,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:41:52,384 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:41:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:41:52,582 INFO L134 CoverageAnalysis]: Checked inductivity of 965 backedges. 45 proven. 252 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2021-11-14 01:41:52,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:41:52,582 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306970942] [2021-11-14 01:41:52,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306970942] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-14 01:41:52,583 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717226964] [2021-11-14 01:41:52,583 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-14 01:41:52,583 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:41:52,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-14 01:41:52,583 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-14 01:41:52,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-11-14 01:41:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:41:52,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-14 01:41:52,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-14 01:41:53,165 INFO L388 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 15 treesize of output 11 [2021-11-14 01:41:53,189 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-14 01:41:53,190 INFO L388 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 1 case distinctions, treesize of input 32 treesize of output 31 [2021-11-14 01:41:53,218 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-11-14 01:41:53,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 15 [2021-11-14 01:41:53,263 INFO L134 CoverageAnalysis]: Checked inductivity of 965 backedges. 53 proven. 220 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2021-11-14 01:41:53,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-14 01:41:53,317 INFO L388 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 25 treesize of output 23 [2021-11-14 01:41:53,853 INFO L134 CoverageAnalysis]: Checked inductivity of 965 backedges. 45 proven. 252 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2021-11-14 01:41:53,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717226964] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-14 01:41:53,854 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-14 01:41:53,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 29 [2021-11-14 01:41:53,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333581711] [2021-11-14 01:41:53,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-14 01:41:53,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-14 01:41:53,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:41:53,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-14 01:41:53,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2021-11-14 01:41:53,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:41:53,855 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:41:53,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.206896551724139) internal successors, (267), 29 states have internal predecessors, (267), 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) [2021-11-14 01:41:53,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:41:53,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:41:53,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:41:53,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 123 states. [2021-11-14 01:41:53,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2021-11-14 01:41:53,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 748 states. [2021-11-14 01:41:53,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 154 states. [2021-11-14 01:41:53,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:41:53,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2021-11-14 01:41:53,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2021-11-14 01:41:53,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-14 01:41:53,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:41:53,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:41:54,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:41:54,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:41:54,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:41:54,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2021-11-14 01:41:54,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-11-14 01:41:54,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 748 states. [2021-11-14 01:41:54,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2021-11-14 01:41:54,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:41:54,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-14 01:41:54,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-14 01:41:54,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-14 01:41:54,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:41:54,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-11-14 01:41:54,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2021-11-14 01:41:54,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:41:54,818 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:41:54,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:41:54,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1288925049, now seen corresponding path program 8 times [2021-11-14 01:41:54,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:41:54,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765457525] [2021-11-14 01:41:54,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:41:54,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:41:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:41:55,162 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 81 proven. 399 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2021-11-14 01:41:55,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:41:55,162 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765457525] [2021-11-14 01:41:55,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765457525] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-14 01:41:55,162 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912061727] [2021-11-14 01:41:55,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-14 01:41:55,162 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:41:55,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-14 01:41:55,176 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-14 01:41:55,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-11-14 01:41:55,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-14 01:41:55,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-14 01:41:55,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-14 01:41:55,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-14 01:41:55,729 INFO L388 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 15 treesize of output 11 [2021-11-14 01:41:55,777 INFO L388 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 34 treesize of output 29 [2021-11-14 01:41:55,784 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-14 01:41:55,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 34 treesize of output 38 [2021-11-14 01:41:55,816 INFO L354 Elim1Store]: treesize reduction 53, result has 17.2 percent of original size [2021-11-14 01:41:55,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 29 [2021-11-14 01:41:55,954 INFO L354 Elim1Store]: treesize reduction 80, result has 27.9 percent of original size [2021-11-14 01:41:55,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 58 [2021-11-14 01:41:56,038 INFO L354 Elim1Store]: treesize reduction 100, result has 30.1 percent of original size [2021-11-14 01:41:56,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 81 [2021-11-14 01:41:56,311 INFO L354 Elim1Store]: treesize reduction 140, result has 26.3 percent of original size [2021-11-14 01:41:56,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 85 [2021-11-14 01:41:56,564 INFO L354 Elim1Store]: treesize reduction 164, result has 31.1 percent of original size [2021-11-14 01:41:56,565 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 91 treesize of output 128 [2021-11-14 01:41:57,195 INFO L354 Elim1Store]: treesize reduction 216, result has 24.2 percent of original size [2021-11-14 01:41:57,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 112 [2021-11-14 01:41:58,022 INFO L354 Elim1Store]: treesize reduction 124, result has 23.0 percent of original size [2021-11-14 01:41:58,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 111 treesize of output 99 [2021-11-14 01:41:58,071 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 81 proven. 399 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2021-11-14 01:41:58,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-14 01:41:58,667 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_216| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_216| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (< (+ |c_thrThread2of2ForFork0_~c~0#1| 1) |v_thrThread2of2ForFork0_~c~0#1_216|))) is different from false [2021-11-14 01:41:59,361 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_216| Int)) (or (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_216| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (< (+ |c_thrThread2of2ForFork0_~c~0#1| 1) |v_thrThread2of2ForFork0_~c~0#1_216|))) is different from false [2021-11-14 01:42:01,390 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_217| Int)) (or (forall ((|v_thrThread2of2ForFork0_~c~0#1_216| Int)) (or (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_217| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_216| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (< (+ 1 |v_thrThread2of2ForFork0_~c~0#1_217|) |v_thrThread2of2ForFork0_~c~0#1_216|))) (< (+ |c_thrThread2of2ForFork0_~c~0#1| 1) |v_thrThread2of2ForFork0_~c~0#1_217|))) is different from false [2021-11-14 01:42:02,837 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_217| Int) (|v_thrThread2of2ForFork0_~c~0#1_216| Int)) (or (< (+ |c_thrThread2of2ForFork0_~c~0#1| 1) |v_thrThread2of2ForFork0_~c~0#1_217|) (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_217| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_216| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (< (+ 1 |v_thrThread2of2ForFork0_~c~0#1_217|) |v_thrThread2of2ForFork0_~c~0#1_216|))) is different from false [2021-11-14 01:42:04,928 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_218| Int)) (or (forall ((|v_thrThread2of2ForFork0_~c~0#1_217| Int) (|v_thrThread2of2ForFork0_~c~0#1_216| Int)) (or (< (+ 1 |v_thrThread2of2ForFork0_~c~0#1_218|) |v_thrThread2of2ForFork0_~c~0#1_217|) (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_218| 4)) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_217| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_216| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (< (+ 1 |v_thrThread2of2ForFork0_~c~0#1_217|) |v_thrThread2of2ForFork0_~c~0#1_216|))) (< (+ |c_thrThread2of2ForFork0_~c~0#1| 1) |v_thrThread2of2ForFork0_~c~0#1_218|))) is different from false [2021-11-14 01:42:07,394 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_217| Int) (|v_thrThread2of2ForFork0_~c~0#1_218| Int) (|v_thrThread2of2ForFork0_~c~0#1_216| Int)) (or (< (+ 1 |v_thrThread2of2ForFork0_~c~0#1_218|) |v_thrThread2of2ForFork0_~c~0#1_217|) (< (+ |c_thrThread2of2ForFork0_~c~0#1| 1) |v_thrThread2of2ForFork0_~c~0#1_218|) (= 1 (select (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_218| 4)) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_217| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_216| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)))) (< (+ 1 |v_thrThread2of2ForFork0_~c~0#1_217|) |v_thrThread2of2ForFork0_~c~0#1_216|))) is different from false [2021-11-14 01:42:09,584 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_219| Int)) (or (forall ((|v_thrThread2of2ForFork0_~c~0#1_217| Int) (|v_thrThread2of2ForFork0_~c~0#1_218| Int) (|v_thrThread2of2ForFork0_~c~0#1_216| Int)) (or (< (+ 1 |v_thrThread2of2ForFork0_~c~0#1_218|) |v_thrThread2of2ForFork0_~c~0#1_217|) (= (select (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_219| 4)) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_218| 4)) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_217| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_216| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (< (+ 1 |v_thrThread2of2ForFork0_~c~0#1_219|) |v_thrThread2of2ForFork0_~c~0#1_218|) (< (+ 1 |v_thrThread2of2ForFork0_~c~0#1_217|) |v_thrThread2of2ForFork0_~c~0#1_216|))) (< (+ |c_thrThread2of2ForFork0_~c~0#1| 1) |v_thrThread2of2ForFork0_~c~0#1_219|))) is different from false [2021-11-14 01:42:10,089 INFO L388 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 67 treesize of output 65 [2021-11-14 01:42:10,471 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 45 proven. 137 refuted. 0 times theorem prover too weak. 185 trivial. 298 not checked. [2021-11-14 01:42:10,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912061727] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-14 01:42:10,471 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-14 01:42:10,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23, 20] total 47 [2021-11-14 01:42:10,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048413250] [2021-11-14 01:42:10,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-14 01:42:10,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-11-14 01:42:10,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:42:10,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-11-14 01:42:10,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1339, Unknown=7, NotChecked=574, Total=2162 [2021-11-14 01:42:10,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:42:10,473 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:42:10,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 8.085106382978724) internal successors, (380), 47 states have internal predecessors, (380), 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) [2021-11-14 01:42:10,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:42:10,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:42:10,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:42:10,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 123 states. [2021-11-14 01:42:10,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2021-11-14 01:42:10,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 748 states. [2021-11-14 01:42:10,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 154 states. [2021-11-14 01:42:10,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:42:10,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2021-11-14 01:42:10,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2021-11-14 01:42:10,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-14 01:42:10,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:42:10,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2021-11-14 01:42:10,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:42:12,677 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (< (+ 5 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~end~0#1|) (forall ((|v_thrThread2of2ForFork0_~c~0#1_219| Int)) (or (forall ((|v_thrThread2of2ForFork0_~c~0#1_217| Int) (|v_thrThread2of2ForFork0_~c~0#1_218| Int) (|v_thrThread2of2ForFork0_~c~0#1_216| Int)) (or (< (+ 1 |v_thrThread2of2ForFork0_~c~0#1_218|) |v_thrThread2of2ForFork0_~c~0#1_217|) (= (select (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_219| 4)) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_218| 4)) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_217| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_216| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (< (+ 1 |v_thrThread2of2ForFork0_~c~0#1_219|) |v_thrThread2of2ForFork0_~c~0#1_218|) (< (+ 1 |v_thrThread2of2ForFork0_~c~0#1_217|) |v_thrThread2of2ForFork0_~c~0#1_216|))) (< (+ |c_thrThread2of2ForFork0_~c~0#1| 1) |v_thrThread2of2ForFork0_~c~0#1_219|)))) is different from false [2021-11-14 01:42:14,684 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread2of2ForFork0_~c~0#1_219| Int)) (or (forall ((|v_thrThread2of2ForFork0_~c~0#1_217| Int) (|v_thrThread2of2ForFork0_~c~0#1_218| Int) (|v_thrThread2of2ForFork0_~c~0#1_216| Int)) (or (< (+ 1 |v_thrThread2of2ForFork0_~c~0#1_218|) |v_thrThread2of2ForFork0_~c~0#1_217|) (= (select (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_219| 4)) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_218| 4)) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_217| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_216| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (< (+ 1 |v_thrThread2of2ForFork0_~c~0#1_219|) |v_thrThread2of2ForFork0_~c~0#1_218|) (< (+ 1 |v_thrThread2of2ForFork0_~c~0#1_217|) |v_thrThread2of2ForFork0_~c~0#1_216|))) (< (+ |c_thrThread2of2ForFork0_~c~0#1| 1) |v_thrThread2of2ForFork0_~c~0#1_219|)))) is different from false [2021-11-14 01:43:08,225 WARN L227 SmtUtils]: Spent 14.03s on a formula simplification. DAG size of input: 50 DAG size of output: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-14 01:43:10,544 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (forall ((|v_thrThread2of2ForFork0_~c~0#1_219| Int)) (or (forall ((|v_thrThread2of2ForFork0_~c~0#1_217| Int) (|v_thrThread2of2ForFork0_~c~0#1_218| Int) (|v_thrThread2of2ForFork0_~c~0#1_216| Int)) (or (< (+ 1 |v_thrThread2of2ForFork0_~c~0#1_218|) |v_thrThread2of2ForFork0_~c~0#1_217|) (= (select (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_219| 4)) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_218| 4)) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_217| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_216| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (< (+ 1 |v_thrThread2of2ForFork0_~c~0#1_219|) |v_thrThread2of2ForFork0_~c~0#1_218|) (< (+ 1 |v_thrThread2of2ForFork0_~c~0#1_217|) |v_thrThread2of2ForFork0_~c~0#1_216|))) (< (+ |c_thrThread2of2ForFork0_~c~0#1| 1) |v_thrThread2of2ForFork0_~c~0#1_219|)))) is different from false [2021-11-14 01:43:11,493 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 8) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|v_thrThread2of2ForFork0_~c~0#1_217| Int) (|v_thrThread2of2ForFork0_~c~0#1_218| Int) (|v_thrThread2of2ForFork0_~c~0#1_216| Int)) (or (< (+ 1 |v_thrThread2of2ForFork0_~c~0#1_218|) |v_thrThread2of2ForFork0_~c~0#1_217|) (< (+ |c_thrThread2of2ForFork0_~c~0#1| 1) |v_thrThread2of2ForFork0_~c~0#1_218|) (= 1 (select (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_218| 4)) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_217| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_216| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)))) (< (+ 1 |v_thrThread2of2ForFork0_~c~0#1_217|) |v_thrThread2of2ForFork0_~c~0#1_216|))) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1)) is different from false [2021-11-14 01:43:12,269 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~data~0.base))) (and (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 8) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|v_thrThread2of2ForFork0_~c~0#1_217| Int) (|v_thrThread2of2ForFork0_~c~0#1_218| Int) (|v_thrThread2of2ForFork0_~c~0#1_216| Int)) (or (< (+ 1 |v_thrThread2of2ForFork0_~c~0#1_218|) |v_thrThread2of2ForFork0_~c~0#1_217|) (< (+ |c_thrThread2of2ForFork0_~c~0#1| 1) |v_thrThread2of2ForFork0_~c~0#1_218|) (= 1 (select (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_218| 4)) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_217| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_216| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)))) (< (+ 1 |v_thrThread2of2ForFork0_~c~0#1_217|) |v_thrThread2of2ForFork0_~c~0#1_216|))) (= (select .cse0 (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (= (select .cse0 (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 0))) is different from false [2021-11-14 01:43:14,273 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~data~0.base))) (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_218| Int)) (or (forall ((|v_thrThread2of2ForFork0_~c~0#1_217| Int) (|v_thrThread2of2ForFork0_~c~0#1_216| Int)) (or (< (+ 1 |v_thrThread2of2ForFork0_~c~0#1_218|) |v_thrThread2of2ForFork0_~c~0#1_217|) (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_218| 4)) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_217| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_216| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (< (+ 1 |v_thrThread2of2ForFork0_~c~0#1_217|) |v_thrThread2of2ForFork0_~c~0#1_216|))) (< (+ |c_thrThread2of2ForFork0_~c~0#1| 1) |v_thrThread2of2ForFork0_~c~0#1_218|))) (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 8) |c_thrThread1of2ForFork0_~c~0#1|) (= (select .cse0 (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (= (select .cse0 (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1))) is different from false [2021-11-14 01:43:16,283 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_217| Int) (|v_thrThread2of2ForFork0_~c~0#1_216| Int)) (or (< (+ |c_thrThread2of2ForFork0_~c~0#1| 1) |v_thrThread2of2ForFork0_~c~0#1_217|) (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_217| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_216| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (< (+ 1 |v_thrThread2of2ForFork0_~c~0#1_217|) |v_thrThread2of2ForFork0_~c~0#1_216|))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (exists ((|v_thrThread2of2ForFork0_~c~0#1_212| Int)) (and (<= |c_thrThread2of2ForFork0_~c~0#1| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_212|)) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_212| 4))) 1) (<= (+ 8 |v_thrThread2of2ForFork0_~c~0#1_212|) |c_thrThread1of2ForFork0_~c~0#1|)))) is different from false [2021-11-14 01:43:18,292 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~data~0.base))) (and (exists ((|v_thrThread2of2ForFork0_~c~0#1_212| Int)) (and (or (= (* 4 |c_thrThread2of2ForFork0_~c~0#1|) (* 4 |v_thrThread2of2ForFork0_~c~0#1_212|)) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_212| 4))) 1)) (<= |c_thrThread2of2ForFork0_~c~0#1| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_212|)) (<= (+ 8 |v_thrThread2of2ForFork0_~c~0#1_212|) |c_thrThread1of2ForFork0_~c~0#1|))) (forall ((|v_thrThread2of2ForFork0_~c~0#1_217| Int) (|v_thrThread2of2ForFork0_~c~0#1_216| Int)) (or (< (+ |c_thrThread2of2ForFork0_~c~0#1| 1) |v_thrThread2of2ForFork0_~c~0#1_217|) (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_217| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_216| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (< (+ 1 |v_thrThread2of2ForFork0_~c~0#1_217|) |v_thrThread2of2ForFork0_~c~0#1_216|))) (= (select .cse0 (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (= (select .cse0 (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 0))) is different from false [2021-11-14 01:43:20,299 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~data~0.base))) (and (= (select .cse0 (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (= (select .cse0 (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (exists ((|v_thrThread2of2ForFork0_~c~0#1_212| Int)) (and (<= |c_thrThread2of2ForFork0_~c~0#1| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_212|)) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_212| 4))) 1) (<= (+ 8 |v_thrThread2of2ForFork0_~c~0#1_212|) |c_thrThread1of2ForFork0_~c~0#1|))) (forall ((|v_thrThread2of2ForFork0_~c~0#1_217| Int)) (or (forall ((|v_thrThread2of2ForFork0_~c~0#1_216| Int)) (or (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_217| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_216| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (< (+ 1 |v_thrThread2of2ForFork0_~c~0#1_217|) |v_thrThread2of2ForFork0_~c~0#1_216|))) (< (+ |c_thrThread2of2ForFork0_~c~0#1| 1) |v_thrThread2of2ForFork0_~c~0#1_217|))))) is different from false [2021-11-14 01:43:20,924 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_thrThread2of2ForFork0_~c~0#1_212| Int) (|v_thrThread2of2ForFork0_~c~0#1_213| Int)) (let ((.cse0 (select |c_#memory_int| c_~data~0.base))) (and (<= |v_thrThread2of2ForFork0_~c~0#1_213| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_212|)) (= (select .cse0 (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_212| 4))) 1) (= (select .cse0 (+ (* |v_thrThread2of2ForFork0_~c~0#1_213| 4) c_~data~0.offset)) 1) (<= |c_thrThread2of2ForFork0_~c~0#1| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_213|)) (<= (+ 8 |v_thrThread2of2ForFork0_~c~0#1_212|) |c_thrThread1of2ForFork0_~c~0#1|)))) (forall ((|v_thrThread2of2ForFork0_~c~0#1_216| Int)) (or (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_216| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (< (+ |c_thrThread2of2ForFork0_~c~0#1| 1) |v_thrThread2of2ForFork0_~c~0#1_216|))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1)) is different from false [2021-11-14 01:43:21,681 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~data~0.base))) (and (exists ((|v_thrThread2of2ForFork0_~c~0#1_212| Int) (|v_thrThread2of2ForFork0_~c~0#1_213| Int)) (let ((.cse0 (* 4 |c_thrThread2of2ForFork0_~c~0#1|)) (.cse1 (select |c_#memory_int| c_~data~0.base))) (and (or (= (* 4 |v_thrThread2of2ForFork0_~c~0#1_213|) .cse0) (= (select .cse1 (+ (* |v_thrThread2of2ForFork0_~c~0#1_213| 4) c_~data~0.offset)) 1)) (or (= .cse0 (* 4 |v_thrThread2of2ForFork0_~c~0#1_212|)) (= (select .cse1 (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_212| 4))) 1)) (<= |v_thrThread2of2ForFork0_~c~0#1_213| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_212|)) (<= |c_thrThread2of2ForFork0_~c~0#1| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_213|)) (<= (+ 8 |v_thrThread2of2ForFork0_~c~0#1_212|) |c_thrThread1of2ForFork0_~c~0#1|)))) (forall ((|v_thrThread2of2ForFork0_~c~0#1_216| Int)) (or (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_216| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (< (+ |c_thrThread2of2ForFork0_~c~0#1| 1) |v_thrThread2of2ForFork0_~c~0#1_216|))) (= (select .cse2 (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (= (select .cse2 (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 0))) is different from false [2021-11-14 01:43:22,317 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~data~0.base))) (and (exists ((|v_thrThread2of2ForFork0_~c~0#1_212| Int) (|v_thrThread2of2ForFork0_~c~0#1_213| Int)) (let ((.cse0 (select |c_#memory_int| c_~data~0.base))) (and (<= |v_thrThread2of2ForFork0_~c~0#1_213| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_212|)) (= (select .cse0 (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_212| 4))) 1) (= (select .cse0 (+ (* |v_thrThread2of2ForFork0_~c~0#1_213| 4) c_~data~0.offset)) 1) (<= |c_thrThread2of2ForFork0_~c~0#1| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_213|)) (<= (+ 8 |v_thrThread2of2ForFork0_~c~0#1_212|) |c_thrThread1of2ForFork0_~c~0#1|)))) (= (select .cse1 (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4))) 1) (= (select .cse1 (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (forall ((|v_thrThread2of2ForFork0_~c~0#1_216| Int)) (or (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread2of2ForFork0_~c~0#1_216| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (< (+ |c_thrThread2of2ForFork0_~c~0#1| 1) |v_thrThread2of2ForFork0_~c~0#1_216|))))) is different from false [2021-11-14 01:43:24,567 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (forall ((|v_thrThread2of2ForFork0_~c~0#1_219| Int)) (or (forall ((|v_thrThread2of2ForFork0_~c~0#1_217| Int) (|v_thrThread2of2ForFork0_~c~0#1_218| Int) (|v_thrThread2of2ForFork0_~c~0#1_216| Int)) (or (< (+ 1 |v_thrThread2of2ForFork0_~c~0#1_218|) |v_thrThread2of2ForFork0_~c~0#1_217|) (= (select (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_219| 4)) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_218| 4)) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_217| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_216| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (< (+ 1 |v_thrThread2of2ForFork0_~c~0#1_219|) |v_thrThread2of2ForFork0_~c~0#1_218|) (< (+ 1 |v_thrThread2of2ForFork0_~c~0#1_217|) |v_thrThread2of2ForFork0_~c~0#1_216|))) (< (+ |c_thrThread2of2ForFork0_~c~0#1| 1) |v_thrThread2of2ForFork0_~c~0#1_219|))) (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 10) |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:43:25,554 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 8) |c_thrThread1of2ForFork0_~c~0#1|) (not (= |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (forall ((|v_thrThread2of2ForFork0_~c~0#1_217| Int) (|v_thrThread2of2ForFork0_~c~0#1_218| Int) (|v_thrThread2of2ForFork0_~c~0#1_216| Int)) (or (< (+ 1 |v_thrThread2of2ForFork0_~c~0#1_218|) |v_thrThread2of2ForFork0_~c~0#1_217|) (< (+ |c_thrThread2of2ForFork0_~c~0#1| 1) |v_thrThread2of2ForFork0_~c~0#1_218|) (= 1 (select (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_218| 4)) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_217| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_216| 4) c_~data~0.offset) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)))) (< (+ 1 |v_thrThread2of2ForFork0_~c~0#1_217|) |v_thrThread2of2ForFork0_~c~0#1_216|))) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1)) is different from false [2021-11-14 01:43:26,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:43:26,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:43:26,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:43:26,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2021-11-14 01:43:26,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-11-14 01:43:26,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 748 states. [2021-11-14 01:43:26,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2021-11-14 01:43:26,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:43:26,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-14 01:43:26,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-14 01:43:26,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-14 01:43:26,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:43:26,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-11-14 01:43:26,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-11-14 01:43:26,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-11-14 01:43:26,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:43:26,204 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:43:26,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:43:26,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1234346539, now seen corresponding path program 9 times [2021-11-14 01:43:26,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:43:26,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465270995] [2021-11-14 01:43:26,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:43:26,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:43:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:43:26,688 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 63 proven. 471 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-11-14 01:43:26,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:43:26,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465270995] [2021-11-14 01:43:26,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465270995] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-14 01:43:26,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249295388] [2021-11-14 01:43:26,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-14 01:43:26,689 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:43:26,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-14 01:43:26,689 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-14 01:43:26,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-11-14 01:43:26,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2021-11-14 01:43:26,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-14 01:43:26,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 27 conjunts are in the unsatisfiable core [2021-11-14 01:43:26,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-14 01:43:27,176 INFO L388 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 15 treesize of output 11 [2021-11-14 01:43:27,230 INFO L354 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2021-11-14 01:43:27,230 INFO L388 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 1 case distinctions, treesize of input 27 treesize of output 34 [2021-11-14 01:43:27,281 INFO L354 Elim1Store]: treesize reduction 32, result has 50.0 percent of original size [2021-11-14 01:43:27,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 57 [2021-11-14 01:43:29,444 INFO L354 Elim1Store]: treesize reduction 80, result has 27.9 percent of original size [2021-11-14 01:43:29,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 53 [2021-11-14 01:43:29,521 INFO L354 Elim1Store]: treesize reduction 100, result has 30.1 percent of original size [2021-11-14 01:43:29,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 76 [2021-11-14 01:43:41,812 INFO L354 Elim1Store]: treesize reduction 148, result has 22.1 percent of original size [2021-11-14 01:43:41,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 72 [2021-11-14 01:43:43,932 INFO L354 Elim1Store]: treesize reduction 184, result has 22.7 percent of original size [2021-11-14 01:43:43,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 78 treesize of output 95 [2021-11-14 01:43:56,894 INFO L354 Elim1Store]: treesize reduction 232, result has 18.6 percent of original size [2021-11-14 01:43:56,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 75 treesize of output 91 [2021-11-14 01:44:01,048 INFO L354 Elim1Store]: treesize reduction 284, result has 18.6 percent of original size [2021-11-14 01:44:01,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 94 treesize of output 114 [2021-11-14 01:44:21,945 INFO L354 Elim1Store]: treesize reduction 332, result has 16.2 percent of original size [2021-11-14 01:44:21,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 91 treesize of output 110 [2021-11-14 01:44:28,162 INFO L354 Elim1Store]: treesize reduction 400, result has 16.0 percent of original size [2021-11-14 01:44:28,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 110 treesize of output 133 [2021-11-14 01:44:55,597 INFO L354 Elim1Store]: treesize reduction 456, result has 12.8 percent of original size [2021-11-14 01:44:55,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 112 treesize of output 126 [2021-11-14 01:44:56,440 INFO L354 Elim1Store]: treesize reduction 336, result has 0.3 percent of original size [2021-11-14 01:44:56,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 119 treesize of output 55 [2021-11-14 01:44:56,517 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 471 proven. 83 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-14 01:44:56,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-14 01:45:38,559 WARN L838 $PredicateComparison]: unable to prove that (forall ((|thrThread2of2ForFork0_~c~0#1| Int) (|v_thrThread2of2ForFork0_~c~0#1_233| Int) (|v_thrThread2of2ForFork0_~c~0#1_234| Int) (|v_thrThread2of2ForFork0_~c~0#1_232| Int) (|v_thrThread2of2ForFork0_~c~0#1_235| Int) (|v_thrThread2of2ForFork0_~c~0#1_236| Int)) (or (< |v_thrThread2of2ForFork0_~c~0#1_234| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_235|)) (< |v_thrThread2of2ForFork0_~c~0#1_232| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_233|)) (< |v_thrThread2of2ForFork0_~c~0#1_233| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_234|)) (<= |c_thrThread2of2ForFork0_~end~0#1| |v_thrThread2of2ForFork0_~c~0#1_232|) (< |v_thrThread2of2ForFork0_~c~0#1_236| (+ |thrThread2of2ForFork0_~c~0#1| 1)) (< |v_thrThread2of2ForFork0_~c~0#1_235| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_236|)) (= (select (store (store (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread2of2ForFork0_~c~0#1| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_236| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_235| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_234| 4) c_~data~0.offset) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_233| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_232| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1))) is different from false [2021-11-14 01:45:39,987 INFO L388 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 89 treesize of output 87 [2021-11-14 01:45:40,491 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 163 proven. 286 refuted. 47 times theorem prover too weak. 33 trivial. 58 not checked. [2021-11-14 01:45:40,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249295388] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-14 01:45:40,491 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-14 01:45:40,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 27, 23] total 59 [2021-11-14 01:45:40,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042604340] [2021-11-14 01:45:40,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-14 01:45:40,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2021-11-14 01:45:40,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:45:40,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2021-11-14 01:45:40,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=2738, Unknown=60, NotChecked=112, Total=3422 [2021-11-14 01:45:40,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:45:40,493 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:45:40,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 8.661016949152541) internal successors, (511), 59 states have internal predecessors, (511), 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) [2021-11-14 01:45:40,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:45:40,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:45:40,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:45:40,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 126 states. [2021-11-14 01:45:40,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2021-11-14 01:45:40,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 748 states. [2021-11-14 01:45:40,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 156 states. [2021-11-14 01:45:40,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:45:40,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2021-11-14 01:45:40,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2021-11-14 01:45:40,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-14 01:45:40,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:45:40,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2021-11-14 01:45:40,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2021-11-14 01:45:40,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:45:43,345 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|thrThread2of2ForFork0_~c~0#1| Int) (|v_thrThread2of2ForFork0_~c~0#1_233| Int) (|v_thrThread2of2ForFork0_~c~0#1_234| Int) (|v_thrThread2of2ForFork0_~c~0#1_232| Int) (|v_thrThread2of2ForFork0_~c~0#1_235| Int) (|v_thrThread2of2ForFork0_~c~0#1_236| Int)) (or (< |v_thrThread2of2ForFork0_~c~0#1_234| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_235|)) (< |v_thrThread2of2ForFork0_~c~0#1_232| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_233|)) (< |v_thrThread2of2ForFork0_~c~0#1_233| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_234|)) (<= |c_thrThread2of2ForFork0_~end~0#1| |v_thrThread2of2ForFork0_~c~0#1_232|) (< |v_thrThread2of2ForFork0_~c~0#1_236| (+ |thrThread2of2ForFork0_~c~0#1| 1)) (< |v_thrThread2of2ForFork0_~c~0#1_235| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_236|)) (= (select (store (store (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread2of2ForFork0_~c~0#1| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_236| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_235| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_234| 4) c_~data~0.offset) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_233| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_232| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (<= |c_thrThread2of2ForFork0_~end~0#1| |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:45:45,979 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= (+ |c_thrThread2of2ForFork0_~end~0#1| 1) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|thrThread2of2ForFork0_~c~0#1| Int) (|v_thrThread2of2ForFork0_~c~0#1_233| Int) (|v_thrThread2of2ForFork0_~c~0#1_234| Int) (|v_thrThread2of2ForFork0_~c~0#1_232| Int) (|v_thrThread2of2ForFork0_~c~0#1_235| Int) (|v_thrThread2of2ForFork0_~c~0#1_236| Int)) (or (< |v_thrThread2of2ForFork0_~c~0#1_234| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_235|)) (< |v_thrThread2of2ForFork0_~c~0#1_232| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_233|)) (< |v_thrThread2of2ForFork0_~c~0#1_233| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_234|)) (<= |c_thrThread2of2ForFork0_~end~0#1| |v_thrThread2of2ForFork0_~c~0#1_232|) (< |v_thrThread2of2ForFork0_~c~0#1_236| (+ |thrThread2of2ForFork0_~c~0#1| 1)) (< |v_thrThread2of2ForFork0_~c~0#1_235| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_236|)) (= (select (store (store (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread2of2ForFork0_~c~0#1| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_236| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_235| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_234| 4) c_~data~0.offset) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_233| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_232| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|)) is different from false [2021-11-14 01:45:47,988 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (<= (+ |c_thrThread2of2ForFork0_~end~0#1| 1) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|thrThread2of2ForFork0_~c~0#1| Int) (|v_thrThread2of2ForFork0_~c~0#1_233| Int) (|v_thrThread2of2ForFork0_~c~0#1_234| Int) (|v_thrThread2of2ForFork0_~c~0#1_232| Int) (|v_thrThread2of2ForFork0_~c~0#1_235| Int) (|v_thrThread2of2ForFork0_~c~0#1_236| Int)) (or (< |v_thrThread2of2ForFork0_~c~0#1_234| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_235|)) (< |v_thrThread2of2ForFork0_~c~0#1_232| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_233|)) (< |v_thrThread2of2ForFork0_~c~0#1_233| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_234|)) (<= |c_thrThread2of2ForFork0_~end~0#1| |v_thrThread2of2ForFork0_~c~0#1_232|) (< |v_thrThread2of2ForFork0_~c~0#1_236| (+ |thrThread2of2ForFork0_~c~0#1| 1)) (< |v_thrThread2of2ForFork0_~c~0#1_235| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_236|)) (= (select (store (store (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread2of2ForFork0_~c~0#1| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_236| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_235| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_234| 4) c_~data~0.offset) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_233| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_232| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1)) is different from false [2021-11-14 01:45:50,387 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|thrThread2of2ForFork0_~c~0#1| Int) (|v_thrThread2of2ForFork0_~c~0#1_233| Int) (|v_thrThread2of2ForFork0_~c~0#1_234| Int) (|v_thrThread2of2ForFork0_~c~0#1_232| Int) (|v_thrThread2of2ForFork0_~c~0#1_235| Int) (|v_thrThread2of2ForFork0_~c~0#1_236| Int)) (or (< |v_thrThread2of2ForFork0_~c~0#1_234| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_235|)) (< |v_thrThread2of2ForFork0_~c~0#1_232| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_233|)) (< |v_thrThread2of2ForFork0_~c~0#1_233| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_234|)) (<= |c_thrThread2of2ForFork0_~end~0#1| |v_thrThread2of2ForFork0_~c~0#1_232|) (< |v_thrThread2of2ForFork0_~c~0#1_236| (+ |thrThread2of2ForFork0_~c~0#1| 1)) (< |v_thrThread2of2ForFork0_~c~0#1_235| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_236|)) (= (select (store (store (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread2of2ForFork0_~c~0#1| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_236| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_235| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_234| 4) c_~data~0.offset) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_233| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_232| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1))) (not (= |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (<= (+ 2 |c_thrThread2of2ForFork0_~end~0#1|) |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:45:52,393 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|thrThread2of2ForFork0_~c~0#1| Int) (|v_thrThread2of2ForFork0_~c~0#1_233| Int) (|v_thrThread2of2ForFork0_~c~0#1_234| Int) (|v_thrThread2of2ForFork0_~c~0#1_232| Int) (|v_thrThread2of2ForFork0_~c~0#1_235| Int) (|v_thrThread2of2ForFork0_~c~0#1_236| Int)) (or (< |v_thrThread2of2ForFork0_~c~0#1_234| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_235|)) (< |v_thrThread2of2ForFork0_~c~0#1_232| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_233|)) (< |v_thrThread2of2ForFork0_~c~0#1_233| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_234|)) (<= |c_thrThread2of2ForFork0_~end~0#1| |v_thrThread2of2ForFork0_~c~0#1_232|) (< |v_thrThread2of2ForFork0_~c~0#1_236| (+ |thrThread2of2ForFork0_~c~0#1| 1)) (< |v_thrThread2of2ForFork0_~c~0#1_235| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_236|)) (= (select (store (store (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread2of2ForFork0_~c~0#1| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_236| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_235| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_234| 4) c_~data~0.offset) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_233| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_232| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (<= (+ 2 |c_thrThread2of2ForFork0_~end~0#1|) |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:45:54,398 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~data~0.base)) (.cse1 (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4)))) (and (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 8) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|thrThread2of2ForFork0_~c~0#1| Int) (|v_thrThread2of2ForFork0_~c~0#1_233| Int) (|v_thrThread2of2ForFork0_~c~0#1_234| Int) (|v_thrThread2of2ForFork0_~c~0#1_232| Int) (|v_thrThread2of2ForFork0_~c~0#1_235| Int) (|v_thrThread2of2ForFork0_~c~0#1_236| Int)) (or (< |v_thrThread2of2ForFork0_~c~0#1_234| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_235|)) (< |v_thrThread2of2ForFork0_~c~0#1_232| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_233|)) (< |v_thrThread2of2ForFork0_~c~0#1_233| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_234|)) (<= |c_thrThread2of2ForFork0_~end~0#1| |v_thrThread2of2ForFork0_~c~0#1_232|) (< |v_thrThread2of2ForFork0_~c~0#1_236| (+ |thrThread2of2ForFork0_~c~0#1| 1)) (< |v_thrThread2of2ForFork0_~c~0#1_235| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_236|)) (= (select (store (store (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread2of2ForFork0_~c~0#1| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_236| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_235| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_234| 4) c_~data~0.offset) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_233| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_232| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1))) (= (select .cse0 .cse1) 1) (<= (+ 2 |c_thrThread2of2ForFork0_~end~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (= (select (store .cse0 (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)) 0) .cse1) 1))) is different from false [2021-11-14 01:46:16,709 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|thrThread2of2ForFork0_~c~0#1| Int) (|v_thrThread2of2ForFork0_~c~0#1_233| Int) (|v_thrThread2of2ForFork0_~c~0#1_234| Int) (|v_thrThread2of2ForFork0_~c~0#1_232| Int) (|v_thrThread2of2ForFork0_~c~0#1_235| Int) (|v_thrThread2of2ForFork0_~c~0#1_236| Int)) (or (< |v_thrThread2of2ForFork0_~c~0#1_234| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_235|)) (< |v_thrThread2of2ForFork0_~c~0#1_232| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_233|)) (< |v_thrThread2of2ForFork0_~c~0#1_233| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_234|)) (<= |c_thrThread2of2ForFork0_~end~0#1| |v_thrThread2of2ForFork0_~c~0#1_232|) (< |v_thrThread2of2ForFork0_~c~0#1_236| (+ |thrThread2of2ForFork0_~c~0#1| 1)) (< |v_thrThread2of2ForFork0_~c~0#1_235| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_236|)) (= (select (store (store (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread2of2ForFork0_~c~0#1| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_236| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_235| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_234| 4) c_~data~0.offset) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_233| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_232| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1))) (not (= |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (<= (+ 2 |c_thrThread2of2ForFork0_~end~0#1|) |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:46:18,943 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|thrThread2of2ForFork0_~c~0#1| Int) (|v_thrThread2of2ForFork0_~c~0#1_233| Int) (|v_thrThread2of2ForFork0_~c~0#1_234| Int) (|v_thrThread2of2ForFork0_~c~0#1_232| Int) (|v_thrThread2of2ForFork0_~c~0#1_235| Int) (|v_thrThread2of2ForFork0_~c~0#1_236| Int)) (or (< |v_thrThread2of2ForFork0_~c~0#1_234| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_235|)) (< |v_thrThread2of2ForFork0_~c~0#1_232| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_233|)) (< |v_thrThread2of2ForFork0_~c~0#1_233| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_234|)) (<= |c_thrThread2of2ForFork0_~end~0#1| |v_thrThread2of2ForFork0_~c~0#1_232|) (< |v_thrThread2of2ForFork0_~c~0#1_236| (+ |thrThread2of2ForFork0_~c~0#1| 1)) (< |v_thrThread2of2ForFork0_~c~0#1_235| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_236|)) (= (select (store (store (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread2of2ForFork0_~c~0#1| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_236| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_235| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_234| 4) c_~data~0.offset) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_233| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_232| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (<= (+ 2 |c_thrThread2of2ForFork0_~end~0#1|) |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:46:22,978 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (forall ((|thrThread2of2ForFork0_~c~0#1| Int) (|v_thrThread2of2ForFork0_~c~0#1_233| Int) (|v_thrThread2of2ForFork0_~c~0#1_234| Int) (|v_thrThread2of2ForFork0_~c~0#1_232| Int) (|v_thrThread2of2ForFork0_~c~0#1_235| Int) (|v_thrThread2of2ForFork0_~c~0#1_236| Int)) (or (< |v_thrThread2of2ForFork0_~c~0#1_234| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_235|)) (< |v_thrThread2of2ForFork0_~c~0#1_232| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_233|)) (< |v_thrThread2of2ForFork0_~c~0#1_233| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_234|)) (<= |c_thrThread2of2ForFork0_~end~0#1| |v_thrThread2of2ForFork0_~c~0#1_232|) (< |v_thrThread2of2ForFork0_~c~0#1_236| (+ |thrThread2of2ForFork0_~c~0#1| 1)) (< |v_thrThread2of2ForFork0_~c~0#1_235| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_236|)) (= (select (store (store (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread2of2ForFork0_~c~0#1| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_236| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_235| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_234| 4) c_~data~0.offset) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_233| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_232| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= (+ 2 |c_thrThread2of2ForFork0_~end~0#1|) |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:46:24,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:46:24,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:46:24,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:46:24,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2021-11-14 01:46:24,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-11-14 01:46:24,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 748 states. [2021-11-14 01:46:24,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2021-11-14 01:46:24,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:46:24,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-14 01:46:24,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-14 01:46:24,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-14 01:46:24,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:46:24,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-11-14 01:46:24,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-11-14 01:46:24,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2021-11-14 01:46:24,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-11-14 01:46:24,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-11-14 01:46:24,268 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-14 01:46:24,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-14 01:46:24,268 INFO L85 PathProgramCache]: Analyzing trace with hash 341673737, now seen corresponding path program 10 times [2021-11-14 01:46:24,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-14 01:46:24,268 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664299786] [2021-11-14 01:46:24,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-14 01:46:24,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-14 01:46:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-14 01:46:24,770 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 50 proven. 541 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2021-11-14 01:46:24,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-14 01:46:24,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664299786] [2021-11-14 01:46:24,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664299786] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-14 01:46:24,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701290632] [2021-11-14 01:46:24,770 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-14 01:46:24,770 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-14 01:46:24,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-14 01:46:24,771 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-14 01:46:24,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-11-14 01:46:24,844 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-14 01:46:24,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-14 01:46:24,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-14 01:46:24,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-14 01:46:25,548 INFO L388 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 15 treesize of output 11 [2021-11-14 01:46:25,598 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-14 01:46:25,598 INFO L388 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 1 case distinctions, treesize of input 32 treesize of output 31 [2021-11-14 01:46:25,654 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-11-14 01:46:25,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 15 [2021-11-14 01:46:25,746 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 56 proven. 535 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2021-11-14 01:46:25,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-14 01:46:25,822 INFO L388 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 25 treesize of output 23 [2021-11-14 01:46:26,695 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 50 proven. 541 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2021-11-14 01:46:26,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701290632] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-14 01:46:26,696 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-14 01:46:26,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 19] total 35 [2021-11-14 01:46:26,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799084033] [2021-11-14 01:46:26,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-14 01:46:26,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-11-14 01:46:26,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-14 01:46:26,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-11-14 01:46:26,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1003, Unknown=0, NotChecked=0, Total=1190 [2021-11-14 01:46:26,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:46:26,697 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-14 01:46:26,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 10.628571428571428) internal successors, (372), 35 states have internal predecessors, (372), 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) [2021-11-14 01:46:26,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:46:26,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-11-14 01:46:26,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:46:26,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 126 states. [2021-11-14 01:46:26,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2021-11-14 01:46:26,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 748 states. [2021-11-14 01:46:26,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 157 states. [2021-11-14 01:46:26,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-14 01:46:26,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2021-11-14 01:46:26,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2021-11-14 01:46:26,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-14 01:46:26,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-14 01:46:26,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2021-11-14 01:46:26,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2021-11-14 01:46:26,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2021-11-14 01:46:26,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-14 01:46:29,916 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) |c_thrThread1of2ForFork0_~c~0#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (forall ((|thrThread2of2ForFork0_~c~0#1| Int) (|v_thrThread2of2ForFork0_~c~0#1_233| Int) (|v_thrThread2of2ForFork0_~c~0#1_234| Int) (|v_thrThread2of2ForFork0_~c~0#1_232| Int) (|v_thrThread2of2ForFork0_~c~0#1_235| Int) (|v_thrThread2of2ForFork0_~c~0#1_236| Int)) (or (< |v_thrThread2of2ForFork0_~c~0#1_234| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_235|)) (< |v_thrThread2of2ForFork0_~c~0#1_232| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_233|)) (< |v_thrThread2of2ForFork0_~c~0#1_233| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_234|)) (<= |c_thrThread2of2ForFork0_~end~0#1| |v_thrThread2of2ForFork0_~c~0#1_232|) (< |v_thrThread2of2ForFork0_~c~0#1_236| (+ |thrThread2of2ForFork0_~c~0#1| 1)) (< |v_thrThread2of2ForFork0_~c~0#1_235| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_236|)) (= (select (store (store (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread2of2ForFork0_~c~0#1| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_236| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_235| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_234| 4) c_~data~0.offset) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_233| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_232| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1))) (= (select (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= (+ 2 |c_thrThread2of2ForFork0_~end~0#1|) |c_thrThread1of2ForFork0_~c~0#1|)) is different from false [2021-11-14 01:46:32,119 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 8) |c_thrThread1of2ForFork0_~c~0#1|) (<= (+ |c_thrThread2of2ForFork0_~end~0#1| 1) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|thrThread2of2ForFork0_~c~0#1| Int) (|v_thrThread2of2ForFork0_~c~0#1_233| Int) (|v_thrThread2of2ForFork0_~c~0#1_234| Int) (|v_thrThread2of2ForFork0_~c~0#1_232| Int) (|v_thrThread2of2ForFork0_~c~0#1_235| Int) (|v_thrThread2of2ForFork0_~c~0#1_236| Int)) (or (< |v_thrThread2of2ForFork0_~c~0#1_234| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_235|)) (< |v_thrThread2of2ForFork0_~c~0#1_232| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_233|)) (< |v_thrThread2of2ForFork0_~c~0#1_233| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_234|)) (<= |c_thrThread2of2ForFork0_~end~0#1| |v_thrThread2of2ForFork0_~c~0#1_232|) (< |v_thrThread2of2ForFork0_~c~0#1_236| (+ |thrThread2of2ForFork0_~c~0#1| 1)) (< |v_thrThread2of2ForFork0_~c~0#1_235| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_236|)) (= (select (store (store (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |thrThread2of2ForFork0_~c~0#1| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_236| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_235| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_234| 4) c_~data~0.offset) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_233| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_232| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1))) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1)) is different from false [2021-11-14 01:46:34,255 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 8) |c_thrThread1of2ForFork0_~c~0#1|) (forall ((|v_thrThread2of2ForFork0_~c~0#1_233| Int) (|v_thrThread2of2ForFork0_~c~0#1_234| Int) (|v_thrThread2of2ForFork0_~c~0#1_232| Int) (|v_thrThread2of2ForFork0_~c~0#1_235| Int) (|v_thrThread2of2ForFork0_~c~0#1_236| Int)) (or (< |v_thrThread2of2ForFork0_~c~0#1_234| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_235|)) (< |v_thrThread2of2ForFork0_~c~0#1_232| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_233|)) (< |v_thrThread2of2ForFork0_~c~0#1_233| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_234|)) (<= |c_thrThread2of2ForFork0_~end~0#1| |v_thrThread2of2ForFork0_~c~0#1_232|) (< |v_thrThread2of2ForFork0_~c~0#1_236| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)) (< |v_thrThread2of2ForFork0_~c~0#1_235| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_236|)) (= (select (store (store (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_236| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_235| 4)) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_234| 4) c_~data~0.offset) 1) (+ (* |v_thrThread2of2ForFork0_~c~0#1_233| 4) c_~data~0.offset) 1) (+ c_~data~0.offset (* |v_thrThread2of2ForFork0_~c~0#1_232| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1))) (<= (+ |c_thrThread2of2ForFork0_~end~0#1| 1) |c_thrThread1of2ForFork0_~c~0#1|) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* |c_thrThread2of2ForFork0_~c~0#1| 4)) 0) (+ c_~data~0.offset (* |c_thrThread1of2ForFork0_~c~0#1| 4))) 1)) is different from false Received shutdown request... [2021-11-14 01:48:49,761 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (16)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2021-11-14 01:48:49,761 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 [2021-11-14 01:48:49,761 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 [2021-11-14 01:48:49,761 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2021-11-14 01:48:49,776 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2021-11-14 01:48:50,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2021-11-14 01:48:50,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (16)] Ended with exit code 0 [2021-11-14 01:48:50,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2021-11-14 01:48:50,815 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 [2021-11-14 01:48:50,975 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-11-14 01:48:51,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-14 01:48:51,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2021-11-14 01:48:51,031 WARN L594 AbstractCegarLoop]: Verification canceled: while executing Executor. [2021-11-14 01:48:51,031 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-14 01:48:51,032 INFO L732 BasicCegarLoop]: Path program histogram: [10, 2, 1, 1, 1, 1] [2021-11-14 01:48:51,033 INFO L308 ceAbstractionStarter]: Result for error location thrThread1of2ForFork0 was TIMEOUT (2/3) [2021-11-14 01:48:51,034 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-11-14 01:48:51,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-14 01:48:51,037 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2021-11-14 01:48:51,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (28)] Waiting until timeout for monitored process [2021-11-14 01:48:51,038 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (28)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2021-11-14 01:48:51,041 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2021-11-14 01:48:51,041 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 [2021-11-14 01:48:51,041 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-14 01:48:51,041 WARN L594 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was constructing initial abstraction,while executing PartialOrderCegarLoop. [2021-11-14 01:48:51,041 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 1 remaining) [2021-11-14 01:48:51,042 INFO L732 BasicCegarLoop]: Path program histogram: [] [2021-11-14 01:48:51,042 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was TIMEOUT (3/3) [2021-11-14 01:48:51,042 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2021-11-14 01:48:51,042 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-14 01:48:51,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 01:48:51 BasicIcfg [2021-11-14 01:48:51,044 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-14 01:48:51,044 INFO L158 Benchmark]: Toolchain (without parser) took 844775.76ms. Allocated memory was 350.2MB in the beginning and 8.8GB in the end (delta: 8.4GB). Free memory was 294.8MB in the beginning and 7.2GB in the end (delta: -6.9GB). Peak memory consumption was 1.5GB. Max. memory is 16.0GB. [2021-11-14 01:48:51,045 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 350.2MB. Free memory was 313.2MB in the beginning and 313.0MB in the end (delta: 174.9kB). There was no memory consumed. Max. memory is 16.0GB. [2021-11-14 01:48:51,045 INFO L158 Benchmark]: CACSL2BoogieTranslator took 516.96ms. Allocated memory is still 350.2MB. Free memory was 294.6MB in the beginning and 303.2MB in the end (delta: -8.6MB). Peak memory consumption was 18.8MB. Max. memory is 16.0GB. [2021-11-14 01:48:51,045 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.37ms. Allocated memory is still 350.2MB. Free memory was 303.2MB in the beginning and 301.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2021-11-14 01:48:51,045 INFO L158 Benchmark]: Boogie Preprocessor took 27.08ms. Allocated memory is still 350.2MB. Free memory was 301.1MB in the beginning and 299.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2021-11-14 01:48:51,045 INFO L158 Benchmark]: RCFGBuilder took 345.15ms. Allocated memory is still 350.2MB. Free memory was 299.0MB in the beginning and 284.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2021-11-14 01:48:51,045 INFO L158 Benchmark]: TraceAbstraction took 843832.58ms. Allocated memory was 350.2MB in the beginning and 8.8GB in the end (delta: 8.4GB). Free memory was 284.3MB in the beginning and 7.2GB in the end (delta: -6.9GB). Peak memory consumption was 1.5GB. Max. memory is 16.0GB. [2021-11-14 01:48:51,046 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.14ms. Allocated memory is still 350.2MB. Free memory was 313.2MB in the beginning and 313.0MB in the end (delta: 174.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 516.96ms. Allocated memory is still 350.2MB. Free memory was 294.6MB in the beginning and 303.2MB in the end (delta: -8.6MB). Peak memory consumption was 18.8MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 50.37ms. Allocated memory is still 350.2MB. Free memory was 303.2MB in the beginning and 301.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 27.08ms. Allocated memory is still 350.2MB. Free memory was 301.1MB in the beginning and 299.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 345.15ms. Allocated memory is still 350.2MB. Free memory was 299.0MB in the beginning and 284.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * TraceAbstraction took 843832.58ms. Allocated memory was 350.2MB in the beginning and 8.8GB in the end (delta: 8.4GB). Free memory was 284.3MB in the beginning and 7.2GB in the end (delta: -6.9GB). Peak memory consumption was 1.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 480, positive: 473, positive conditional: 28, positive unconditional: 445, negative: 7, negative conditional: 4, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 476, positive: 473, positive conditional: 28, positive unconditional: 445, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 476, positive: 473, positive conditional: 28, positive unconditional: 445, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 476, positive: 473, positive conditional: 0, positive unconditional: 473, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 476, positive: 473, positive conditional: 0, positive unconditional: 473, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 476, positive: 473, positive conditional: 0, positive unconditional: 473, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 396, positive: 393, positive conditional: 0, positive unconditional: 393, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 396, positive: 393, positive conditional: 0, positive unconditional: 393, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 476, positive: 80, positive conditional: 0, positive unconditional: 80, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 396, unknown conditional: 0, unknown unconditional: 396] , Statistics on independence cache: Total cache size (in pairs): 396, Positive cache size: 393, Positive conditional cache size: 0, Positive unconditional cache size: 393, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 4 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 57.61ms, Number of persistent set computation: 54, Number of trivial persistent sets: 49, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 448, positive: 445, positive conditional: 0, positive unconditional: 445, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 480, positive: 473, positive conditional: 28, positive unconditional: 445, negative: 7, negative conditional: 4, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 476, positive: 473, positive conditional: 28, positive unconditional: 445, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 476, positive: 473, positive conditional: 28, positive unconditional: 445, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 476, positive: 473, positive conditional: 0, positive unconditional: 473, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 476, positive: 473, positive conditional: 0, positive unconditional: 473, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 476, positive: 473, positive conditional: 0, positive unconditional: 473, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 396, positive: 393, positive conditional: 0, positive unconditional: 393, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 396, positive: 393, positive conditional: 0, positive unconditional: 393, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 476, positive: 80, positive conditional: 0, positive unconditional: 80, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 396, unknown conditional: 0, unknown unconditional: 396] , Statistics on independence cache: Total cache size (in pairs): 396, Positive cache size: 393, Positive conditional cache size: 0, Positive unconditional cache size: 393, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 4 - 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: 841385, positive: 791162, positive conditional: 784888, positive unconditional: 6274, negative: 50223, negative conditional: 50153, negative unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 791447, positive: 791162, positive conditional: 784888, positive unconditional: 6274, negative: 285, negative conditional: 215, negative unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 791447, positive: 791162, positive conditional: 784888, positive unconditional: 6274, negative: 285, negative conditional: 215, negative unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 827657, positive: 791162, positive conditional: 784462, positive unconditional: 6700, negative: 36495, negative conditional: 36210, negative unconditional: 285, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 827657, positive: 791162, positive conditional: 376636, positive unconditional: 414526, negative: 36495, negative conditional: 28994, negative unconditional: 7501, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 827657, positive: 791162, positive conditional: 376636, positive unconditional: 414526, negative: 36495, negative conditional: 28994, negative unconditional: 7501, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5654, positive: 4871, positive conditional: 305, positive unconditional: 4566, negative: 783, negative conditional: 712, negative unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5654, positive: 4558, positive conditional: 0, positive unconditional: 4558, negative: 1096, negative conditional: 0, negative unconditional: 1096, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1096, positive: 313, positive conditional: 295, positive unconditional: 18, negative: 711, negative conditional: 640, negative unconditional: 71, unknown: 72, unknown conditional: 72, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38133, positive: 458, positive conditional: 442, positive unconditional: 17, negative: 1204, negative conditional: 941, negative unconditional: 263, unknown: 36471, unknown conditional: 36471, unknown unconditional: 0] ], Cache Queries: [ total: 827657, positive: 786291, positive conditional: 376331, positive unconditional: 409960, negative: 35712, negative conditional: 28282, negative unconditional: 7430, unknown: 5654, unknown conditional: 1017, unknown unconditional: 4637] , Statistics on independence cache: Total cache size (in pairs): 5654, Positive cache size: 4871, Positive conditional cache size: 305, Positive unconditional cache size: 4566, Negative cache size: 783, Negative conditional cache size: 712, Negative unconditional cache size: 71, Eliminated conditions: 415042, Maximal queried relation: 12, Independence queries for same thread: 49938 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 625.09ms, Number of persistent set computation: 5248, Number of trivial persistent sets: 4741, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6344, positive: 6274, positive conditional: 0, positive unconditional: 6274, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 841385, positive: 791162, positive conditional: 784888, positive unconditional: 6274, negative: 50223, negative conditional: 50153, negative unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 791447, positive: 791162, positive conditional: 784888, positive unconditional: 6274, negative: 285, negative conditional: 215, negative unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 791447, positive: 791162, positive conditional: 784888, positive unconditional: 6274, negative: 285, negative conditional: 215, negative unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 827657, positive: 791162, positive conditional: 784462, positive unconditional: 6700, negative: 36495, negative conditional: 36210, negative unconditional: 285, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 827657, positive: 791162, positive conditional: 376636, positive unconditional: 414526, negative: 36495, negative conditional: 28994, negative unconditional: 7501, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 827657, positive: 791162, positive conditional: 376636, positive unconditional: 414526, negative: 36495, negative conditional: 28994, negative unconditional: 7501, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5654, positive: 4871, positive conditional: 305, positive unconditional: 4566, negative: 783, negative conditional: 712, negative unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5654, positive: 4558, positive conditional: 0, positive unconditional: 4558, negative: 1096, negative conditional: 0, negative unconditional: 1096, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1096, positive: 313, positive conditional: 295, positive unconditional: 18, negative: 711, negative conditional: 640, negative unconditional: 71, unknown: 72, unknown conditional: 72, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38133, positive: 458, positive conditional: 442, positive unconditional: 17, negative: 1204, negative conditional: 941, negative unconditional: 263, unknown: 36471, unknown conditional: 36471, unknown unconditional: 0] ], Cache Queries: [ total: 827657, positive: 786291, positive conditional: 376331, positive unconditional: 409960, negative: 35712, negative conditional: 28282, negative unconditional: 7430, unknown: 5654, unknown conditional: 1017, unknown unconditional: 4637] , Statistics on independence cache: Total cache size (in pairs): 5654, Positive cache size: 4871, Positive conditional cache size: 305, Positive unconditional cache size: 4566, Negative cache size: 783, Negative conditional cache size: 712, Negative unconditional cache size: 71, Eliminated conditions: 415042, Maximal queried relation: 12, Independence queries for same thread: 49938 - 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: 341720, positive: 321110, positive conditional: 315256, positive unconditional: 5854, negative: 20610, negative conditional: 20543, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 321331, positive: 321110, positive conditional: 315256, positive unconditional: 5854, negative: 221, negative conditional: 154, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 321331, positive: 321110, positive conditional: 315256, positive unconditional: 5854, negative: 221, negative conditional: 154, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 324710, positive: 321110, positive conditional: 314872, positive unconditional: 6238, negative: 3600, negative conditional: 3379, negative unconditional: 221, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 324710, positive: 321110, positive conditional: 164061, positive unconditional: 157049, negative: 3600, negative conditional: 2785, negative unconditional: 815, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 324710, positive: 321110, positive conditional: 164061, positive unconditional: 157049, negative: 3600, negative conditional: 2785, negative unconditional: 815, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4957, positive: 4664, positive conditional: 393, positive unconditional: 4271, negative: 293, negative conditional: 225, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4957, positive: 4297, positive conditional: 0, positive unconditional: 4297, negative: 660, negative conditional: 0, negative unconditional: 660, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 660, positive: 367, positive conditional: 351, positive unconditional: 16, negative: 287, negative conditional: 219, negative unconditional: 68, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3619, positive: 539, positive conditional: 493, positive unconditional: 46, negative: 244, negative conditional: 190, negative unconditional: 53, unknown: 2836, unknown conditional: 2836, unknown unconditional: 0] ], Cache Queries: [ total: 324710, positive: 316446, positive conditional: 163668, positive unconditional: 152778, negative: 3307, negative conditional: 2560, negative unconditional: 747, unknown: 4957, unknown conditional: 618, unknown unconditional: 4339] , Statistics on independence cache: Total cache size (in pairs): 4957, Positive cache size: 4664, Positive conditional cache size: 393, Positive unconditional cache size: 4271, Negative cache size: 293, Negative conditional cache size: 225, Negative unconditional cache size: 68, Eliminated conditions: 151405, Maximal queried relation: 11, Independence queries for same thread: 20389 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 188.79ms, Number of persistent set computation: 3807, Number of trivial persistent sets: 3453, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5921, positive: 5854, positive conditional: 0, positive unconditional: 5854, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 341720, positive: 321110, positive conditional: 315256, positive unconditional: 5854, negative: 20610, negative conditional: 20543, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 321331, positive: 321110, positive conditional: 315256, positive unconditional: 5854, negative: 221, negative conditional: 154, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 321331, positive: 321110, positive conditional: 315256, positive unconditional: 5854, negative: 221, negative conditional: 154, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 324710, positive: 321110, positive conditional: 314872, positive unconditional: 6238, negative: 3600, negative conditional: 3379, negative unconditional: 221, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 324710, positive: 321110, positive conditional: 164061, positive unconditional: 157049, negative: 3600, negative conditional: 2785, negative unconditional: 815, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 324710, positive: 321110, positive conditional: 164061, positive unconditional: 157049, negative: 3600, negative conditional: 2785, negative unconditional: 815, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4957, positive: 4664, positive conditional: 393, positive unconditional: 4271, negative: 293, negative conditional: 225, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4957, positive: 4297, positive conditional: 0, positive unconditional: 4297, negative: 660, negative conditional: 0, negative unconditional: 660, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 660, positive: 367, positive conditional: 351, positive unconditional: 16, negative: 287, negative conditional: 219, negative unconditional: 68, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3619, positive: 539, positive conditional: 493, positive unconditional: 46, negative: 244, negative conditional: 190, negative unconditional: 53, unknown: 2836, unknown conditional: 2836, unknown unconditional: 0] ], Cache Queries: [ total: 324710, positive: 316446, positive conditional: 163668, positive unconditional: 152778, negative: 3307, negative conditional: 2560, negative unconditional: 747, unknown: 4957, unknown conditional: 618, unknown unconditional: 4339] , Statistics on independence cache: Total cache size (in pairs): 4957, Positive cache size: 4664, Positive conditional cache size: 393, Positive unconditional cache size: 4271, Negative cache size: 293, Negative conditional cache size: 225, Negative unconditional cache size: 68, Eliminated conditions: 151405, Maximal queried relation: 11, Independence queries for same thread: 20389 - 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.00ms, 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: 998]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1047]: 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: ULTIMATE.start with 1 thread instances CFG has 3 procedures, 116 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, 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.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 53 ConstructedInterpolants, 0 QuantifiedInterpolants, 53 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 5/5 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 2 thread instances CFG has 4 procedures, 149 locations, 4 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thrThread2of2ForFork0 with 1 thread instances CFG has 4 procedures, 149 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 345.0s, OverallIterations: 17, TraceHistogramMax: 0, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 262.3s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 1021, 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, 2.4s SatisfiabilityAnalysisTime, 76.9s InterpolantComputationTime, 6914 NumberOfCodeBlocks, 6708 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 8901 ConstructedInterpolants, 144 QuantifiedInterpolants, 39732 SizeOfPredicates, 125 NumberOfNonLiveVariables, 4698 ConjunctsInSsa, 228 ConjunctsInUnsatCore, 38 InterpolantComputations, 8 PerfectInterpolantSequences, 14932/22357 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: thrThread1of2ForFork0 with 1 thread instances CFG has 4 procedures, 149 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 498.3s, OverallIterations: 16, TraceHistogramMax: 0, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 316.3s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 1390, 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, 16.8s SatisfiabilityAnalysisTime, 162.3s InterpolantComputationTime, 6775 NumberOfCodeBlocks, 6655 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 8896 ConstructedInterpolants, 208 QuantifiedInterpolants, 44406 SizeOfPredicates, 126 NumberOfNonLiveVariables, 4607 ConjunctsInSsa, 242 ConjunctsInUnsatCore, 36 InterpolantComputations, 7 PerfectInterpolantSequences, 20286/28061 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown