/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-NewStatesSleepPersistentFixedOrder-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-lit/sssc12_variant.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-44898dd [2022-02-09 10:59:51,466 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-09 10:59:51,468 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-09 10:59:51,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-09 10:59:51,553 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-09 10:59:51,554 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-09 10:59:51,555 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-09 10:59:51,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-09 10:59:51,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-09 10:59:51,564 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-09 10:59:51,565 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-09 10:59:51,567 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-09 10:59:51,567 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-09 10:59:51,571 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-09 10:59:51,573 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-09 10:59:51,575 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-09 10:59:51,576 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-09 10:59:51,577 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-09 10:59:51,579 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-09 10:59:51,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-09 10:59:51,586 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-09 10:59:51,587 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-09 10:59:51,588 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-09 10:59:51,589 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-09 10:59:51,595 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-09 10:59:51,596 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-09 10:59:51,596 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-09 10:59:51,597 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-09 10:59:51,598 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-09 10:59:51,598 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-09 10:59:51,599 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-09 10:59:51,599 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-09 10:59:51,601 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-09 10:59:51,601 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-09 10:59:51,603 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-09 10:59:51,603 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-09 10:59:51,604 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-09 10:59:51,604 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-09 10:59:51,604 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-09 10:59:51,604 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-09 10:59:51,605 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-09 10:59:51,606 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.epf [2022-02-09 10:59:51,635 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-09 10:59:51,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-09 10:59:51,636 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-09 10:59:51,636 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-09 10:59:51,637 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-09 10:59:51,637 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-09 10:59:51,638 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-09 10:59:51,638 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-09 10:59:51,638 INFO L138 SettingsManager]: * Use SBE=true [2022-02-09 10:59:51,638 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-09 10:59:51,639 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-09 10:59:51,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-09 10:59:51,639 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-09 10:59:51,639 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-09 10:59:51,639 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-09 10:59:51,639 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-09 10:59:51,640 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-09 10:59:51,640 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-09 10:59:51,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-09 10:59:51,640 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-09 10:59:51,640 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-09 10:59:51,640 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-09 10:59:51,640 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-09 10:59:51,640 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-09 10:59:51,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-09 10:59:51,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-09 10:59:51,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-09 10:59:51,642 INFO L138 SettingsManager]: * Construct finite automaton lazily=true [2022-02-09 10:59:51,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-09 10:59:51,642 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-09 10:59:51,642 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-09 10:59:51,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-09 10:59:51,643 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-09 10:59:51,643 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-02-09 10:59:51,643 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-09 10:59:51,643 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-02-09 10:59:51,643 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-02-09 10:59:51,643 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-02-09 10:59:51,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-09 10:59:51,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-09 10:59:51,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-09 10:59:51,901 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-09 10:59:51,902 INFO L275 PluginConnector]: CDTParser initialized [2022-02-09 10:59:51,903 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-lit/sssc12_variant.i [2022-02-09 10:59:51,957 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/908bf072c/28e4861c3bae4fee91f3ce329106f829/FLAGf35ae4236 [2022-02-09 10:59:52,389 INFO L306 CDTParser]: Found 1 translation units. [2022-02-09 10:59:52,390 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/sssc12_variant.i [2022-02-09 10:59:52,415 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/908bf072c/28e4861c3bae4fee91f3ce329106f829/FLAGf35ae4236 [2022-02-09 10:59:52,735 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/908bf072c/28e4861c3bae4fee91f3ce329106f829 [2022-02-09 10:59:52,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-09 10:59:52,740 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-09 10:59:52,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-09 10:59:52,744 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-09 10:59:52,747 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-09 10:59:52,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 10:59:52" (1/1) ... [2022-02-09 10:59:52,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30659cfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:59:52, skipping insertion in model container [2022-02-09 10:59:52,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 10:59:52" (1/1) ... [2022-02-09 10:59:52,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-09 10:59:52,808 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-09 10:59:53,159 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/sssc12_variant.i[46865,46878] [2022-02-09 10:59:53,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-09 10:59:53,187 INFO L203 MainTranslator]: Completed pre-run [2022-02-09 10:59:53,232 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/sssc12_variant.i[46865,46878] [2022-02-09 10:59:53,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-09 10:59:53,275 INFO L208 MainTranslator]: Completed translation [2022-02-09 10:59:53,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:59:53 WrapperNode [2022-02-09 10:59:53,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-09 10:59:53,276 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-09 10:59:53,277 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-09 10:59:53,277 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-09 10:59:53,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:59:53" (1/1) ... [2022-02-09 10:59:53,296 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:59:53" (1/1) ... [2022-02-09 10:59:53,314 INFO L137 Inliner]: procedures = 275, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 87 [2022-02-09 10:59:53,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-09 10:59:53,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-09 10:59:53,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-09 10:59:53,316 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-09 10:59:53,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:59:53" (1/1) ... [2022-02-09 10:59:53,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:59:53" (1/1) ... [2022-02-09 10:59:53,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:59:53" (1/1) ... [2022-02-09 10:59:53,326 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:59:53" (1/1) ... [2022-02-09 10:59:53,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:59:53" (1/1) ... [2022-02-09 10:59:53,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:59:53" (1/1) ... [2022-02-09 10:59:53,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:59:53" (1/1) ... [2022-02-09 10:59:53,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-09 10:59:53,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-09 10:59:53,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-09 10:59:53,340 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-09 10:59:53,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:59:53" (1/1) ... [2022-02-09 10:59:53,366 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-09 10:59:53,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 10:59:53,388 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-09 10:59:53,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-09 10:59:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-09 10:59:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2022-02-09 10:59:53,420 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2022-02-09 10:59:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-09 10:59:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-09 10:59:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-09 10:59:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-09 10:59:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-09 10:59:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-09 10:59:53,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-09 10:59:53,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-09 10:59:53,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-09 10:59:53,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-09 10:59:53,423 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-09 10:59:53,516 INFO L234 CfgBuilder]: Building ICFG [2022-02-09 10:59:53,518 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-09 10:59:53,714 INFO L275 CfgBuilder]: Performing block encoding [2022-02-09 10:59:53,742 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-09 10:59:53,743 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-09 10:59:53,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 10:59:53 BoogieIcfgContainer [2022-02-09 10:59:53,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-09 10:59:53,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-09 10:59:53,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-09 10:59:53,753 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-09 10:59:53,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.02 10:59:52" (1/3) ... [2022-02-09 10:59:53,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d925089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.02 10:59:53, skipping insertion in model container [2022-02-09 10:59:53,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:59:53" (2/3) ... [2022-02-09 10:59:53,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d925089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.02 10:59:53, skipping insertion in model container [2022-02-09 10:59:53,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 10:59:53" (3/3) ... [2022-02-09 10:59:53,756 INFO L111 eAbstractionObserver]: Analyzing ICFG sssc12_variant.i [2022-02-09 10:59:53,760 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-09 10:59:53,760 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-09 10:59:53,761 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-09 10:59:53,761 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-09 10:59:53,792 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,793 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,793 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,793 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,793 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,793 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,794 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,794 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,794 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,794 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,794 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,794 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,795 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,795 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,795 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,795 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,795 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,795 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,796 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,796 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,797 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,797 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,797 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,797 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,798 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,798 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,798 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,798 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,799 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,799 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,799 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,799 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,799 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,799 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,800 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,800 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,800 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,800 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,800 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,801 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,801 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,801 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,801 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,801 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,802 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,803 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,803 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,803 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,803 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,803 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,804 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,804 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,804 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,804 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,805 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,805 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,805 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,805 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,805 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,805 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,805 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,806 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,806 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,806 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,806 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,806 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,807 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,807 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,807 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,807 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,810 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,810 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,810 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,811 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,811 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,811 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,811 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,811 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,811 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,812 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,812 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:53,812 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-09 10:59:53,851 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-09 10:59:53,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 10:59:53,853 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-02-09 10:59:53,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-02-09 10:59:53,879 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-02-09 10:59:53,885 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mLazyFiniteAutomaton=true, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-09 10:59:53,885 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-09 10:59:54,032 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-09 10:59:54,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 10:59:54,037 INFO L85 PathProgramCache]: Analyzing trace with hash -147767055, now seen corresponding path program 1 times [2022-02-09 10:59:54,044 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 10:59:54,044 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969573735] [2022-02-09 10:59:54,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 10:59:54,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 10:59:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 10:59:54,275 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-09 10:59:54,275 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 10:59:54,276 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969573735] [2022-02-09 10:59:54,276 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969573735] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 10:59:54,277 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 10:59:54,277 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-09 10:59:54,278 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628496949] [2022-02-09 10:59:54,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 10:59:54,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-09 10:59:54,283 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 10:59:54,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-09 10:59:54,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-09 10:59:54,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:59:54,306 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 10:59:54,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 10:59:54,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:59:54,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:59:54,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-09 10:59:54,330 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-09 10:59:54,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 10:59:54,333 INFO L85 PathProgramCache]: Analyzing trace with hash 178627719, now seen corresponding path program 1 times [2022-02-09 10:59:54,334 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 10:59:54,334 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666155047] [2022-02-09 10:59:54,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 10:59:54,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 10:59:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-09 10:59:54,390 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-09 10:59:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-09 10:59:54,451 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-09 10:59:54,452 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-09 10:59:54,453 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 1 remaining) [2022-02-09 10:59:54,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-09 10:59:54,467 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-09 10:59:54,468 INFO L309 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/2) [2022-02-09 10:59:54,469 WARN L235 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-02-09 10:59:54,469 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-02-09 10:59:54,483 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,483 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,483 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,483 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,483 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,483 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,484 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,484 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,484 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,484 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,484 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,484 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,484 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,484 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,484 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,485 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,485 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,485 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,485 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,485 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,486 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,486 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,486 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,486 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,486 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,486 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,486 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,487 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,487 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,487 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,487 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,487 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,487 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,487 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,488 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,488 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,488 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,488 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,488 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,488 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,488 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,489 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,489 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,489 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,489 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,489 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,490 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,490 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,490 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,490 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,490 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,490 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,491 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,491 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,493 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,493 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,493 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,494 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,494 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,494 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,494 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,494 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,494 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,495 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,495 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,495 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,495 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,495 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,495 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,496 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,496 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,496 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,496 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,496 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,497 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,497 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,497 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,497 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,497 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,497 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,497 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,497 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,497 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,498 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,498 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,498 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,498 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,498 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,498 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,498 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,499 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,499 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,499 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,499 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,499 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,500 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,500 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,500 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,500 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,500 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,500 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,500 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,501 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,501 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,501 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,501 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,501 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,501 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,501 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,501 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,502 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,502 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,502 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,502 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,502 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,503 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,503 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,503 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,503 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,503 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,504 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,504 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,504 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,504 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,504 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,504 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,504 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,504 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,505 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,505 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,505 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,505 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,507 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,507 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,508 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,508 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,508 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,508 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,510 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,510 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,527 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,527 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,527 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,527 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,527 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,527 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,528 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,528 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,528 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,528 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,528 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,529 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,529 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,529 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,529 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,529 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,530 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,530 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,530 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,530 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,530 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,531 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 10:59:54,531 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-09 10:59:54,535 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-09 10:59:54,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 10:59:54,539 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) [2022-02-09 10:59:54,546 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 [2022-02-09 10:59:54,547 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thrThread2of2ForFork0 ======== [2022-02-09 10:59:54,548 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mLazyFiniteAutomaton=true, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-09 10:59:54,548 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-09 10:59:54,823 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 10:59:54,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 10:59:54,823 INFO L85 PathProgramCache]: Analyzing trace with hash -495900000, now seen corresponding path program 1 times [2022-02-09 10:59:54,824 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 10:59:54,824 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086337944] [2022-02-09 10:59:54,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 10:59:54,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 10:59:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 10:59:54,907 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-09 10:59:54,908 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 10:59:54,908 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086337944] [2022-02-09 10:59:54,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086337944] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 10:59:54,908 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 10:59:54,908 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-09 10:59:54,908 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398229031] [2022-02-09 10:59:54,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 10:59:54,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-09 10:59:54,910 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 10:59:54,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-09 10:59:54,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-09 10:59:54,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:59:54,911 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 10:59:54,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 43.0) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 10:59:54,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:59:54,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:59:54,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-09 10:59:54,945 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 10:59:54,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 10:59:54,946 INFO L85 PathProgramCache]: Analyzing trace with hash 712477608, now seen corresponding path program 1 times [2022-02-09 10:59:54,946 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 10:59:54,946 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083820194] [2022-02-09 10:59:54,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 10:59:54,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 10:59:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 10:59:55,053 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-09 10:59:55,053 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 10:59:55,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083820194] [2022-02-09 10:59:55,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083820194] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 10:59:55,054 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 10:59:55,054 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-09 10:59:55,057 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687110392] [2022-02-09 10:59:55,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 10:59:55,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 10:59:55,058 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 10:59:55,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 10:59:55,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-09 10:59:55,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:59:55,059 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 10:59:55,060 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) [2022-02-09 10:59:55,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:59:55,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:59:55,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:59:55,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 10:59:55,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-09 10:59:55,223 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 10:59:55,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 10:59:55,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1020135921, now seen corresponding path program 1 times [2022-02-09 10:59:55,223 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 10:59:55,223 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602027956] [2022-02-09 10:59:55,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 10:59:55,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 10:59:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 10:59:55,305 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-09 10:59:55,305 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 10:59:55,305 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602027956] [2022-02-09 10:59:55,306 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602027956] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 10:59:55,306 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 10:59:55,306 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 10:59:55,306 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579870896] [2022-02-09 10:59:55,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 10:59:55,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-09 10:59:55,307 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 10:59:55,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-09 10:59:55,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-09 10:59:55,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:59:55,307 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 10:59:55,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 10:59:55,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:59:55,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 10:59:55,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:59:55,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:59:55,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 10:59:55,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 10:59:55,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-09 10:59:55,409 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 10:59:55,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 10:59:55,409 INFO L85 PathProgramCache]: Analyzing trace with hash -469146024, now seen corresponding path program 1 times [2022-02-09 10:59:55,409 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 10:59:55,410 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688259204] [2022-02-09 10:59:55,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 10:59:55,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 10:59:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 10:59:55,475 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-09 10:59:55,475 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 10:59:55,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688259204] [2022-02-09 10:59:55,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688259204] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 10:59:55,476 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 10:59:55,476 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-09 10:59:55,476 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570169210] [2022-02-09 10:59:55,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 10:59:55,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 10:59:55,477 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 10:59:55,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 10:59:55,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-09 10:59:55,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:59:55,477 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 10:59:55,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 10:59:55,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:59:55,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 10:59:55,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 10:59:55,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:59:55,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:59:55,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 10:59:55,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 10:59:55,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-09 10:59:55,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-09 10:59:55,593 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 10:59:55,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 10:59:55,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1873658618, now seen corresponding path program 1 times [2022-02-09 10:59:55,594 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 10:59:55,594 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402986159] [2022-02-09 10:59:55,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 10:59:55,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 10:59:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 10:59:55,742 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-09 10:59:55,742 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 10:59:55,743 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402986159] [2022-02-09 10:59:55,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402986159] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 10:59:55,743 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845914171] [2022-02-09 10:59:55,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 10:59:55,744 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 10:59:55,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 10:59:55,780 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 10:59:55,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-09 10:59:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 10:59:55,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-09 10:59:55,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 10:59:56,151 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-09 10:59:56,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 10:59:56,379 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-09 10:59:56,379 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845914171] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 10:59:56,379 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 10:59:56,380 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-02-09 10:59:56,380 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110254418] [2022-02-09 10:59:56,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 10:59:56,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-09 10:59:56,381 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 10:59:56,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-09 10:59:56,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-09 10:59:56,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:59:56,381 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 10:59:56,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.727272727272727) internal successors, (173), 11 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 10:59:56,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:59:56,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 10:59:56,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 10:59:56,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-02-09 10:59:56,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:59:56,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:59:56,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 10:59:56,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 10:59:56,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-09 10:59:56,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 10:59:56,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-09 10:59:56,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 10:59:56,739 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 10:59:56,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 10:59:56,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1716499179, now seen corresponding path program 2 times [2022-02-09 10:59:56,740 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 10:59:56,740 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971447560] [2022-02-09 10:59:56,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 10:59:56,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 10:59:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 10:59:56,870 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 11 proven. 76 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-09 10:59:56,871 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 10:59:56,871 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971447560] [2022-02-09 10:59:56,871 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971447560] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 10:59:56,871 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274767777] [2022-02-09 10:59:56,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-09 10:59:56,871 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 10:59:56,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 10:59:56,872 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 10:59:56,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-09 10:59:56,992 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-09 10:59:56,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 10:59:56,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-09 10:59:57,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 10:59:57,292 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 11 proven. 76 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-09 10:59:57,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 10:59:57,600 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 11 proven. 76 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-09 10:59:57,600 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274767777] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 10:59:57,600 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 10:59:57,601 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-02-09 10:59:57,601 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33048538] [2022-02-09 10:59:57,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 10:59:57,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-09 10:59:57,602 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 10:59:57,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-09 10:59:57,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2022-02-09 10:59:57,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:59:57,604 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 10:59:57,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 14.411764705882353) internal successors, (245), 17 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 10:59:57,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:59:57,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 10:59:57,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 10:59:57,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-02-09 10:59:57,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 10:59:57,605 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:59:57,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:59:57,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 10:59:57,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 10:59:57,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-09 10:59:57,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 10:59:57,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 10:59:57,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-09 10:59:57,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 10:59:57,990 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 10:59:57,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 10:59:57,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1446186187, now seen corresponding path program 3 times [2022-02-09 10:59:57,991 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 10:59:57,991 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900662905] [2022-02-09 10:59:57,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 10:59:57,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 10:59:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 10:59:58,193 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2022-02-09 10:59:58,194 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 10:59:58,194 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900662905] [2022-02-09 10:59:58,194 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900662905] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 10:59:58,194 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741650500] [2022-02-09 10:59:58,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-09 10:59:58,194 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 10:59:58,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 10:59:58,195 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 10:59:58,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-09 10:59:58,297 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-09 10:59:58,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 10:59:58,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-09 10:59:58,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 10:59:58,349 INFO L387 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 [2022-02-09 10:59:58,380 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-09 10:59:58,380 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-09 10:59:58,681 INFO L387 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 [2022-02-09 10:59:58,726 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 10:59:58,737 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-02-09 10:59:58,763 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2022-02-09 10:59:58,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 10:59:58,817 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_312 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_312) c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) is different from false [2022-02-09 10:59:58,872 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 10:59:58,872 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-02-09 10:59:58,876 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2022-02-09 10:59:59,239 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 558 trivial. 10 not checked. [2022-02-09 10:59:59,239 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741650500] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 10:59:59,239 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 10:59:59,239 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 14 [2022-02-09 10:59:59,240 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783192761] [2022-02-09 10:59:59,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 10:59:59,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-09 10:59:59,240 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 10:59:59,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-09 10:59:59,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=129, Unknown=1, NotChecked=22, Total=182 [2022-02-09 10:59:59,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:59:59,241 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 10:59:59,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.785714285714286) internal successors, (137), 14 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 10:59:59,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:59:59,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 10:59:59,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 10:59:59,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-02-09 10:59:59,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 10:59:59,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 10:59:59,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:59:59,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 10:59:59,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-09 10:59:59,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 10:59:59,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-09 10:59:59,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 10:59:59,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 10:59:59,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 10:59:59,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-09 11:00:00,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 11:00:00,183 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 11:00:00,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 11:00:00,184 INFO L85 PathProgramCache]: Analyzing trace with hash 2043294425, now seen corresponding path program 1 times [2022-02-09 11:00:00,184 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 11:00:00,184 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647323811] [2022-02-09 11:00:00,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 11:00:00,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 11:00:00,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:00:00,383 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 469 proven. 120 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-02-09 11:00:00,383 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 11:00:00,383 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647323811] [2022-02-09 11:00:00,384 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647323811] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 11:00:00,384 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686714362] [2022-02-09 11:00:00,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 11:00:00,384 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 11:00:00,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 11:00:00,385 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 11:00:00,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-09 11:00:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:00:00,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-09 11:00:00,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 11:00:01,005 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 589 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-02-09 11:00:01,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-09 11:00:01,005 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686714362] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 11:00:01,005 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-09 11:00:01,005 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 17 [2022-02-09 11:00:01,006 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530453222] [2022-02-09 11:00:01,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 11:00:01,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-09 11:00:01,006 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 11:00:01,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-09 11:00:01,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2022-02-09 11:00:01,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:00:01,007 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 11:00:01,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.642857142857142) internal successors, (219), 14 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 11:00:01,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:00:01,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-09 11:00:01,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 11:00:01,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-02-09 11:00:01,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 11:00:01,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:00:01,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:00:01,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:00:01,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:00:01,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:00:01,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 11:00:01,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-09 11:00:01,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 11:00:01,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:00:01,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:00:01,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:00:01,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-09 11:00:01,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 11:00:01,924 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 11:00:01,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 11:00:01,924 INFO L85 PathProgramCache]: Analyzing trace with hash 421905766, now seen corresponding path program 2 times [2022-02-09 11:00:01,924 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 11:00:01,924 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698454213] [2022-02-09 11:00:01,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 11:00:01,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 11:00:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:00:02,310 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 36 proven. 488 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-09 11:00:02,311 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 11:00:02,311 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698454213] [2022-02-09 11:00:02,311 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698454213] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 11:00:02,311 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761126174] [2022-02-09 11:00:02,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-09 11:00:02,311 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 11:00:02,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 11:00:02,312 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 11:00:02,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-09 11:00:02,466 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-09 11:00:02,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 11:00:02,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-09 11:00:02,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 11:00:02,943 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-09 11:00:02,991 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-09 11:00:02,991 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-09 11:00:03,002 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-02-09 11:00:03,043 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 56 proven. 468 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-09 11:00:03,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 11:00:03,754 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 47 proven. 477 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-09 11:00:03,754 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761126174] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 11:00:03,754 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 11:00:03,755 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 38 [2022-02-09 11:00:03,756 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460111033] [2022-02-09 11:00:03,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 11:00:03,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-02-09 11:00:03,757 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 11:00:03,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-02-09 11:00:03,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1181, Unknown=0, NotChecked=0, Total=1406 [2022-02-09 11:00:03,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:00:03,759 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 11:00:03,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 10.263157894736842) internal successors, (390), 38 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 11:00:03,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:00:03,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:00:03,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 11:00:03,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-02-09 11:00:03,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 11:00:03,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:00:03,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:00:03,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:00:03,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:00:05,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:00:05,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:00:05,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 11:00:05,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-09 11:00:05,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 11:00:05,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:00:05,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:00:05,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:00:05,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-02-09 11:00:06,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-09 11:00:06,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 11:00:06,164 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 11:00:06,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 11:00:06,164 INFO L85 PathProgramCache]: Analyzing trace with hash -91412896, now seen corresponding path program 1 times [2022-02-09 11:00:06,164 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 11:00:06,165 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199622079] [2022-02-09 11:00:06,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 11:00:06,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 11:00:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:00:06,251 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2022-02-09 11:00:06,251 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 11:00:06,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199622079] [2022-02-09 11:00:06,251 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199622079] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 11:00:06,251 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 11:00:06,251 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-09 11:00:06,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81860156] [2022-02-09 11:00:06,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 11:00:06,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-09 11:00:06,252 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 11:00:06,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-09 11:00:06,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-09 11:00:06,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:00:06,253 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 11:00:06,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 11:00:06,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:00:06,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:00:06,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 11:00:06,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-02-09 11:00:06,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 11:00:06,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:00:06,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:00:06,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:00:06,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2022-02-09 11:00:06,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:00:08,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:00:08,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:00:08,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 11:00:08,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-09 11:00:08,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 11:00:08,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:00:08,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:00:08,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:00:08,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-02-09 11:00:08,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:00:08,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-09 11:00:08,078 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 11:00:08,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 11:00:08,078 INFO L85 PathProgramCache]: Analyzing trace with hash -2007965222, now seen corresponding path program 3 times [2022-02-09 11:00:08,079 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 11:00:08,079 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979323896] [2022-02-09 11:00:08,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 11:00:08,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 11:00:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:00:08,515 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 45 proven. 479 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-09 11:00:08,516 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 11:00:08,516 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979323896] [2022-02-09 11:00:08,516 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979323896] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 11:00:08,516 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2290463] [2022-02-09 11:00:08,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-09 11:00:08,516 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 11:00:08,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 11:00:08,520 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 11:00:08,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-09 11:00:08,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-02-09 11:00:08,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 11:00:08,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 34 conjunts are in the unsatisfiable core [2022-02-09 11:00:08,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 11:00:09,409 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-09 11:00:09,500 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-02-09 11:00:09,500 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 34 [2022-02-09 11:00:09,553 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-02-09 11:00:09,554 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 42 [2022-02-09 11:00:09,727 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-02-09 11:00:09,727 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 34 [2022-02-09 11:00:09,760 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-02-09 11:00:09,761 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 42 [2022-02-09 11:00:09,886 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-02-09 11:00:09,887 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 34 [2022-02-09 11:00:09,907 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-02-09 11:00:09,907 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 42 [2022-02-09 11:00:10,083 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-09 11:00:10,083 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-09 11:00:10,091 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-02-09 11:00:10,133 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 56 proven. 297 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2022-02-09 11:00:10,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 11:00:12,452 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1))))) is different from false [2022-02-09 11:00:24,008 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|)) is different from false [2022-02-09 11:00:36,399 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-02-09 11:00:36,767 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 56 proven. 95 refuted. 0 times theorem prover too weak. 151 trivial. 226 not checked. [2022-02-09 11:00:36,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2290463] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 11:00:36,767 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 11:00:36,767 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 15, 18] total 45 [2022-02-09 11:00:36,768 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016916675] [2022-02-09 11:00:36,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 11:00:36,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-02-09 11:00:36,769 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 11:00:36,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-02-09 11:00:36,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1595, Unknown=6, NotChecked=166, Total=1980 [2022-02-09 11:00:36,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:00:36,770 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 11:00:36,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 10.666666666666666) internal successors, (480), 45 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 11:00:36,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:00:36,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:00:36,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 11:00:36,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-02-09 11:00:36,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 11:00:36,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:00:36,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:00:36,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:00:36,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2022-02-09 11:00:36,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:00:36,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:00:39,304 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 5 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) is different from false [2022-02-09 11:00:41,455 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (<= (+ 6 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|)) is different from false [2022-02-09 11:00:43,591 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 2) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|)) is different from false [2022-02-09 11:00:45,721 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 8 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 3) |c_thrThread2of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|)) is different from false [2022-02-09 11:00:47,815 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 2) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0)) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) is different from false [2022-02-09 11:00:49,826 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) is different from false [2022-02-09 11:00:51,908 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 8 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 3) |c_thrThread2of2ForFork0_~c~0#1|)) is different from false [2022-02-09 11:00:53,912 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 3) |c_thrThread2of2ForFork0_~c~0#1|)) is different from false [2022-02-09 11:00:55,946 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 3) |c_thrThread2of2ForFork0_~c~0#1|)) is different from false [2022-02-09 11:00:57,951 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 6 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 3) |c_thrThread2of2ForFork0_~c~0#1|)) is different from false [2022-02-09 11:00:59,982 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 5 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 3) |c_thrThread2of2ForFork0_~c~0#1|)) is different from false [2022-02-09 11:01:02,019 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (and (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) .cse0)) (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (not (= (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) .cse0)) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 3) |c_thrThread2of2ForFork0_~c~0#1|))) is different from false [2022-02-09 11:01:04,022 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ 3 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 3) |c_thrThread2of2ForFork0_~c~0#1|)) is different from false [2022-02-09 11:01:06,054 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 3) |c_thrThread2of2ForFork0_~c~0#1|)) is different from false [2022-02-09 11:01:08,309 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (or (let ((.cse0 (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (and (= 1 (select (select |c_#memory_int| c_~data~0.base) .cse0)) (not (= (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) .cse0)))) (not (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|)) is different from false [2022-02-09 11:01:10,659 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 6 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) is different from false [2022-02-09 11:01:12,662 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 6 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((v_subst_1 Int)) (or (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)) (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))))) is different from false [2022-02-09 11:01:14,667 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 6 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1))))) is different from false [2022-02-09 11:01:16,673 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 5 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1))))) is different from false [2022-02-09 11:01:18,676 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 5 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((v_subst_1 Int)) (or (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)) (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))))) is different from false [2022-02-09 11:01:20,683 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) (.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) .cse1) (<= (+ 5 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) .cse1 (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (or (not (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|)) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))))) is different from false [2022-02-09 11:01:22,689 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (and (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) .cse0)) (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (not (= (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) .cse0)))) is different from false [2022-02-09 11:02:02,736 WARN L228 SmtUtils]: Spent 6.01s on a formula simplification. DAG size of input: 30 DAG size of output: 14 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-09 11:02:04,745 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (let ((.cse1 (= 1 (select (select |c_#memory_int| c_~data~0.base) .cse2))) (.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) .cse1) (or (and .cse1 (not (= (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) .cse2))) (not (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) .cse1 (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (or (not (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|)) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|)))))) is different from false [2022-02-09 11:02:06,753 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (or (not (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|)) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))))) is different from false [2022-02-09 11:02:08,758 WARN L838 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (and (= 1 (select (select |c_#memory_int| c_~data~0.base) .cse0)) (not (= (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) .cse0)))) (not (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1))))) is different from false [2022-02-09 11:02:09,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:02:09,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:02:09,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 11:02:09,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-09 11:02:09,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 11:02:09,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:02:09,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:02:09,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:02:09,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-02-09 11:02:09,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:02:09,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-02-09 11:02:09,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-09 11:02:09,277 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,SelfDestructingSolverStorable12 [2022-02-09 11:02:09,278 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 11:02:09,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 11:02:09,278 INFO L85 PathProgramCache]: Analyzing trace with hash 45194586, now seen corresponding path program 4 times [2022-02-09 11:02:09,278 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 11:02:09,278 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460198885] [2022-02-09 11:02:09,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 11:02:09,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 11:02:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:02:09,861 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 45 proven. 479 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-09 11:02:09,861 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 11:02:09,861 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460198885] [2022-02-09 11:02:09,862 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460198885] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 11:02:09,862 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014227785] [2022-02-09 11:02:09,862 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-09 11:02:09,862 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 11:02:09,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 11:02:09,864 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 11:02:09,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-09 11:02:10,023 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-09 11:02:10,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 11:02:10,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 47 conjunts are in the unsatisfiable core [2022-02-09 11:02:10,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 11:02:10,056 INFO L387 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 [2022-02-09 11:02:10,088 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-09 11:02:10,089 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-09 11:02:10,765 INFO L387 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 [2022-02-09 11:02:10,812 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 11:02:10,885 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-09 11:02:10,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-09 11:02:10,903 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-09 11:02:10,904 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-09 11:02:10,974 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-09 11:02:10,974 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-09 11:02:10,989 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-09 11:02:10,989 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-09 11:02:11,049 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-09 11:02:11,050 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-09 11:02:11,064 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-09 11:02:11,064 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-09 11:02:11,142 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-09 11:02:11,144 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-09 11:02:11,152 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-02-09 11:02:11,195 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 56 proven. 468 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-09 11:02:11,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 11:02:11,815 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 5 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_ArrVal_920 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_920) c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) is different from false [2022-02-09 11:02:11,849 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 11:02:11,849 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-02-09 11:02:11,853 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2022-02-09 11:02:11,857 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-02-09 11:02:12,780 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 46 proven. 468 refuted. 0 times theorem prover too weak. 4 trivial. 10 not checked. [2022-02-09 11:02:12,781 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014227785] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 11:02:12,781 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 11:02:12,781 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 48 [2022-02-09 11:02:12,781 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657651776] [2022-02-09 11:02:12,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 11:02:12,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-02-09 11:02:12,782 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 11:02:12,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-02-09 11:02:12,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=1896, Unknown=1, NotChecked=90, Total=2256 [2022-02-09 11:02:12,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:02:12,783 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 11:02:12,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 9.104166666666666) internal successors, (437), 48 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 11:02:12,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:02:12,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:02:12,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 11:02:12,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-02-09 11:02:12,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 11:02:12,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:02:12,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:02:12,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:02:12,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2022-02-09 11:02:12,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:02:12,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2022-02-09 11:02:12,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:02:16,591 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (let ((.cse1 (= 1 (select (select |c_#memory_int| c_~data~0.base) .cse2))) (.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) .cse1) (or (and .cse1 (not (= (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) .cse2))) (not (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) .cse1 (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (or (not (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|)) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|)))))) is different from false [2022-02-09 11:02:19,093 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (let ((.cse1 (= 1 (select (select |c_#memory_int| c_~data~0.base) .cse2))) (.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) .cse1) (or (and .cse1 (not (= (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) .cse2))) (not (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 2) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (not (= |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1| 0)) .cse1 (or (not (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|)) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|)))))) is different from false [2022-02-09 11:02:21,182 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 3) |c_thrThread2of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|)) is different from false [2022-02-09 11:02:24,993 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((v_subst_1 Int)) (or (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)) (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))))) is different from false [2022-02-09 11:02:27,074 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1))))) is different from false [2022-02-09 11:02:29,209 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (or (not (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|)) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ 2 |c_thrThread2of2ForFork0_~c~0#1|)))) is different from false [2022-02-09 11:02:31,527 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) (.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) .cse1) (<= (+ 6 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) .cse1 (or (not (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|)) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))))) is different from false [2022-02-09 11:02:33,666 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) (.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) .cse1) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) .cse1 (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (or (not (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|)) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))))) is different from false [2022-02-09 11:02:35,711 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) (.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) .cse1) (<= (+ 8 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 2) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) .cse1 (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (or (not (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|)) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))))) is different from false [2022-02-09 11:02:37,954 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) (.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) .cse1) (<= (+ 8 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) .cse1 (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (or (not (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|)) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))))) is different from false [2022-02-09 11:02:40,038 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) (.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) .cse1) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (<= (+ 8 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) .cse1 (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (or (not (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|)) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))))) is different from false [2022-02-09 11:02:40,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:02:40,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:02:40,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 11:02:40,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-09 11:02:40,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 11:02:40,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:02:40,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:02:40,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:02:40,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-02-09 11:02:40,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:02:40,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2022-02-09 11:02:40,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-02-09 11:02:40,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-09 11:02:40,711 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,SelfDestructingSolverStorable13 [2022-02-09 11:02:40,711 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 11:02:40,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 11:02:40,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1056291974, now seen corresponding path program 5 times [2022-02-09 11:02:40,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 11:02:40,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896717133] [2022-02-09 11:02:40,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 11:02:40,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 11:02:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:02:41,242 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 3 proven. 467 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-09 11:02:41,243 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 11:02:41,243 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896717133] [2022-02-09 11:02:41,243 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896717133] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 11:02:41,243 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710270695] [2022-02-09 11:02:41,243 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-09 11:02:41,243 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 11:02:41,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 11:02:41,250 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 11:02:41,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-09 11:02:41,686 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-02-09 11:02:41,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 11:02:41,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 49 conjunts are in the unsatisfiable core [2022-02-09 11:02:41,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 11:02:41,722 INFO L387 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 [2022-02-09 11:02:41,747 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-09 11:02:41,748 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-09 11:02:42,189 INFO L387 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 [2022-02-09 11:02:42,230 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 11:02:42,285 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-09 11:02:42,285 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-09 11:02:42,300 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-09 11:02:42,300 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-09 11:02:42,352 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-09 11:02:42,352 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-09 11:02:42,376 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-09 11:02:42,376 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-09 11:02:42,426 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-09 11:02:42,427 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-09 11:02:42,440 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-09 11:02:42,441 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-09 11:02:42,493 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-09 11:02:42,494 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-09 11:02:42,511 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-09 11:02:42,512 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-09 11:02:42,581 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-09 11:02:42,581 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-09 11:02:42,587 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-02-09 11:02:42,625 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 14 proven. 456 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-09 11:02:42,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 11:02:43,186 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 6 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_ArrVal_1050 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1050) c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) is different from false [2022-02-09 11:02:43,211 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 11:02:43,211 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-02-09 11:02:43,213 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2022-02-09 11:02:43,215 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-02-09 11:02:43,728 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 4 proven. 456 refuted. 0 times theorem prover too weak. 4 trivial. 10 not checked. [2022-02-09 11:02:43,728 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710270695] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 11:02:43,728 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 11:02:43,728 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 40 [2022-02-09 11:02:43,729 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41112779] [2022-02-09 11:02:43,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 11:02:43,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-02-09 11:02:43,729 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 11:02:43,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-02-09 11:02:43,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1300, Unknown=1, NotChecked=74, Total=1560 [2022-02-09 11:02:43,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:02:43,730 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 11:02:43,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 8.525) internal successors, (341), 40 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) [2022-02-09 11:02:43,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:02:43,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:02:43,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 11:02:43,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-02-09 11:02:43,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 11:02:43,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:02:43,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:02:43,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:02:43,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-02-09 11:02:43,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:02:43,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 163 states. [2022-02-09 11:02:43,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-02-09 11:02:43,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:02:46,874 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) (.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) .cse1) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) .cse1 (or (not (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|)) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))))) is different from false [2022-02-09 11:02:49,481 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) (.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) .cse1) (<= (+ 8 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) .cse1 (or (not (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|)) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))))) is different from false [2022-02-09 11:02:53,175 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) (.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) .cse1) (<= (+ 8 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) .cse1 (= |c_thrThread1of2ForFork0_~c~0#1| 0) (or (not (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|)) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))))) is different from false [2022-02-09 11:02:55,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:02:55,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:02:55,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 11:02:55,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-09 11:02:55,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-09 11:02:55,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:02:55,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:02:55,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:02:55,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-02-09 11:02:55,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:02:55,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2022-02-09 11:02:55,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-02-09 11:02:55,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-02-09 11:02:55,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-02-09 11:02:55,642 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,SelfDestructingSolverStorable14 [2022-02-09 11:02:55,643 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 11:02:55,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 11:02:55,644 INFO L85 PathProgramCache]: Analyzing trace with hash -213185003, now seen corresponding path program 6 times [2022-02-09 11:02:55,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 11:02:55,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142218998] [2022-02-09 11:02:55,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 11:02:55,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 11:02:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:02:56,472 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 45 proven. 381 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-09 11:02:56,472 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 11:02:56,473 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142218998] [2022-02-09 11:02:56,473 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142218998] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 11:02:56,473 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107628772] [2022-02-09 11:02:56,473 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-09 11:02:56,473 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 11:02:56,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 11:02:56,474 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 11:02:56,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-09 11:02:56,623 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-02-09 11:02:56,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 11:02:56,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-09 11:02:56,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 11:02:56,890 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2022-02-09 11:02:56,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-09 11:02:56,890 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107628772] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 11:02:56,890 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-09 11:02:56,890 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [29] total 30 [2022-02-09 11:02:56,890 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570269242] [2022-02-09 11:02:56,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 11:02:56,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-09 11:02:56,891 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 11:02:56,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-09 11:02:56,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2022-02-09 11:02:56,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:02:56,892 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 11:02:56,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 11:02:56,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:02:56,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:02:56,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 11:02:56,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-02-09 11:02:56,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-02-09 11:02:56,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:02:56,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:02:56,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:02:56,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 129 states. [2022-02-09 11:02:56,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:02:56,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 181 states. [2022-02-09 11:02:56,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2022-02-09 11:02:56,892 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2022-02-09 11:02:56,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:03:02,974 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (let ((.cse1 (= 1 (select (select |c_#memory_int| c_~data~0.base) .cse2))) (.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) .cse1) (or (and .cse1 (not (= (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) .cse2))) (not (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) .cse1 (or (not (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|)) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|)))))) is different from false [2022-02-09 11:03:07,355 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (let ((.cse1 (= 1 (select (select |c_#memory_int| c_~data~0.base) .cse2))) (.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) .cse1) (forall ((v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_1) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) .cse1 (forall ((|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_785) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |thrThread1of2ForFork0_~c~0#1| 1)))) (not (= (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) .cse2)) (or (not (<= .cse0 |c_thrThread2of2ForFork0_~c~0#1|)) (not (< |c_thrThread2of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|)))))) is different from false [2022-02-09 11:03:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:03:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:03:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 11:03:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-09 11:03:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-09 11:03:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-09 11:03:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:03:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:03:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states. [2022-02-09 11:03:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:03:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2022-02-09 11:03:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-02-09 11:03:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-02-09 11:03:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 11:03:09,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-02-09 11:03:09,228 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,SelfDestructingSolverStorable15 [2022-02-09 11:03:09,228 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 11:03:09,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 11:03:09,229 INFO L85 PathProgramCache]: Analyzing trace with hash 728137024, now seen corresponding path program 1 times [2022-02-09 11:03:09,229 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 11:03:09,229 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589563277] [2022-02-09 11:03:09,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 11:03:09,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 11:03:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:03:09,537 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-09 11:03:09,537 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 11:03:09,537 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589563277] [2022-02-09 11:03:09,538 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589563277] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 11:03:09,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466629537] [2022-02-09 11:03:09,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 11:03:09,538 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 11:03:09,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 11:03:09,540 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 11:03:09,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-09 11:03:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:03:09,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-09 11:03:09,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 11:03:09,717 INFO L387 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 [2022-02-09 11:03:09,745 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-09 11:03:09,746 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-09 11:03:10,128 INFO L387 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 [2022-02-09 11:03:10,169 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 11:03:10,234 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-09 11:03:10,234 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-09 11:03:10,241 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-02-09 11:03:10,275 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 10 proven. 108 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-09 11:03:10,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 11:03:12,369 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread1of2ForFork0_~c~0#1_132| Int)) (or (forall ((v_ArrVal_1257 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_132| 4) c_~data~0.offset) v_ArrVal_1257) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_132|)))) is different from false [2022-02-09 11:03:12,404 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread1of2ForFork0_~c~0#1_132| Int) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1257 Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_132|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1256) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_132| 4) c_~data~0.offset) v_ArrVal_1257) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) is different from false [2022-02-09 11:03:12,463 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 11:03:12,463 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-02-09 11:03:12,466 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-02-09 11:03:12,473 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-02-09 11:03:12,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-02-09 11:03:13,043 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 5 trivial. 10 not checked. [2022-02-09 11:03:13,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466629537] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 11:03:13,043 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 11:03:13,043 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-02-09 11:03:13,043 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804698778] [2022-02-09 11:03:13,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 11:03:13,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-02-09 11:03:13,044 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 11:03:13,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-02-09 11:03:13,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1070, Unknown=2, NotChecked=138, Total=1406 [2022-02-09 11:03:13,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:03:13,045 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 11:03:13,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 7.447368421052632) internal successors, (283), 38 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) [2022-02-09 11:03:13,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:03:13,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:03:13,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 11:03:13,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-02-09 11:03:13,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-02-09 11:03:13,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-02-09 11:03:13,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:03:13,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:03:13,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 229 states. [2022-02-09 11:03:13,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:03:13,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 219 states. [2022-02-09 11:03:13,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states. [2022-02-09 11:03:13,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 116 states. [2022-02-09 11:03:13,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 11:03:13,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:03:13,706 WARN L838 $PredicateComparison]: unable to prove that (and (<= 10 |c_thrThread2of2ForFork0_~end~0#1|) (<= 10 c_~next~0) (= |c_thrThread2of2ForFork0_~c~0#1| 0) (<= (+ 6 |c_thrThread2of2ForFork0_~c~0#1|) c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (forall ((|v_thrThread1of2ForFork0_~c~0#1_132| Int) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1257 Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_132|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1256) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_132| 4) c_~data~0.offset) v_ArrVal_1257) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:14,129 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 6 |c_thrThread2of2ForFork0_~c~0#1|) c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|v_thrThread1of2ForFork0_~c~0#1_132| Int) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1257 Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_132|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1256) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_132| 4) c_~data~0.offset) v_ArrVal_1257) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:14,663 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) c_~next~0) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= (+ 6 |c_thrThread2of2ForFork0_~c~0#1|) c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|v_thrThread1of2ForFork0_~c~0#1_132| Int) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1257 Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_132|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1256) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_132| 4) c_~data~0.offset) v_ArrVal_1257) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:15,156 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 8 |c_thrThread2of2ForFork0_~c~0#1|) c_~next~0) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= (+ 6 |c_thrThread2of2ForFork0_~c~0#1|) c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|v_thrThread1of2ForFork0_~c~0#1_132| Int) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1257 Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_132|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1256) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_132| 4) c_~data~0.offset) v_ArrVal_1257) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:15,640 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 7 |c_thrThread2of2ForFork0_~c~0#1|) c_~next~0) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= (+ 6 |c_thrThread2of2ForFork0_~c~0#1|) c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|v_thrThread1of2ForFork0_~c~0#1_132| Int) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1257 Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_132|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1256) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_132| 4) c_~data~0.offset) v_ArrVal_1257) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:16,117 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= (+ 6 |c_thrThread2of2ForFork0_~c~0#1|) c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|v_thrThread1of2ForFork0_~c~0#1_132| Int) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1257 Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_132|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1256) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_132| 4) c_~data~0.offset) v_ArrVal_1257) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:16,618 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (< (+ 3 |c_thrThread2of2ForFork0_~c~0#1|) c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|v_thrThread1of2ForFork0_~c~0#1_132| Int) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1257 Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_132|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1256) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_132| 4) c_~data~0.offset) v_ArrVal_1257) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:17,133 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_132| Int) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1257 Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_132|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1256) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_132| 4) c_~data~0.offset) v_ArrVal_1257) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:17,641 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ 2 |c_thrThread2of2ForFork0_~c~0#1|) c_~next~0) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|v_thrThread1of2ForFork0_~c~0#1_132| Int) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1257 Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_132|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1256) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_132| 4) c_~data~0.offset) v_ArrVal_1257) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:18,158 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ |c_thrThread2of2ForFork0_~c~0#1| 1) c_~next~0) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|v_thrThread1of2ForFork0_~c~0#1_132| Int) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1257 Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_132|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1256) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_132| 4) c_~data~0.offset) v_ArrVal_1257) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:18,684 WARN L838 $PredicateComparison]: unable to prove that (and (not (<= c_~next~0 |c_thrThread2of2ForFork0_~c~0#1|)) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|v_thrThread1of2ForFork0_~c~0#1_132| Int) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1257 Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_132|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1256) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_132| 4) c_~data~0.offset) v_ArrVal_1257) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:18,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:03:18,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:03:18,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 11:03:18,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-09 11:03:18,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-09 11:03:18,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-09 11:03:18,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:03:18,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:03:18,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states. [2022-02-09 11:03:18,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:03:18,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2022-02-09 11:03:18,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-02-09 11:03:18,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-02-09 11:03:18,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 11:03:18,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-02-09 11:03:18,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-02-09 11:03:19,039 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,SelfDestructingSolverStorable16 [2022-02-09 11:03:19,040 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 11:03:19,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 11:03:19,040 INFO L85 PathProgramCache]: Analyzing trace with hash -332878701, now seen corresponding path program 2 times [2022-02-09 11:03:19,040 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 11:03:19,040 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841224870] [2022-02-09 11:03:19,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 11:03:19,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 11:03:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:03:19,490 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 523 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-09 11:03:19,491 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 11:03:19,491 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841224870] [2022-02-09 11:03:19,491 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841224870] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 11:03:19,491 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527712833] [2022-02-09 11:03:19,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-09 11:03:19,491 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 11:03:19,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 11:03:19,493 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 11:03:19,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-09 11:03:19,661 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-09 11:03:19,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 11:03:19,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 32 conjunts are in the unsatisfiable core [2022-02-09 11:03:19,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 11:03:19,690 INFO L387 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 [2022-02-09 11:03:19,718 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-09 11:03:19,718 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-09 11:03:20,334 INFO L387 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 [2022-02-09 11:03:20,369 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 11:03:20,420 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-09 11:03:20,420 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-09 11:03:20,425 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-02-09 11:03:20,462 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 10 proven. 513 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-09 11:03:20,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 11:03:22,542 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread1of2ForFork0_~c~0#1_136| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_136|)) (forall ((v_ArrVal_1367 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_136| 4) c_~data~0.offset) v_ArrVal_1367) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) is different from false [2022-02-09 11:03:22,575 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1367 Int) (|v_thrThread1of2ForFork0_~c~0#1_136| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_136|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1366) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_136| 4) c_~data~0.offset) v_ArrVal_1367) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) is different from false [2022-02-09 11:03:22,625 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 11:03:22,625 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-02-09 11:03:22,628 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-02-09 11:03:22,633 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-02-09 11:03:22,637 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-02-09 11:03:23,379 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 513 refuted. 0 times theorem prover too weak. 5 trivial. 10 not checked. [2022-02-09 11:03:23,379 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527712833] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 11:03:23,379 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 11:03:23,379 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 36 [2022-02-09 11:03:23,379 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623029869] [2022-02-09 11:03:23,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 11:03:23,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-02-09 11:03:23,380 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 11:03:23,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-02-09 11:03:23,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=959, Unknown=2, NotChecked=130, Total=1260 [2022-02-09 11:03:23,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:03:23,381 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 11:03:23,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.972222222222222) internal successors, (287), 36 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 11:03:23,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:03:23,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:03:23,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 11:03:23,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-02-09 11:03:23,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-02-09 11:03:23,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-02-09 11:03:23,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:03:23,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:03:23,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 229 states. [2022-02-09 11:03:23,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:03:23,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 219 states. [2022-02-09 11:03:23,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states. [2022-02-09 11:03:23,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 116 states. [2022-02-09 11:03:23,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 11:03:23,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-02-09 11:03:23,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:03:23,957 WARN L838 $PredicateComparison]: unable to prove that (and (<= 10 |c_thrThread2of2ForFork0_~end~0#1|) (<= 10 c_~next~0) (= |c_thrThread2of2ForFork0_~c~0#1| 0) (forall ((v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1367 Int) (|v_thrThread1of2ForFork0_~c~0#1_136| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_136|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1366) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_136| 4) c_~data~0.offset) v_ArrVal_1367) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 1) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:24,366 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1367 Int) (|v_thrThread1of2ForFork0_~c~0#1_136| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_136|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1366) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_136| 4) c_~data~0.offset) v_ArrVal_1367) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 1) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:24,896 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 9 |c_thrThread2of2ForFork0_~c~0#1|) c_~next~0) (forall ((v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1367 Int) (|v_thrThread1of2ForFork0_~c~0#1_136| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_136|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1366) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_136| 4) c_~data~0.offset) v_ArrVal_1367) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 1) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:25,392 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 8 |c_thrThread2of2ForFork0_~c~0#1|) c_~next~0) (forall ((v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1367 Int) (|v_thrThread1of2ForFork0_~c~0#1_136| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_136|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1366) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_136| 4) c_~data~0.offset) v_ArrVal_1367) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 1) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:25,874 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 7 |c_thrThread2of2ForFork0_~c~0#1|) c_~next~0) (forall ((v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1367 Int) (|v_thrThread1of2ForFork0_~c~0#1_136| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_136|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1366) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_136| 4) c_~data~0.offset) v_ArrVal_1367) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 1) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:26,368 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1367 Int) (|v_thrThread1of2ForFork0_~c~0#1_136| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_136|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1366) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_136| 4) c_~data~0.offset) v_ArrVal_1367) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= (+ 6 |c_thrThread2of2ForFork0_~c~0#1|) c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 1) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:26,857 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1367 Int) (|v_thrThread1of2ForFork0_~c~0#1_136| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_136|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1366) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_136| 4) c_~data~0.offset) v_ArrVal_1367) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (<= (+ 5 |c_thrThread2of2ForFork0_~c~0#1|) c_~next~0) (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 1) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:27,356 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 4) c_~next~0) (forall ((v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1367 Int) (|v_thrThread1of2ForFork0_~c~0#1_136| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_136|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1366) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_136| 4) c_~data~0.offset) v_ArrVal_1367) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 1) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:27,862 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1367 Int) (|v_thrThread1of2ForFork0_~c~0#1_136| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_136|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1366) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_136| 4) c_~data~0.offset) v_ArrVal_1367) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= (+ 3 |c_thrThread2of2ForFork0_~c~0#1|) c_~next~0) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 1) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:28,419 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1367 Int) (|v_thrThread1of2ForFork0_~c~0#1_136| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_136|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1366) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_136| 4) c_~data~0.offset) v_ArrVal_1367) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= (+ 2 |c_thrThread2of2ForFork0_~c~0#1|) c_~next~0) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 1) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:28,936 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1367 Int) (|v_thrThread1of2ForFork0_~c~0#1_136| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_136|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1366) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_136| 4) c_~data~0.offset) v_ArrVal_1367) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 1) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:29,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:03:29,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:03:29,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 11:03:29,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-09 11:03:29,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-09 11:03:29,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-09 11:03:29,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:03:29,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:03:29,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states. [2022-02-09 11:03:29,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:03:29,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2022-02-09 11:03:29,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-02-09 11:03:29,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-02-09 11:03:29,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 11:03:29,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-02-09 11:03:29,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-02-09 11:03:29,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-02-09 11:03:29,307 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,SelfDestructingSolverStorable17 [2022-02-09 11:03:29,308 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 11:03:29,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 11:03:29,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1381090954, now seen corresponding path program 3 times [2022-02-09 11:03:29,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 11:03:29,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543267042] [2022-02-09 11:03:29,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 11:03:29,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 11:03:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:03:29,478 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 531 proven. 109 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-09 11:03:29,479 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 11:03:29,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543267042] [2022-02-09 11:03:29,479 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543267042] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 11:03:29,479 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878055847] [2022-02-09 11:03:29,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-09 11:03:29,479 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 11:03:29,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 11:03:29,484 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 11:03:29,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-02-09 11:03:29,635 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-09 11:03:29,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 11:03:29,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-09 11:03:29,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 11:03:29,662 INFO L387 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 [2022-02-09 11:03:29,693 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-09 11:03:29,694 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-09 11:03:30,271 INFO L387 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 [2022-02-09 11:03:30,323 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 11:03:30,399 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-09 11:03:30,399 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-09 11:03:30,415 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-02-09 11:03:30,459 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 10 proven. 80 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2022-02-09 11:03:30,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 11:03:32,529 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int)) (or (forall ((v_ArrVal_1485 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1485) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) is different from false [2022-02-09 11:03:32,567 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1485 Int) (v_ArrVal_1484 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1484) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1485) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) is different from false [2022-02-09 11:03:32,620 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 11:03:32,621 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-02-09 11:03:32,623 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-02-09 11:03:32,627 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-02-09 11:03:32,631 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-02-09 11:03:33,200 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 555 trivial. 10 not checked. [2022-02-09 11:03:33,201 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878055847] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 11:03:33,201 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 11:03:33,201 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 31 [2022-02-09 11:03:33,201 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332875669] [2022-02-09 11:03:33,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 11:03:33,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-02-09 11:03:33,202 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 11:03:33,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-02-09 11:03:33,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=702, Unknown=2, NotChecked=110, Total=930 [2022-02-09 11:03:33,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:03:33,203 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 11:03:33,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 10.419354838709678) internal successors, (323), 31 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 11:03:33,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:03:33,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:03:33,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 11:03:33,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-02-09 11:03:33,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-02-09 11:03:33,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-02-09 11:03:33,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:03:33,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:03:33,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 229 states. [2022-02-09 11:03:33,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:03:33,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 219 states. [2022-02-09 11:03:33,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states. [2022-02-09 11:03:33,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 116 states. [2022-02-09 11:03:33,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 11:03:33,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-02-09 11:03:33,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2022-02-09 11:03:33,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:03:33,842 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1485 Int) (v_ArrVal_1484 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1484) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1485) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) (= |c_thrThread2of2ForFork0_~c~0#1| 0) (< |c_thrThread2of2ForFork0_~c~0#1| c_~next~0) (<= |c_thrThread2of2ForFork0_~end~0#1| 10) (<= |c_thrThread2of2ForFork0_~end~0#1| c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:34,249 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1485 Int) (v_ArrVal_1484 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1484) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1485) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) (< |c_thrThread2of2ForFork0_~c~0#1| c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:34,833 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_thrThread2of2ForFork0_~end~0#1| (+ 9 |c_thrThread2of2ForFork0_~c~0#1|)) (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1485 Int) (v_ArrVal_1484 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1484) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1485) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) (< |c_thrThread2of2ForFork0_~c~0#1| c_~next~0) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread2of2ForFork0_~end~0#1| c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:35,406 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1485 Int) (v_ArrVal_1484 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1484) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1485) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) (< |c_thrThread2of2ForFork0_~c~0#1| c_~next~0) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread2of2ForFork0_~end~0#1| c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= |c_thrThread2of2ForFork0_~end~0#1| (+ 8 |c_thrThread2of2ForFork0_~c~0#1|)) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:35,976 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1485 Int) (v_ArrVal_1484 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1484) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1485) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) (< |c_thrThread2of2ForFork0_~c~0#1| c_~next~0) (<= |c_thrThread2of2ForFork0_~end~0#1| (+ 7 |c_thrThread2of2ForFork0_~c~0#1|)) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread2of2ForFork0_~end~0#1| c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:36,556 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1485 Int) (v_ArrVal_1484 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1484) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1485) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) (< |c_thrThread2of2ForFork0_~c~0#1| c_~next~0) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread2of2ForFork0_~end~0#1| c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= |c_thrThread2of2ForFork0_~end~0#1| (+ 6 |c_thrThread2of2ForFork0_~c~0#1|)) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:37,203 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_thrThread2of2ForFork0_~end~0#1| (+ 5 |c_thrThread2of2ForFork0_~c~0#1|)) (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1485 Int) (v_ArrVal_1484 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1484) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1485) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) (< |c_thrThread2of2ForFork0_~c~0#1| c_~next~0) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread2of2ForFork0_~end~0#1| c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:37,779 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1485 Int) (v_ArrVal_1484 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1484) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1485) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) (< |c_thrThread2of2ForFork0_~c~0#1| c_~next~0) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread2of2ForFork0_~end~0#1| c_~next~0) (<= |c_thrThread2of2ForFork0_~end~0#1| (+ |c_thrThread2of2ForFork0_~c~0#1| 4)) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:38,384 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1485 Int) (v_ArrVal_1484 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1484) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1485) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) (< |c_thrThread2of2ForFork0_~c~0#1| c_~next~0) (<= |c_thrThread2of2ForFork0_~end~0#1| (+ 3 |c_thrThread2of2ForFork0_~c~0#1|)) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread2of2ForFork0_~end~0#1| c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:38,972 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_thrThread2of2ForFork0_~end~0#1| (+ 2 |c_thrThread2of2ForFork0_~c~0#1|)) (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1485 Int) (v_ArrVal_1484 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1484) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1485) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) (< |c_thrThread2of2ForFork0_~c~0#1| c_~next~0) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread2of2ForFork0_~end~0#1| c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:39,585 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_thrThread2of2ForFork0_~end~0#1| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)) (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1485 Int) (v_ArrVal_1484 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1484) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1485) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) (< |c_thrThread2of2ForFork0_~c~0#1| c_~next~0) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread2of2ForFork0_~end~0#1| c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= 1 |c_thrThread2of2ForFork0___VERIFIER_assert_~cond#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:41,797 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_136| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_136|)) (forall ((v_ArrVal_1367 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_136| 4) c_~data~0.offset) v_ArrVal_1367) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 1) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:43,800 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_thrThread2of2ForFork0_~c~0#1| c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int)) (or (forall ((v_ArrVal_1485 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1485) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:03:45,804 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_136| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_136|)) (forall ((v_ArrVal_1367 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_136| 4) c_~data~0.offset) v_ArrVal_1367) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 1) c_~next~0)) is different from false [2022-02-09 11:03:47,806 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_thrThread2of2ForFork0_~c~0#1| c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int)) (or (forall ((v_ArrVal_1485 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1485) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|))))) is different from false [2022-02-09 11:03:47,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:03:47,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:03:47,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 11:03:47,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-09 11:03:47,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-09 11:03:47,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-09 11:03:47,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:03:47,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:03:47,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states. [2022-02-09 11:03:47,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:03:47,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2022-02-09 11:03:47,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-02-09 11:03:47,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-02-09 11:03:47,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 11:03:47,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-02-09 11:03:47,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-02-09 11:03:47,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-02-09 11:03:47,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-02-09 11:03:48,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 11:03:48,117 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 11:03:48,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 11:03:48,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1549144161, now seen corresponding path program 1 times [2022-02-09 11:03:48,118 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 11:03:48,118 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299915741] [2022-02-09 11:03:48,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 11:03:48,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 11:03:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:03:48,230 INFO L134 CoverageAnalysis]: Checked inductivity of 608 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2022-02-09 11:03:48,230 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 11:03:48,230 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299915741] [2022-02-09 11:03:48,230 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299915741] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 11:03:48,231 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 11:03:48,231 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-09 11:03:48,231 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447263579] [2022-02-09 11:03:48,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 11:03:48,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-09 11:03:48,231 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 11:03:48,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-09 11:03:48,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-09 11:03:48,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:03:48,232 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 11:03:48,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 11:03:48,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:03:48,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:03:48,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 11:03:48,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-02-09 11:03:48,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-02-09 11:03:48,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-02-09 11:03:48,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:03:48,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:03:48,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 229 states. [2022-02-09 11:03:48,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:03:48,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 219 states. [2022-02-09 11:03:48,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states. [2022-02-09 11:03:48,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 116 states. [2022-02-09 11:03:48,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 11:03:48,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-02-09 11:03:48,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 71 states. [2022-02-09 11:03:48,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2022-02-09 11:03:48,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:03:48,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:03:48,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:03:48,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 11:03:48,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-09 11:03:48,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-09 11:03:48,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-09 11:03:48,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:03:48,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:03:48,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states. [2022-02-09 11:03:48,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:03:48,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2022-02-09 11:03:48,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-02-09 11:03:48,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-02-09 11:03:48,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 11:03:48,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-02-09 11:03:48,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-02-09 11:03:48,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-02-09 11:03:48,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:03:48,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-09 11:03:48,313 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 11:03:48,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 11:03:48,314 INFO L85 PathProgramCache]: Analyzing trace with hash -76019294, now seen corresponding path program 4 times [2022-02-09 11:03:48,314 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 11:03:48,314 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050406343] [2022-02-09 11:03:48,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 11:03:48,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 11:03:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:03:48,573 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 0 proven. 521 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-09 11:03:48,574 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 11:03:48,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050406343] [2022-02-09 11:03:48,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050406343] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 11:03:48,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544444603] [2022-02-09 11:03:48,574 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-09 11:03:48,574 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 11:03:48,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 11:03:48,575 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 11:03:48,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-02-09 11:03:48,757 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-09 11:03:48,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 11:03:48,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-09 11:03:48,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 11:03:49,059 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-09 11:03:49,145 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-09 11:03:49,146 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-09 11:03:49,152 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-02-09 11:03:49,184 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 8 proven. 513 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-09 11:03:49,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 11:03:49,520 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 8 proven. 513 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-09 11:03:49,520 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544444603] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 11:03:49,521 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 11:03:49,521 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 27 [2022-02-09 11:03:49,521 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469869081] [2022-02-09 11:03:49,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 11:03:49,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-09 11:03:49,521 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 11:03:49,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-09 11:03:49,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=574, Unknown=0, NotChecked=0, Total=702 [2022-02-09 11:03:49,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:03:49,522 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 11:03:49,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 9.74074074074074) internal successors, (263), 27 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 11:03:49,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:03:49,522 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:03:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 11:03:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-02-09 11:03:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-02-09 11:03:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-02-09 11:03:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:03:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:03:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 229 states. [2022-02-09 11:03:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:03:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 219 states. [2022-02-09 11:03:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states. [2022-02-09 11:03:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 116 states. [2022-02-09 11:03:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 11:03:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-02-09 11:03:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 71 states. [2022-02-09 11:03:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2022-02-09 11:03:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:03:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:03:51,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:03:51,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:03:51,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 11:03:51,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-09 11:03:51,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-09 11:03:51,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-09 11:03:51,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:03:51,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:03:51,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 234 states. [2022-02-09 11:03:51,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:03:51,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 225 states. [2022-02-09 11:03:51,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-02-09 11:03:51,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-02-09 11:03:51,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 11:03:51,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-02-09 11:03:51,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-02-09 11:03:51,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-02-09 11:03:51,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:03:51,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-02-09 11:03:51,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-02-09 11:03:52,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 11:03:52,033 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 11:03:52,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 11:03:52,034 INFO L85 PathProgramCache]: Analyzing trace with hash 244179958, now seen corresponding path program 7 times [2022-02-09 11:03:52,034 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 11:03:52,034 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411176710] [2022-02-09 11:03:52,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 11:03:52,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 11:03:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:03:52,336 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 525 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-09 11:03:52,336 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 11:03:52,336 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411176710] [2022-02-09 11:03:52,336 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411176710] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 11:03:52,336 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700248264] [2022-02-09 11:03:52,336 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-09 11:03:52,336 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 11:03:52,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 11:03:52,338 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 11:03:52,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-02-09 11:03:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:03:52,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 29 conjunts are in the unsatisfiable core [2022-02-09 11:03:52,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 11:03:52,862 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-09 11:03:52,876 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-09 11:03:52,876 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-09 11:03:53,132 INFO L353 Elim1Store]: treesize reduction 88, result has 20.7 percent of original size [2022-02-09 11:03:53,133 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 40 [2022-02-09 11:03:53,172 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-02-09 11:03:53,172 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2022-02-09 11:03:53,213 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 12 proven. 513 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-09 11:03:53,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 11:03:53,374 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2022-02-09 11:03:53,700 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 10 proven. 515 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-09 11:03:53,700 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700248264] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 11:03:53,700 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 11:03:53,701 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 35 [2022-02-09 11:03:53,701 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225747531] [2022-02-09 11:03:53,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 11:03:53,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-02-09 11:03:53,701 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 11:03:53,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-02-09 11:03:53,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1008, Unknown=0, NotChecked=0, Total=1190 [2022-02-09 11:03:53,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:03:53,702 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 11:03:53,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 9.342857142857143) internal successors, (327), 35 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 11:03:53,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:03:53,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:03:53,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 11:03:53,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-02-09 11:03:53,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-02-09 11:03:53,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-02-09 11:03:53,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:03:53,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:03:53,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 234 states. [2022-02-09 11:03:53,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:03:53,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 225 states. [2022-02-09 11:03:53,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states. [2022-02-09 11:03:53,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 121 states. [2022-02-09 11:03:53,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 11:03:53,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-02-09 11:03:53,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2022-02-09 11:03:53,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 88 states. [2022-02-09 11:03:53,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:03:53,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2022-02-09 11:03:53,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:03:56,787 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_132| Int)) (or (forall ((v_ArrVal_1257 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_132| 4) c_~data~0.offset) v_ArrVal_1257) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_132|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:04:00,500 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_132| Int)) (or (forall ((v_ArrVal_1257 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_132| 4) c_~data~0.offset) v_ArrVal_1257) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_132|)))) (<= (+ 6 |c_thrThread2of2ForFork0_~c~0#1|) c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:04:02,515 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_132| Int)) (or (forall ((v_ArrVal_1257 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_132| 4) c_~data~0.offset) v_ArrVal_1257) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_132|)))) (<= (+ 6 |c_thrThread2of2ForFork0_~c~0#1|) c_~next~0) (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)))) is different from false [2022-02-09 11:04:07,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:07,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:04:07,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 11:04:07,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-09 11:04:07,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-09 11:04:07,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-09 11:04:07,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:04:07,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:04:07,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 239 states. [2022-02-09 11:04:07,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:04:07,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states. [2022-02-09 11:04:07,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-02-09 11:04:07,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-02-09 11:04:07,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 11:04:07,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-02-09 11:04:07,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-02-09 11:04:07,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-02-09 11:04:07,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:04:07,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-02-09 11:04:07,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-02-09 11:04:07,585 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-09 11:04:07,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-02-09 11:04:07,799 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,SelfDestructingSolverStorable21 [2022-02-09 11:04:07,802 INFO L732 BasicCegarLoop]: Path program histogram: [7, 4, 3, 1, 1, 1, 1, 1, 1] [2022-02-09 11:04:07,802 INFO L309 ceAbstractionStarter]: Result for error location thrThread2of2ForFork0 was SAFE (1/3) [2022-02-09 11:04:07,804 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-09 11:04:07,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 11:04:07,806 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-02-09 11:04:07,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (18)] Waiting until timeout for monitored process [2022-02-09 11:04:07,811 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thrThread1of2ForFork0 ======== [2022-02-09 11:04:07,812 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mLazyFiniteAutomaton=true, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-09 11:04:07,812 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-09 11:04:07,925 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 11:04:07,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 11:04:07,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1314986904, now seen corresponding path program 1 times [2022-02-09 11:04:07,925 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 11:04:07,926 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258224062] [2022-02-09 11:04:07,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 11:04:07,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 11:04:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:04:07,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 11:04:07,938 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 11:04:07,938 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258224062] [2022-02-09 11:04:07,938 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258224062] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 11:04:07,938 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 11:04:07,938 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-09 11:04:07,938 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289253168] [2022-02-09 11:04:07,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 11:04:07,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-09 11:04:07,939 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 11:04:07,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-09 11:04:07,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-09 11:04:07,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:07,939 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 11:04:07,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 11:04:07,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:07,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:07,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-09 11:04:07,943 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 11:04:07,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 11:04:07,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1543138609, now seen corresponding path program 1 times [2022-02-09 11:04:07,943 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 11:04:07,943 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534215129] [2022-02-09 11:04:07,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 11:04:07,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 11:04:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:04:07,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 11:04:07,977 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 11:04:07,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534215129] [2022-02-09 11:04:07,977 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534215129] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 11:04:07,977 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 11:04:07,977 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-09 11:04:07,977 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541798575] [2022-02-09 11:04:07,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 11:04:07,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 11:04:07,978 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 11:04:07,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 11:04:07,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-09 11:04:07,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:07,978 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 11:04:07,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 11:04:07,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:07,979 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:08,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:08,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 11:04:08,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-09 11:04:08,054 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 11:04:08,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 11:04:08,055 INFO L85 PathProgramCache]: Analyzing trace with hash -216175272, now seen corresponding path program 1 times [2022-02-09 11:04:08,055 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 11:04:08,055 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142893687] [2022-02-09 11:04:08,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 11:04:08,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 11:04:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:04:08,132 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-09 11:04:08,132 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 11:04:08,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142893687] [2022-02-09 11:04:08,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142893687] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 11:04:08,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461030837] [2022-02-09 11:04:08,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 11:04:08,132 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 11:04:08,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 11:04:08,134 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) [2022-02-09 11:04:08,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-02-09 11:04:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:04:08,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-09 11:04:08,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 11:04:08,338 INFO L387 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 [2022-02-09 11:04:08,362 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-09 11:04:08,362 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-09 11:04:08,423 INFO L387 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 [2022-02-09 11:04:08,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 11:04:08,454 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-02-09 11:04:08,476 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-09 11:04:08,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 11:04:08,499 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1832 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1832) c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) is different from false [2022-02-09 11:04:08,515 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 11:04:08,515 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-02-09 11:04:08,517 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2022-02-09 11:04:08,618 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked. [2022-02-09 11:04:08,618 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461030837] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 11:04:08,619 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 11:04:08,619 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 14 [2022-02-09 11:04:08,619 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898759521] [2022-02-09 11:04:08,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 11:04:08,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-09 11:04:08,620 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 11:04:08,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-09 11:04:08,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=129, Unknown=1, NotChecked=22, Total=182 [2022-02-09 11:04:08,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:08,621 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 11:04:08,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.428571428571429) internal successors, (104), 14 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) [2022-02-09 11:04:08,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:08,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 11:04:08,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:08,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:08,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-09 11:04:08,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-09 11:04:08,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-02-09 11:04:09,079 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 [2022-02-09 11:04:09,080 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 11:04:09,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 11:04:09,080 INFO L85 PathProgramCache]: Analyzing trace with hash -967143089, now seen corresponding path program 1 times [2022-02-09 11:04:09,080 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 11:04:09,080 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934339673] [2022-02-09 11:04:09,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 11:04:09,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 11:04:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:04:09,331 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 11:04:09,332 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 11:04:09,332 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934339673] [2022-02-09 11:04:09,332 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934339673] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 11:04:09,332 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36312018] [2022-02-09 11:04:09,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 11:04:09,332 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 11:04:09,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 11:04:09,333 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) [2022-02-09 11:04:09,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-02-09 11:04:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:04:09,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-09 11:04:09,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 11:04:09,572 INFO L387 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 [2022-02-09 11:04:09,595 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-09 11:04:09,595 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-09 11:04:09,854 INFO L387 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 [2022-02-09 11:04:09,903 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 11:04:10,002 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-09 11:04:10,003 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-09 11:04:10,009 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-02-09 11:04:10,050 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 9 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 11:04:10,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 11:04:12,287 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_160| Int)) (or (forall ((v_ArrVal_1894 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_160|) c_~data~0.offset) v_ArrVal_1894) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_160|)))) is different from false [2022-02-09 11:04:12,374 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_160| Int) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1894 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1892) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_160|) c_~data~0.offset) v_ArrVal_1894) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_160|)))) is different from false [2022-02-09 11:04:12,432 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 11:04:12,432 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-02-09 11:04:12,434 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-02-09 11:04:12,440 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-02-09 11:04:12,445 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-02-09 11:04:12,868 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 4 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-02-09 11:04:12,868 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36312018] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 11:04:12,868 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 11:04:12,868 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-02-09 11:04:12,868 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011118529] [2022-02-09 11:04:12,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 11:04:12,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-02-09 11:04:12,869 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 11:04:12,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-02-09 11:04:12,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=962, Unknown=2, NotChecked=130, Total=1260 [2022-02-09 11:04:12,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:12,870 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 11:04:12,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.416666666666667) internal successors, (267), 36 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) [2022-02-09 11:04:12,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:12,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-02-09 11:04:12,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-02-09 11:04:12,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:13,421 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_160| Int) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1894 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1892) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_160|) c_~data~0.offset) v_ArrVal_1894) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_160|)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 10 c_~next~0) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (<= 10 |c_thrThread1of2ForFork0_~end~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:04:13,841 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_160| Int) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1894 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1892) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_160|) c_~data~0.offset) v_ArrVal_1894) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_160|)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (<= (+ 9 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:04:14,341 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_160| Int) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1894 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1892) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_160|) c_~data~0.offset) v_ArrVal_1894) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_160|)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (<= (+ 9 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:04:14,810 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_160| Int) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1894 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1892) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_160|) c_~data~0.offset) v_ArrVal_1894) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_160|)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (<= (+ 8 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:04:15,228 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_160| Int) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1894 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1892) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_160|) c_~data~0.offset) v_ArrVal_1894) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_160|)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:04:15,685 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_160| Int) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1894 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1892) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_160|) c_~data~0.offset) v_ArrVal_1894) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_160|)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:04:16,218 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_160| Int) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1894 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1892) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_160|) c_~data~0.offset) v_ArrVal_1894) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_160|)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (< (+ 2 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:04:16,653 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_160| Int) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1894 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1892) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_160|) c_~data~0.offset) v_ArrVal_1894) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_160|)))) (< (+ 2 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:04:17,127 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_160| Int) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1894 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1892) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_160|) c_~data~0.offset) v_ArrVal_1894) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_160|)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (< (+ |c_thrThread1of2ForFork0_~c~0#1| 1) c_~next~0) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:04:17,609 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_160| Int) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1894 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1892) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_160|) c_~data~0.offset) v_ArrVal_1894) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_160|)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (not (<= c_~next~0 |c_thrThread1of2ForFork0_~c~0#1|)) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:04:17,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:17,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-09 11:04:17,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-09 11:04:17,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-02-09 11:04:17,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-02-09 11:04:18,059 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 [2022-02-09 11:04:18,060 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 11:04:18,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 11:04:18,060 INFO L85 PathProgramCache]: Analyzing trace with hash -389824699, now seen corresponding path program 2 times [2022-02-09 11:04:18,060 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 11:04:18,060 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061976887] [2022-02-09 11:04:18,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 11:04:18,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 11:04:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:04:18,430 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 11:04:18,431 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 11:04:18,431 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061976887] [2022-02-09 11:04:18,431 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061976887] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 11:04:18,431 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803993652] [2022-02-09 11:04:18,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-09 11:04:18,431 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 11:04:18,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 11:04:18,433 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) [2022-02-09 11:04:18,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-02-09 11:04:18,592 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-09 11:04:18,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 11:04:18,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 32 conjunts are in the unsatisfiable core [2022-02-09 11:04:18,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 11:04:18,623 INFO L387 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 [2022-02-09 11:04:18,645 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-09 11:04:18,645 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-09 11:04:19,169 INFO L387 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 [2022-02-09 11:04:19,212 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 11:04:19,301 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-09 11:04:19,301 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-09 11:04:19,310 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-02-09 11:04:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 9 proven. 519 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 11:04:19,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 11:04:19,476 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2002 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2002) c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= (+ |c_thrThread1of2ForFork0_~c~0#1| 1) c_~next~0)) is different from false [2022-02-09 11:04:19,510 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 11:04:19,511 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-02-09 11:04:19,513 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2022-02-09 11:04:19,516 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-02-09 11:04:20,174 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 4 proven. 513 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-02-09 11:04:20,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803993652] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 11:04:20,174 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 11:04:20,175 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 35 [2022-02-09 11:04:20,175 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212775268] [2022-02-09 11:04:20,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 11:04:20,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-02-09 11:04:20,175 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 11:04:20,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-02-09 11:04:20,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=958, Unknown=1, NotChecked=64, Total=1190 [2022-02-09 11:04:20,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:20,176 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 11:04:20,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 8.0) internal successors, (280), 35 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 11:04:20,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:20,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-09 11:04:20,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-02-09 11:04:20,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-02-09 11:04:20,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:21,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:21,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-09 11:04:21,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-09 11:04:21,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-02-09 11:04:21,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-02-09 11:04:21,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-02-09 11:04:21,614 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,SelfDestructingSolverStorable26 [2022-02-09 11:04:21,614 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 11:04:21,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 11:04:21,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1111430144, now seen corresponding path program 3 times [2022-02-09 11:04:21,615 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 11:04:21,615 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46100886] [2022-02-09 11:04:21,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 11:04:21,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 11:04:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:04:21,803 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 778 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-09 11:04:21,803 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 11:04:21,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46100886] [2022-02-09 11:04:21,804 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46100886] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 11:04:21,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993723173] [2022-02-09 11:04:21,804 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-09 11:04:21,804 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 11:04:21,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 11:04:21,808 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) [2022-02-09 11:04:21,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-02-09 11:04:21,968 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-09 11:04:21,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 11:04:21,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-09 11:04:21,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 11:04:21,993 INFO L387 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 [2022-02-09 11:04:22,022 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-09 11:04:22,022 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-09 11:04:22,618 INFO L387 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 [2022-02-09 11:04:22,677 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-09 11:04:22,779 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-09 11:04:22,780 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-09 11:04:22,798 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-02-09 11:04:22,844 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 9 proven. 102 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2022-02-09 11:04:22,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 11:04:24,923 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_168| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_168|)) (forall ((v_ArrVal_2137 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_168|) c_~data~0.offset) v_ArrVal_2137) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) is different from false [2022-02-09 11:04:25,020 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2136 (Array Int Int)) (v_ArrVal_2137 Int) (|v_thrThread2of2ForFork0_~c~0#1_168| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_168|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2136) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_168|) c_~data~0.offset) v_ArrVal_2137) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) is different from false [2022-02-09 11:04:25,082 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 11:04:25,083 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-02-09 11:04:25,086 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-02-09 11:04:25,091 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-02-09 11:04:25,097 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-02-09 11:04:25,868 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 4 proven. 96 refuted. 0 times theorem prover too weak. 804 trivial. 11 not checked. [2022-02-09 11:04:25,869 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993723173] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 11:04:25,869 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 11:04:25,869 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 33 [2022-02-09 11:04:25,869 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420944957] [2022-02-09 11:04:25,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 11:04:25,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-02-09 11:04:25,869 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 11:04:25,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-02-09 11:04:25,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=795, Unknown=2, NotChecked=118, Total=1056 [2022-02-09 11:04:25,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:25,870 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 11:04:25,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 10.969696969696969) internal successors, (362), 33 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 11:04:25,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:25,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-09 11:04:25,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-02-09 11:04:25,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-02-09 11:04:25,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2022-02-09 11:04:25,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:26,475 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= |c_thrThread1of2ForFork0_~end~0#1| c_~next~0) (<= |c_thrThread1of2ForFork0_~end~0#1| 10) (forall ((v_ArrVal_2136 (Array Int Int)) (v_ArrVal_2137 Int) (|v_thrThread2of2ForFork0_~c~0#1_168| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_168|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2136) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_168|) c_~data~0.offset) v_ArrVal_2137) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (= |c_thrThread1of2ForFork0_~c~0#1| 0) (< |c_thrThread1of2ForFork0_~c~0#1| c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:04:26,920 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= |c_thrThread1of2ForFork0_~end~0#1| c_~next~0) (forall ((v_ArrVal_2136 (Array Int Int)) (v_ArrVal_2137 Int) (|v_thrThread2of2ForFork0_~c~0#1_168| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_168|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2136) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_168|) c_~data~0.offset) v_ArrVal_2137) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (< |c_thrThread1of2ForFork0_~c~0#1| c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:04:27,476 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| c_~next~0) (forall ((v_ArrVal_2136 (Array Int Int)) (v_ArrVal_2137 Int) (|v_thrThread2of2ForFork0_~c~0#1_168| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_168|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2136) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_168|) c_~data~0.offset) v_ArrVal_2137) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ 9 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:04:27,981 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| c_~next~0) (forall ((v_ArrVal_2136 (Array Int Int)) (v_ArrVal_2137 Int) (|v_thrThread2of2ForFork0_~c~0#1_168| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_168|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2136) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_168|) c_~data~0.offset) v_ArrVal_2137) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ 8 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:04:28,495 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ 7 |c_thrThread1of2ForFork0_~c~0#1|)) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| c_~next~0) (forall ((v_ArrVal_2136 (Array Int Int)) (v_ArrVal_2137 Int) (|v_thrThread2of2ForFork0_~c~0#1_168| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_168|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2136) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_168|) c_~data~0.offset) v_ArrVal_2137) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (< |c_thrThread1of2ForFork0_~c~0#1| c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:04:29,006 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| c_~next~0) (forall ((v_ArrVal_2136 (Array Int Int)) (v_ArrVal_2137 Int) (|v_thrThread2of2ForFork0_~c~0#1_168| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_168|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2136) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_168|) c_~data~0.offset) v_ArrVal_2137) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ 6 |c_thrThread1of2ForFork0_~c~0#1|)) (< |c_thrThread1of2ForFork0_~c~0#1| c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:04:29,526 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ 5 |c_thrThread1of2ForFork0_~c~0#1|)) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| c_~next~0) (forall ((v_ArrVal_2136 (Array Int Int)) (v_ArrVal_2137 Int) (|v_thrThread2of2ForFork0_~c~0#1_168| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_168|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2136) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_168|) c_~data~0.offset) v_ArrVal_2137) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (< |c_thrThread1of2ForFork0_~c~0#1| c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:04:30,046 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| c_~next~0) (forall ((v_ArrVal_2136 (Array Int Int)) (v_ArrVal_2137 Int) (|v_thrThread2of2ForFork0_~c~0#1_168| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_168|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2136) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_168|) c_~data~0.offset) v_ArrVal_2137) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |c_thrThread1of2ForFork0_~c~0#1| 4)) (< |c_thrThread1of2ForFork0_~c~0#1| c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:04:30,569 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ 3 |c_thrThread1of2ForFork0_~c~0#1|)) (<= |c_thrThread1of2ForFork0_~end~0#1| c_~next~0) (forall ((v_ArrVal_2136 (Array Int Int)) (v_ArrVal_2137 Int) (|v_thrThread2of2ForFork0_~c~0#1_168| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_168|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2136) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_168|) c_~data~0.offset) v_ArrVal_2137) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (< |c_thrThread1of2ForFork0_~c~0#1| c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:04:31,117 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_thrThread1of2ForFork0_~end~0#1| (+ 2 |c_thrThread1of2ForFork0_~c~0#1|)) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| c_~next~0) (forall ((v_ArrVal_2136 (Array Int Int)) (v_ArrVal_2137 Int) (|v_thrThread2of2ForFork0_~c~0#1_168| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_168|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2136) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_168|) c_~data~0.offset) v_ArrVal_2137) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (< |c_thrThread1of2ForFork0_~c~0#1| c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:04:31,655 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| c_~next~0) (forall ((v_ArrVal_2136 (Array Int Int)) (v_ArrVal_2137 Int) (|v_thrThread2of2ForFork0_~c~0#1_168| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_168|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2136) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_168|) c_~data~0.offset) v_ArrVal_2137) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (< |c_thrThread1of2ForFork0_~c~0#1| c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:04:33,867 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (forall ((|v_thrThread2of2ForFork0_~c~0#1_168| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_168|)) (forall ((v_ArrVal_2137 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_168|) c_~data~0.offset) v_ArrVal_2137) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) (<= |c_thrThread1of2ForFork0_~end~0#1| c_~next~0) (< |c_thrThread1of2ForFork0_~c~0#1| c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:04:34,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:34,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-09 11:04:34,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-09 11:04:34,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-02-09 11:04:34,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-02-09 11:04:34,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-02-09 11:04:34,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-02-09 11:04:34,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-02-09 11:04:34,221 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 11:04:34,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 11:04:34,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1284615935, now seen corresponding path program 1 times [2022-02-09 11:04:34,222 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 11:04:34,222 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392400358] [2022-02-09 11:04:34,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 11:04:34,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 11:04:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:04:34,268 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2022-02-09 11:04:34,269 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 11:04:34,269 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392400358] [2022-02-09 11:04:34,269 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392400358] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 11:04:34,269 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 11:04:34,269 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-09 11:04:34,269 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963578571] [2022-02-09 11:04:34,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 11:04:34,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-09 11:04:34,270 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 11:04:34,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-09 11:04:34,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-09 11:04:34,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:34,270 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 11:04:34,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 11:04:34,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:34,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-09 11:04:34,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-02-09 11:04:34,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-02-09 11:04:34,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2022-02-09 11:04:34,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 76 states. [2022-02-09 11:04:34,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:34,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:34,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-09 11:04:34,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-09 11:04:34,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-02-09 11:04:34,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-02-09 11:04:34,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-02-09 11:04:34,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:04:34,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-02-09 11:04:34,661 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 11:04:34,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 11:04:34,661 INFO L85 PathProgramCache]: Analyzing trace with hash -441929258, now seen corresponding path program 1 times [2022-02-09 11:04:34,661 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 11:04:34,661 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654288870] [2022-02-09 11:04:34,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 11:04:34,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 11:04:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:04:34,960 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 524 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-09 11:04:34,960 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 11:04:34,961 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654288870] [2022-02-09 11:04:34,961 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654288870] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 11:04:34,961 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510135631] [2022-02-09 11:04:34,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 11:04:34,961 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 11:04:34,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 11:04:34,962 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) [2022-02-09 11:04:34,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-02-09 11:04:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:04:35,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 29 conjunts are in the unsatisfiable core [2022-02-09 11:04:35,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 11:04:35,506 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-09 11:04:35,522 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-09 11:04:35,522 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-09 11:04:35,647 INFO L353 Elim1Store]: treesize reduction 88, result has 20.7 percent of original size [2022-02-09 11:04:35,648 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 40 [2022-02-09 11:04:35,684 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-02-09 11:04:35,684 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2022-02-09 11:04:35,726 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 11 proven. 513 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-09 11:04:35,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 11:04:35,856 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2022-02-09 11:04:36,178 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 9 proven. 515 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-09 11:04:36,178 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510135631] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 11:04:36,178 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 11:04:36,178 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 35 [2022-02-09 11:04:36,178 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867324357] [2022-02-09 11:04:36,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 11:04:36,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-02-09 11:04:36,179 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 11:04:36,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-02-09 11:04:36,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1008, Unknown=0, NotChecked=0, Total=1190 [2022-02-09 11:04:36,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:36,180 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 11:04:36,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 9.228571428571428) internal successors, (323), 35 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 11:04:36,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:36,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-09 11:04:36,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-02-09 11:04:36,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-02-09 11:04:36,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2022-02-09 11:04:36,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2022-02-09 11:04:36,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:04:36,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:36,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:36,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-09 11:04:36,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-09 11:04:36,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-02-09 11:04:36,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-02-09 11:04:36,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-02-09 11:04:36,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:04:36,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-02-09 11:04:36,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-02-09 11:04:36,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 11:04:36,798 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 11:04:36,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 11:04:36,798 INFO L85 PathProgramCache]: Analyzing trace with hash 8575096, now seen corresponding path program 2 times [2022-02-09 11:04:36,798 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 11:04:36,799 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946171879] [2022-02-09 11:04:36,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 11:04:36,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 11:04:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:04:37,084 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 524 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-09 11:04:37,084 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 11:04:37,084 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946171879] [2022-02-09 11:04:37,084 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946171879] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 11:04:37,084 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353548375] [2022-02-09 11:04:37,085 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-09 11:04:37,085 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 11:04:37,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 11:04:37,086 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) [2022-02-09 11:04:37,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-02-09 11:04:37,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-09 11:04:37,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 11:04:37,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-09 11:04:37,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 11:04:37,653 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-09 11:04:37,714 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-09 11:04:37,714 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-09 11:04:37,719 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-02-09 11:04:37,757 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 11 proven. 513 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-09 11:04:37,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 11:04:38,169 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 9 proven. 515 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-09 11:04:38,170 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353548375] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 11:04:38,170 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 11:04:38,170 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 32 [2022-02-09 11:04:38,170 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829436512] [2022-02-09 11:04:38,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 11:04:38,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-02-09 11:04:38,171 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 11:04:38,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-02-09 11:04:38,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2022-02-09 11:04:38,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:38,172 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 11:04:38,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 9.78125) internal successors, (313), 32 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 11:04:38,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:38,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-09 11:04:38,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-02-09 11:04:38,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-02-09 11:04:38,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2022-02-09 11:04:38,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2022-02-09 11:04:38,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:04:38,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-02-09 11:04:38,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:42,575 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ 2 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_160| Int)) (or (forall ((v_ArrVal_1894 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_160|) c_~data~0.offset) v_ArrVal_1894) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_160|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:04:44,901 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (< (+ 2 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_160| Int)) (or (forall ((v_ArrVal_1894 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_160|) c_~data~0.offset) v_ArrVal_1894) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_160|)))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:04:47,654 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (forall ((|v_thrThread2of2ForFork0_~c~0#1_160| Int)) (or (forall ((v_ArrVal_1894 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_160|) c_~data~0.offset) v_ArrVal_1894) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_160|)))) (<= (+ 9 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:04:51,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:51,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-09 11:04:51,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:04:51,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-02-09 11:04:51,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-02-09 11:04:51,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-02-09 11:04:51,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:04:51,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-02-09 11:04:51,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2022-02-09 11:04:52,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-02-09 11:04:52,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 11:04:52,191 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 11:04:52,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 11:04:52,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1838239499, now seen corresponding path program 4 times [2022-02-09 11:04:52,192 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 11:04:52,192 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935560192] [2022-02-09 11:04:52,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 11:04:52,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 11:04:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:04:52,415 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 345 proven. 177 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-09 11:04:52,415 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 11:04:52,415 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935560192] [2022-02-09 11:04:52,416 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935560192] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 11:04:52,416 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354517859] [2022-02-09 11:04:52,416 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-09 11:04:52,416 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 11:04:52,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 11:04:52,417 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) [2022-02-09 11:04:52,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-02-09 11:04:52,594 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-09 11:04:52,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 11:04:52,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-09 11:04:52,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 11:04:52,826 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2022-02-09 11:04:52,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-09 11:04:52,827 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354517859] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 11:04:52,827 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-09 11:04:52,827 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [19] total 20 [2022-02-09 11:04:52,827 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547241801] [2022-02-09 11:04:52,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 11:04:52,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-09 11:04:52,827 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 11:04:52,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-09 11:04:52,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-02-09 11:04:52,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:52,828 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 11:04:52,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 11:04:52,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:52,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-09 11:04:52,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:04:52,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2022-02-09 11:04:52,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2022-02-09 11:04:52,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2022-02-09 11:04:52,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:04:52,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2022-02-09 11:04:52,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 132 states. [2022-02-09 11:04:52,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:53,806 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 10))) (and (forall ((|v_thrThread2of2ForFork0_~c~0#1_160| Int) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1894 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1892) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_160|) c_~data~0.offset) v_ArrVal_1894) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_160|)))) (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) c_~next~0) (<= .cse0 c_~next~0) (<= .cse0 |c_thrThread1of2ForFork0_~end~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base)))) is different from false [2022-02-09 11:04:54,269 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= |c_thrThread1of2ForFork0_~end~0#1| c_~next~0) (forall ((v_ArrVal_2136 (Array Int Int)) (v_ArrVal_2137 Int) (|v_thrThread2of2ForFork0_~c~0#1_168| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_168|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2136) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_168|) c_~data~0.offset) v_ArrVal_2137) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t~0#1.base|) 1) (< |c_thrThread1of2ForFork0_~c~0#1| c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:04:54,975 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_~cond#1|) (<= 1 |c_thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| c_~next~0) (forall ((v_ArrVal_2136 (Array Int Int)) (v_ArrVal_2137 Int) (|v_thrThread2of2ForFork0_~c~0#1_168| Int)) (or (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_168|)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2136) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_168|) c_~data~0.offset) v_ArrVal_2137) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (< |c_thrThread1of2ForFork0_~c~0#1| c_~next~0) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-09 11:04:55,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:55,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-09 11:04:55,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:04:55,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-02-09 11:04:55,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-02-09 11:04:55,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-02-09 11:04:55,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:04:55,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-02-09 11:04:55,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2022-02-09 11:04:55,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 11:04:55,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-02-09 11:04:55,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 11:04:55,419 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 11:04:55,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 11:04:55,420 INFO L85 PathProgramCache]: Analyzing trace with hash -2031707968, now seen corresponding path program 5 times [2022-02-09 11:04:55,420 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 11:04:55,420 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608357593] [2022-02-09 11:04:55,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 11:04:55,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 11:04:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:04:55,682 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 900 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-09 11:04:55,682 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 11:04:55,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608357593] [2022-02-09 11:04:55,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608357593] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 11:04:55,682 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 11:04:55,682 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-09 11:04:55,683 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253229939] [2022-02-09 11:04:55,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 11:04:55,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-09 11:04:55,683 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 11:04:55,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-09 11:04:55,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2022-02-09 11:04:55,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:55,684 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 11:04:55,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 14.25) internal successors, (228), 16 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 11:04:55,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:55,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-09 11:04:55,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:04:55,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2022-02-09 11:04:55,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2022-02-09 11:04:55,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 118 states. [2022-02-09 11:04:55,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:04:55,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2022-02-09 11:04:55,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 151 states. [2022-02-09 11:04:55,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 11:04:55,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:55,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:55,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-09 11:04:55,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:04:55,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-02-09 11:04:55,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-02-09 11:04:55,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-02-09 11:04:55,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:04:55,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-02-09 11:04:55,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2022-02-09 11:04:55,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 11:04:55,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:04:55,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-02-09 11:04:55,954 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 11:04:55,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 11:04:55,955 INFO L85 PathProgramCache]: Analyzing trace with hash -977844965, now seen corresponding path program 6 times [2022-02-09 11:04:55,955 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 11:04:55,955 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084056922] [2022-02-09 11:04:55,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 11:04:55,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 11:04:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:04:56,238 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 432 proven. 81 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-09 11:04:56,238 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 11:04:56,238 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084056922] [2022-02-09 11:04:56,238 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084056922] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 11:04:56,238 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729713543] [2022-02-09 11:04:56,238 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-09 11:04:56,239 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 11:04:56,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 11:04:56,240 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) [2022-02-09 11:04:56,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-02-09 11:04:56,579 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-02-09 11:04:56,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 11:04:56,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-09 11:04:56,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 11:04:56,995 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-09 11:04:57,031 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-09 11:04:57,031 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-09 11:04:57,036 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-02-09 11:04:57,068 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 459 proven. 54 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-09 11:04:57,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 11:04:57,517 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 432 proven. 81 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-09 11:04:57,517 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729713543] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 11:04:57,517 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 11:04:57,517 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 49 [2022-02-09 11:04:57,517 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692428380] [2022-02-09 11:04:57,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 11:04:57,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-02-09 11:04:57,518 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 11:04:57,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-02-09 11:04:57,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=490, Invalid=1862, Unknown=0, NotChecked=0, Total=2352 [2022-02-09 11:04:57,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:57,519 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 11:04:57,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 9.83673469387755) internal successors, (482), 49 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 11:04:57,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:57,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-09 11:04:57,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:04:57,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2022-02-09 11:04:57,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2022-02-09 11:04:57,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 118 states. [2022-02-09 11:04:57,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:04:57,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2022-02-09 11:04:57,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 155 states. [2022-02-09 11:04:57,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 11:04:57,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:04:57,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:59,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:04:59,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-09 11:04:59,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:04:59,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-02-09 11:04:59,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-02-09 11:04:59,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-02-09 11:04:59,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:04:59,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-02-09 11:04:59,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2022-02-09 11:04:59,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 11:04:59,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:04:59,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-02-09 11:04:59,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-02-09 11:04:59,783 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 [2022-02-09 11:04:59,783 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 11:04:59,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 11:04:59,784 INFO L85 PathProgramCache]: Analyzing trace with hash -201255048, now seen corresponding path program 3 times [2022-02-09 11:04:59,784 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 11:04:59,784 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125889027] [2022-02-09 11:04:59,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 11:04:59,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 11:04:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:04:59,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 615 proven. 121 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2022-02-09 11:04:59,997 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 11:04:59,997 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125889027] [2022-02-09 11:04:59,997 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125889027] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 11:04:59,997 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35406851] [2022-02-09 11:04:59,997 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-09 11:04:59,997 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 11:04:59,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 11:05:00,000 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) [2022-02-09 11:05:00,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-02-09 11:05:05,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-02-09 11:05:05,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 11:05:05,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-09 11:05:05,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 11:05:06,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 736 proven. 0 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2022-02-09 11:05:06,223 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-09 11:05:06,224 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35406851] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 11:05:06,224 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-09 11:05:06,224 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [16] total 18 [2022-02-09 11:05:06,224 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412097631] [2022-02-09 11:05:06,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 11:05:06,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-09 11:05:06,224 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 11:05:06,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-09 11:05:06,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-02-09 11:05:06,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:05:06,225 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 11:05:06,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 15.0) internal successors, (225), 15 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-09 11:05:06,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:05:06,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-09 11:05:06,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:05:06,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2022-02-09 11:05:06,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2022-02-09 11:05:06,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 118 states. [2022-02-09 11:05:06,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:05:06,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2022-02-09 11:05:06,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 155 states. [2022-02-09 11:05:06,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 11:05:06,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:05:06,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2022-02-09 11:05:06,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:05:07,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 11:05:07,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-09 11:05:07,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-09 11:05:07,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-02-09 11:05:07,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-02-09 11:05:07,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-02-09 11:05:07,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-09 11:05:07,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-02-09 11:05:07,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2022-02-09 11:05:07,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 11:05:07,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:05:07,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-02-09 11:05:07,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 11:05:07,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-02-09 11:05:07,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-02-09 11:05:07,434 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-09 11:05:07,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 11:05:07,434 INFO L85 PathProgramCache]: Analyzing trace with hash 2118196124, now seen corresponding path program 4 times [2022-02-09 11:05:07,434 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 11:05:07,435 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501580711] [2022-02-09 11:05:07,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 11:05:07,435 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 11:05:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 11:05:08,082 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 273 proven. 492 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-09 11:05:08,082 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 11:05:08,082 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501580711] [2022-02-09 11:05:08,082 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501580711] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 11:05:08,082 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602311798] [2022-02-09 11:05:08,082 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-09 11:05:08,082 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 11:05:08,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 11:05:08,084 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-09 11:05:08,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-02-09 11:05:08,299 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-09 11:05:08,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 11:05:08,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 83 conjunts are in the unsatisfiable core [2022-02-09 11:05:08,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 11:05:08,687 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-09 11:05:08,722 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-09 11:05:08,722 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-09 11:05:08,734 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-09 11:05:08,734 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-02-09 11:05:08,857 INFO L353 Elim1Store]: treesize reduction 80, result has 27.9 percent of original size [2022-02-09 11:05:08,858 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 48 [2022-02-09 11:05:08,925 INFO L353 Elim1Store]: treesize reduction 80, result has 27.9 percent of original size [2022-02-09 11:05:08,925 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 56 [2022-02-09 11:05:09,180 INFO L353 Elim1Store]: treesize reduction 80, result has 27.9 percent of original size [2022-02-09 11:05:09,181 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 60 [2022-02-09 11:05:09,238 INFO L353 Elim1Store]: treesize reduction 80, result has 27.9 percent of original size [2022-02-09 11:05:09,238 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 60 [2022-02-09 11:05:09,792 INFO L353 Elim1Store]: treesize reduction 128, result has 32.6 percent of original size [2022-02-09 11:05:09,793 INFO L387 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 61 treesize of output 94 [2022-02-09 11:05:10,267 INFO L353 Elim1Store]: treesize reduction 128, result has 32.6 percent of original size [2022-02-09 11:05:10,267 INFO L387 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 77 treesize of output 110 [2022-02-09 11:05:11,617 INFO L353 Elim1Store]: treesize reduction 192, result has 32.6 percent of original size [2022-02-09 11:05:11,617 INFO L387 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 72 treesize of output 128 [2022-02-09 11:05:12,763 INFO L353 Elim1Store]: treesize reduction 180, result has 36.8 percent of original size [2022-02-09 11:05:12,764 INFO L387 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 101 treesize of output 169 [2022-02-09 11:05:15,996 INFO L353 Elim1Store]: treesize reduction 272, result has 31.3 percent of original size [2022-02-09 11:05:15,997 INFO L387 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 83 treesize of output 162 [2022-02-09 11:05:18,703 INFO L353 Elim1Store]: treesize reduction 236, result has 40.4 percent of original size [2022-02-09 11:05:18,703 INFO L387 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 115 treesize of output 230 [2022-02-09 11:05:23,431 INFO L353 Elim1Store]: treesize reduction 368, result has 29.6 percent of original size [2022-02-09 11:05:23,432 INFO L387 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 94 treesize of output 196 [2022-02-09 11:05:29,813 INFO L353 Elim1Store]: treesize reduction 296, result has 43.4 percent of original size [2022-02-09 11:05:29,813 INFO L387 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 134 treesize of output 308 [2022-02-09 11:05:37,296 INFO L353 Elim1Store]: treesize reduction 480, result has 27.9 percent of original size [2022-02-09 11:05:37,296 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 105 treesize of output 230 [2022-02-09 11:05:54,319 INFO L353 Elim1Store]: treesize reduction 360, result has 45.9 percent of original size [2022-02-09 11:05:54,320 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 153 treesize of output 398 [2022-02-09 11:06:31,446 INFO L353 Elim1Store]: treesize reduction 608, result has 26.3 percent of original size [2022-02-09 11:06:31,447 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 116 treesize of output 264 [2022-02-09 11:07:35,801 INFO L353 Elim1Store]: treesize reduction 428, result has 48.1 percent of original size [2022-02-09 11:07:35,802 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 172 treesize of output 500 [2022-02-09 11:08:05,901 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-02-09 11:08:05,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2022-02-09 11:08:05,903 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-09 11:08:05,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-02-09 11:08:06,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-02-09 11:08:06,104 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:934) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 46 more [2022-02-09 11:08:06,107 INFO L158 Benchmark]: Toolchain (without parser) took 493366.88ms. Allocated memory was 192.9MB in the beginning and 1.0GB in the end (delta: 831.5MB). Free memory was 142.7MB in the beginning and 389.4MB in the end (delta: -246.8MB). Peak memory consumption was 585.5MB. Max. memory is 8.0GB. [2022-02-09 11:08:06,107 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 192.9MB. Free memory is still 161.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-09 11:08:06,107 INFO L158 Benchmark]: CACSL2BoogieTranslator took 532.16ms. Allocated memory is still 192.9MB. Free memory was 142.5MB in the beginning and 154.9MB in the end (delta: -12.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-02-09 11:08:06,107 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.68ms. Allocated memory is still 192.9MB. Free memory was 154.9MB in the beginning and 152.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-09 11:08:06,108 INFO L158 Benchmark]: Boogie Preprocessor took 23.14ms. Allocated memory is still 192.9MB. Free memory was 152.3MB in the beginning and 150.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-09 11:08:06,108 INFO L158 Benchmark]: RCFGBuilder took 405.49ms. Allocated memory is still 192.9MB. Free memory was 150.7MB in the beginning and 137.1MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-02-09 11:08:06,108 INFO L158 Benchmark]: TraceAbstraction took 492360.07ms. Allocated memory was 192.9MB in the beginning and 1.0GB in the end (delta: 831.5MB). Free memory was 136.6MB in the beginning and 389.4MB in the end (delta: -252.8MB). Peak memory consumption was 580.3MB. Max. memory is 8.0GB. [2022-02-09 11:08:06,109 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.13ms. Allocated memory is still 192.9MB. Free memory is still 161.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 532.16ms. Allocated memory is still 192.9MB. Free memory was 142.5MB in the beginning and 154.9MB in the end (delta: -12.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.68ms. Allocated memory is still 192.9MB. Free memory was 154.9MB in the beginning and 152.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.14ms. Allocated memory is still 192.9MB. Free memory was 152.3MB in the beginning and 150.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 405.49ms. Allocated memory is still 192.9MB. Free memory was 150.7MB in the beginning and 137.1MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 492360.07ms. Allocated memory was 192.9MB in the beginning and 1.0GB in the end (delta: 831.5MB). Free memory was 136.6MB in the beginning and 389.4MB in the end (delta: -252.8MB). Peak memory consumption was 580.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 317, positive: 313, positive conditional: 16, positive unconditional: 297, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 315, positive: 313, positive conditional: 16, positive unconditional: 297, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 315, positive: 313, positive conditional: 16, positive unconditional: 297, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 315, positive: 313, positive conditional: 0, positive unconditional: 313, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 315, positive: 313, positive conditional: 0, positive unconditional: 313, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 315, positive: 313, positive conditional: 0, positive unconditional: 313, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 289, positive: 287, positive conditional: 0, positive unconditional: 287, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 289, positive: 286, positive conditional: 0, positive unconditional: 286, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 315, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 289, unknown conditional: 0, unknown unconditional: 289] , Statistics on independence cache: Total cache size (in pairs): 289, Positive cache size: 287, Positive conditional cache size: 0, Positive unconditional cache size: 287, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 2 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 47, Number of trivial persistent sets: 42, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 299, positive: 297, positive conditional: 0, positive unconditional: 297, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 317, positive: 313, positive conditional: 16, positive unconditional: 297, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 315, positive: 313, positive conditional: 16, positive unconditional: 297, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 315, positive: 313, positive conditional: 16, positive unconditional: 297, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 315, positive: 313, positive conditional: 0, positive unconditional: 313, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 315, positive: 313, positive conditional: 0, positive unconditional: 313, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 315, positive: 313, positive conditional: 0, positive unconditional: 313, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 289, positive: 287, positive conditional: 0, positive unconditional: 287, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 289, positive: 286, positive conditional: 0, positive unconditional: 286, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 315, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 289, unknown conditional: 0, unknown unconditional: 289] , Statistics on independence cache: Total cache size (in pairs): 289, Positive cache size: 287, Positive conditional cache size: 0, Positive unconditional cache size: 287, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 2 - 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: 299732, positive: 272280, positive conditional: 266377, positive unconditional: 5903, negative: 27452, negative conditional: 27370, negative unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 272758, positive: 272280, positive conditional: 266377, positive unconditional: 5903, negative: 478, negative conditional: 396, negative unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 272758, positive: 272280, positive conditional: 266377, positive unconditional: 5903, negative: 478, negative conditional: 396, negative unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 279777, positive: 272280, positive conditional: 266208, positive unconditional: 6072, negative: 7497, negative conditional: 7019, negative unconditional: 478, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 279777, positive: 272280, positive conditional: 150418, positive unconditional: 121862, negative: 7497, negative conditional: 4012, negative unconditional: 3485, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 279777, positive: 272280, positive conditional: 150418, positive unconditional: 121862, negative: 7497, negative conditional: 4012, negative unconditional: 3485, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5735, positive: 5178, positive conditional: 828, positive unconditional: 4350, negative: 557, negative conditional: 474, negative unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5735, positive: 4407, positive conditional: 0, positive unconditional: 4407, negative: 1328, negative conditional: 0, negative unconditional: 1328, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1328, positive: 771, positive conditional: 723, positive unconditional: 48, negative: 528, negative conditional: 445, negative unconditional: 83, unknown: 29, unknown conditional: 29, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2113, positive: 1206, positive conditional: 1093, positive unconditional: 113, negative: 826, negative conditional: 679, negative unconditional: 146, unknown: 81, unknown conditional: 81, unknown unconditional: 0] ], Cache Queries: [ total: 279777, positive: 267102, positive conditional: 149590, positive unconditional: 117512, negative: 6940, negative conditional: 3538, negative unconditional: 3402, unknown: 5735, unknown conditional: 1302, unknown unconditional: 4433] , Statistics on independence cache: Total cache size (in pairs): 5735, Positive cache size: 5178, Positive conditional cache size: 828, Positive unconditional cache size: 4350, Negative cache size: 557, Negative conditional cache size: 474, Negative unconditional cache size: 83, Eliminated conditions: 118797, Maximal queried relation: 15, Independence queries for same thread: 26974 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.5s, Number of persistent set computation: 3261, Number of trivial persistent sets: 1606, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5985, positive: 5903, positive conditional: 0, positive unconditional: 5903, negative: 82, negative conditional: 0, negative unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 299732, positive: 272280, positive conditional: 266377, positive unconditional: 5903, negative: 27452, negative conditional: 27370, negative unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 272758, positive: 272280, positive conditional: 266377, positive unconditional: 5903, negative: 478, negative conditional: 396, negative unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 272758, positive: 272280, positive conditional: 266377, positive unconditional: 5903, negative: 478, negative conditional: 396, negative unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 279777, positive: 272280, positive conditional: 266208, positive unconditional: 6072, negative: 7497, negative conditional: 7019, negative unconditional: 478, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 279777, positive: 272280, positive conditional: 150418, positive unconditional: 121862, negative: 7497, negative conditional: 4012, negative unconditional: 3485, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 279777, positive: 272280, positive conditional: 150418, positive unconditional: 121862, negative: 7497, negative conditional: 4012, negative unconditional: 3485, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5735, positive: 5178, positive conditional: 828, positive unconditional: 4350, negative: 557, negative conditional: 474, negative unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5735, positive: 4407, positive conditional: 0, positive unconditional: 4407, negative: 1328, negative conditional: 0, negative unconditional: 1328, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1328, positive: 771, positive conditional: 723, positive unconditional: 48, negative: 528, negative conditional: 445, negative unconditional: 83, unknown: 29, unknown conditional: 29, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2113, positive: 1206, positive conditional: 1093, positive unconditional: 113, negative: 826, negative conditional: 679, negative unconditional: 146, unknown: 81, unknown conditional: 81, unknown unconditional: 0] ], Cache Queries: [ total: 279777, positive: 267102, positive conditional: 149590, positive unconditional: 117512, negative: 6940, negative conditional: 3538, negative unconditional: 3402, unknown: 5735, unknown conditional: 1302, unknown unconditional: 4433] , Statistics on independence cache: Total cache size (in pairs): 5735, Positive cache size: 5178, Positive conditional cache size: 828, Positive unconditional cache size: 4350, Negative cache size: 557, Negative conditional cache size: 474, Negative unconditional cache size: 83, Eliminated conditions: 118797, Maximal queried relation: 15, Independence queries for same thread: 26974 - 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 - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-09 11:08:06,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (18)] Ended with exit code 0 [2022-02-09 11:08:06,333 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 [2022-02-09 11:08:06,533 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 Received shutdown request...