/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-NewStatesSleepPersistent-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-lit/sssc12_variant.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.abstract-por-f0ea240 [2022-02-11 02:39:14,631 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-11 02:39:14,633 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-11 02:39:14,673 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-11 02:39:14,674 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-11 02:39:14,674 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-11 02:39:14,675 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-11 02:39:14,677 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-11 02:39:14,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-11 02:39:14,678 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-11 02:39:14,680 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-11 02:39:14,684 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-11 02:39:14,684 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-11 02:39:14,688 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-11 02:39:14,689 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-11 02:39:14,689 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-11 02:39:14,690 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-11 02:39:14,690 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-11 02:39:14,691 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-11 02:39:14,693 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-11 02:39:14,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-11 02:39:14,694 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-11 02:39:14,695 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-11 02:39:14,695 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-11 02:39:14,697 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-11 02:39:14,697 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-11 02:39:14,698 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-11 02:39:14,698 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-11 02:39:14,698 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-11 02:39:14,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-11 02:39:14,699 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-11 02:39:14,700 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-11 02:39:14,700 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-11 02:39:14,701 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-11 02:39:14,701 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-11 02:39:14,701 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-11 02:39:14,702 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-11 02:39:14,702 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-11 02:39:14,702 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-11 02:39:14,703 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-11 02:39:14,703 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-11 02:39:14,704 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-NewStatesSleepPersistent-NoLbe.epf [2022-02-11 02:39:14,719 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-11 02:39:14,719 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-11 02:39:14,720 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-11 02:39:14,720 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-11 02:39:14,720 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-11 02:39:14,720 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-11 02:39:14,721 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-11 02:39:14,721 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-11 02:39:14,721 INFO L138 SettingsManager]: * Use SBE=true [2022-02-11 02:39:14,721 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-11 02:39:14,721 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-11 02:39:14,721 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-11 02:39:14,721 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-11 02:39:14,722 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-11 02:39:14,722 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-11 02:39:14,722 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-11 02:39:14,722 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-11 02:39:14,722 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-11 02:39:14,722 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-11 02:39:14,722 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-11 02:39:14,722 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-11 02:39:14,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-11 02:39:14,723 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-11 02:39:14,723 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-11 02:39:14,723 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-11 02:39:14,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-11 02:39:14,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-11 02:39:14,723 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-11 02:39:14,724 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-11 02:39:14,724 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-11 02:39:14,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-11 02:39:14,724 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-11 02:39:14,724 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-02-11 02:39:14,724 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-11 02:39:14,724 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-02-11 02:39:14,724 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES [2022-02-11 02:39:14,725 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-02-11 02:39:14,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-11 02:39:14,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-11 02:39:14,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-11 02:39:14,937 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-11 02:39:14,937 INFO L275 PluginConnector]: CDTParser initialized [2022-02-11 02:39:14,938 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-11 02:39:14,985 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88b178570/4d082cd4ec0a41a0b6ba65cd0609cc5c/FLAG16cf5c266 [2022-02-11 02:39:15,378 INFO L306 CDTParser]: Found 1 translation units. [2022-02-11 02:39:15,379 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/sssc12_variant.i [2022-02-11 02:39:15,391 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88b178570/4d082cd4ec0a41a0b6ba65cd0609cc5c/FLAG16cf5c266 [2022-02-11 02:39:15,401 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88b178570/4d082cd4ec0a41a0b6ba65cd0609cc5c [2022-02-11 02:39:15,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-11 02:39:15,406 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-11 02:39:15,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-11 02:39:15,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-11 02:39:15,411 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-11 02:39:15,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.02 02:39:15" (1/1) ... [2022-02-11 02:39:15,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dd9a0df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 02:39:15, skipping insertion in model container [2022-02-11 02:39:15,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.02 02:39:15" (1/1) ... [2022-02-11 02:39:15,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-11 02:39:15,457 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-11 02:39:15,811 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-11 02:39:15,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-11 02:39:15,834 INFO L203 MainTranslator]: Completed pre-run [2022-02-11 02:39:15,855 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-11 02:39:15,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-11 02:39:15,900 INFO L208 MainTranslator]: Completed translation [2022-02-11 02:39:15,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 02:39:15 WrapperNode [2022-02-11 02:39:15,901 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-11 02:39:15,902 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-11 02:39:15,902 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-11 02:39:15,902 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-11 02:39:15,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 02:39:15" (1/1) ... [2022-02-11 02:39:15,929 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 02:39:15" (1/1) ... [2022-02-11 02:39:15,947 INFO L137 Inliner]: procedures = 275, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 87 [2022-02-11 02:39:15,947 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-11 02:39:15,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-11 02:39:15,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-11 02:39:15,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-11 02:39:15,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 02:39:15" (1/1) ... [2022-02-11 02:39:15,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 02:39:15" (1/1) ... [2022-02-11 02:39:15,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 02:39:15" (1/1) ... [2022-02-11 02:39:15,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 02:39:15" (1/1) ... [2022-02-11 02:39:15,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 02:39:15" (1/1) ... [2022-02-11 02:39:15,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 02:39:15" (1/1) ... [2022-02-11 02:39:15,963 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 02:39:15" (1/1) ... [2022-02-11 02:39:15,966 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-11 02:39:15,966 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-11 02:39:15,966 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-11 02:39:15,966 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-11 02:39:15,967 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 02:39:15" (1/1) ... [2022-02-11 02:39:15,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-11 02:39:15,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 02:39:15,996 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-11 02:39:16,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-11 02:39:16,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-11 02:39:16,021 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2022-02-11 02:39:16,021 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2022-02-11 02:39:16,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-11 02:39:16,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-11 02:39:16,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-11 02:39:16,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-11 02:39:16,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-11 02:39:16,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-11 02:39:16,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-11 02:39:16,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-11 02:39:16,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-11 02:39:16,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-11 02:39:16,023 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-11 02:39:16,144 INFO L234 CfgBuilder]: Building ICFG [2022-02-11 02:39:16,145 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-11 02:39:16,325 INFO L275 CfgBuilder]: Performing block encoding [2022-02-11 02:39:16,348 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-11 02:39:16,348 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-11 02:39:16,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.02 02:39:16 BoogieIcfgContainer [2022-02-11 02:39:16,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-11 02:39:16,351 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-11 02:39:16,351 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-11 02:39:16,356 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-11 02:39:16,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.02 02:39:15" (1/3) ... [2022-02-11 02:39:16,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d63181a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.02 02:39:16, skipping insertion in model container [2022-02-11 02:39:16,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 02:39:15" (2/3) ... [2022-02-11 02:39:16,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d63181a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.02 02:39:16, skipping insertion in model container [2022-02-11 02:39:16,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.02 02:39:16" (3/3) ... [2022-02-11 02:39:16,358 INFO L112 eAbstractionObserver]: Analyzing ICFG sssc12_variant.i [2022-02-11 02:39:16,361 WARN L154 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-11 02:39:16,362 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-11 02:39:16,362 INFO L168 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-11 02:39:16,362 INFO L538 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-11 02:39:16,396 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,397 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,397 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,397 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,397 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,397 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,397 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,397 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,397 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,398 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,398 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,398 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,398 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,398 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,398 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,398 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,399 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,399 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,399 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,400 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,401 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,401 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,402 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,403 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,403 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,404 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,405 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,405 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,405 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,405 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,405 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,406 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,406 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,406 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,406 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,406 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,406 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,406 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,407 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,407 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,407 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,407 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,407 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,408 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,408 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,409 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,410 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,410 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,410 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,410 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,411 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,411 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,411 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,411 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,411 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,411 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,411 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,411 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,411 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,412 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,412 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,412 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,412 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,413 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,413 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,413 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,413 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,413 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,413 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,413 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,416 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,416 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,416 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,416 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,417 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,417 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,417 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,417 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,417 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,418 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,418 WARN L322 ript$VariableManager]: TermVariable |thrThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,420 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-11 02:39:16,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-11 02:39:16,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 02:39:16,457 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-02-11 02:39:16,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-02-11 02:39:16,480 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-02-11 02:39:16,486 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-11 02:39:16,488 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-11 02:39:16,583 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-11 02:39:16,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:39:16,587 INFO L85 PathProgramCache]: Analyzing trace with hash -147767055, now seen corresponding path program 1 times [2022-02-11 02:39:16,592 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:39:16,592 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4027293] [2022-02-11 02:39:16,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:39:16,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:39:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:39:16,755 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-11 02:39:16,755 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:39:16,755 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4027293] [2022-02-11 02:39:16,756 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4027293] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 02:39:16,756 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 02:39:16,756 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-11 02:39:16,757 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004761359] [2022-02-11 02:39:16,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 02:39:16,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-11 02:39:16,761 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 02:39:16,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-11 02:39:16,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-11 02:39:16,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:16,775 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 02:39:16,776 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-11 02:39:16,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:16,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:16,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-11 02:39:16,791 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-11 02:39:16,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:39:16,794 INFO L85 PathProgramCache]: Analyzing trace with hash 178627719, now seen corresponding path program 1 times [2022-02-11 02:39:16,794 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:39:16,794 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593537570] [2022-02-11 02:39:16,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:39:16,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:39:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-11 02:39:16,833 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-11 02:39:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-11 02:39:16,888 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-11 02:39:16,889 INFO L629 BasicCegarLoop]: Counterexample is feasible [2022-02-11 02:39:16,890 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 1 remaining) [2022-02-11 02:39:16,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-11 02:39:16,897 INFO L733 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-11 02:39:16,898 INFO L313 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/2) [2022-02-11 02:39:16,898 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-02-11 02:39:16,898 INFO L538 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-02-11 02:39:16,910 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,910 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,910 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,910 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,910 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,910 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,911 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,911 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,911 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,911 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,911 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,911 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,911 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,912 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,912 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,912 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,912 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,912 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,912 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,913 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,914 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,914 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,915 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,915 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,915 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,915 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,915 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,916 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,916 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,916 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,916 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,916 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,917 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,917 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,917 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,917 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,917 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,917 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,917 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,918 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,918 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,918 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,918 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,918 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,919 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,919 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,919 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,919 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,920 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,920 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,920 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,920 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,920 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,920 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,920 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,920 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,920 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,920 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,921 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,921 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,921 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,921 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,921 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,921 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,921 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,921 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,921 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,921 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,922 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,922 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,924 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,924 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,924 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,924 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,924 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,924 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,924 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,924 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,924 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,924 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,924 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,925 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,935 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,935 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,935 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,935 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,936 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,936 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,936 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,936 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,936 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,936 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,936 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,937 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,937 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,937 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,937 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,937 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,937 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,937 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,937 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,937 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,938 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,938 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,938 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,938 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,938 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,938 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,938 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,938 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,938 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,938 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,939 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,939 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,939 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,939 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,939 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,939 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,940 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,940 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,940 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,940 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,940 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,940 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,940 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,940 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,940 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,940 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,940 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,940 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,941 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,941 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,941 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,941 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,941 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,941 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,941 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,941 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,941 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,941 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,942 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,942 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,942 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,942 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,942 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,942 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,942 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,942 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,942 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,942 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,943 WARN L322 ript$VariableManager]: TermVariable |thrThread1of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,943 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,943 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,943 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,943 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~end~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,943 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,943 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,943 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,944 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,944 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,944 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,944 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:39:16,944 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-11 02:39:16,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-11 02:39:16,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 02:39:16,947 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-11 02:39:16,980 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thrThread2of2ForFork0 ======== [2022-02-11 02:39:16,981 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-11 02:39:16,981 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-11 02:39:16,986 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-11 02:39:17,205 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 02:39:17,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:39:17,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1357712340, now seen corresponding path program 1 times [2022-02-11 02:39:17,206 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:39:17,208 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246272106] [2022-02-11 02:39:17,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:39:17,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:39:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:39:17,255 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-11 02:39:17,255 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:39:17,255 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246272106] [2022-02-11 02:39:17,255 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246272106] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 02:39:17,255 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 02:39:17,255 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-11 02:39:17,255 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200880298] [2022-02-11 02:39:17,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 02:39:17,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-11 02:39:17,256 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 02:39:17,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-11 02:39:17,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-11 02:39:17,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:17,257 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 02:39:17,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 42.5) internal successors, (85), 2 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-11 02:39:17,257 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:17,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:17,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-11 02:39:17,271 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 02:39:17,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:39:17,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1651349044, now seen corresponding path program 1 times [2022-02-11 02:39:17,271 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:39:17,271 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654680115] [2022-02-11 02:39:17,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:39:17,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:39:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:39:17,368 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-11 02:39:17,368 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:39:17,368 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654680115] [2022-02-11 02:39:17,368 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654680115] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 02:39:17,368 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 02:39:17,368 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-11 02:39:17,368 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230161305] [2022-02-11 02:39:17,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 02:39:17,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-11 02:39:17,369 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 02:39:17,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-11 02:39:17,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-11 02:39:17,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:17,370 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 02:39:17,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 02:39:17,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:17,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:17,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:17,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 02:39:17,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-11 02:39:17,536 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 02:39:17,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:39:17,537 INFO L85 PathProgramCache]: Analyzing trace with hash 277287731, now seen corresponding path program 1 times [2022-02-11 02:39:17,538 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:39:17,538 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946643992] [2022-02-11 02:39:17,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:39:17,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:39:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:39:17,663 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-11 02:39:17,663 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:39:17,663 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946643992] [2022-02-11 02:39:17,663 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946643992] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 02:39:17,664 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 02:39:17,664 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-11 02:39:17,664 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004515414] [2022-02-11 02:39:17,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 02:39:17,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-11 02:39:17,664 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 02:39:17,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-11 02:39:17,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-11 02:39:17,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:17,665 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 02:39:17,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 02:39:17,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:17,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 02:39:17,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:17,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:17,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 02:39:17,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:39:17,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-11 02:39:17,760 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 02:39:17,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:39:17,760 INFO L85 PathProgramCache]: Analyzing trace with hash -469146024, now seen corresponding path program 1 times [2022-02-11 02:39:17,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:39:17,763 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234934561] [2022-02-11 02:39:17,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:39:17,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:39:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:39:17,868 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-11 02:39:17,869 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:39:17,869 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234934561] [2022-02-11 02:39:17,869 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234934561] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 02:39:17,869 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 02:39:17,869 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-11 02:39:17,869 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646607765] [2022-02-11 02:39:17,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 02:39:17,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-11 02:39:17,869 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 02:39:17,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-11 02:39:17,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-11 02:39:17,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:17,870 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 02:39:17,870 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-11 02:39:17,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:17,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 02:39:17,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:39:17,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:17,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:17,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 02:39:17,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:39:17,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-11 02:39:17,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-11 02:39:17,962 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 02:39:17,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:39:17,962 INFO L85 PathProgramCache]: Analyzing trace with hash -581529252, now seen corresponding path program 1 times [2022-02-11 02:39:17,962 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:39:17,962 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250763226] [2022-02-11 02:39:17,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:39:17,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:39:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:39:18,054 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-11 02:39:18,054 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:39:18,054 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250763226] [2022-02-11 02:39:18,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250763226] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 02:39:18,054 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168764898] [2022-02-11 02:39:18,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:39:18,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 02:39:18,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 02:39:18,056 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-11 02:39:18,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-11 02:39:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:39:18,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-11 02:39:18,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 02:39:18,387 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-11 02:39:18,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 02:39:18,573 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-11 02:39:18,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168764898] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 02:39:18,574 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 02:39:18,574 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-02-11 02:39:18,574 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325808026] [2022-02-11 02:39:18,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 02:39:18,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-11 02:39:18,575 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 02:39:18,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-11 02:39:18,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-11 02:39:18,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:18,576 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 02:39:18,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.636363636363637) internal successors, (172), 11 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 02:39:18,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:18,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 02:39:18,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:39:18,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-02-11 02:39:18,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:18,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:18,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 02:39:18,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:39:18,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-11 02:39:18,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 02:39:18,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-11 02:39:18,899 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-11 02:39:18,899 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 02:39:18,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:39:18,899 INFO L85 PathProgramCache]: Analyzing trace with hash 781208279, now seen corresponding path program 2 times [2022-02-11 02:39:18,900 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:39:18,900 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322203797] [2022-02-11 02:39:18,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:39:18,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:39:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:39:19,035 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-11 02:39:19,035 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:39:19,036 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322203797] [2022-02-11 02:39:19,036 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322203797] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 02:39:19,036 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372548240] [2022-02-11 02:39:19,036 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-11 02:39:19,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 02:39:19,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 02:39:19,038 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-11 02:39:19,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-11 02:39:19,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-11 02:39:19,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 02:39:19,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-11 02:39:19,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 02:39:19,350 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-11 02:39:19,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 02:39:19,562 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-11 02:39:19,563 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372548240] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 02:39:19,563 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 02:39:19,563 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-02-11 02:39:19,563 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310387361] [2022-02-11 02:39:19,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 02:39:19,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-11 02:39:19,564 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 02:39:19,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-11 02:39:19,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2022-02-11 02:39:19,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:19,565 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 02:39:19,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 14.352941176470589) internal successors, (244), 17 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 02:39:19,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:19,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 02:39:19,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:39:19,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-02-11 02:39:19,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 02:39:19,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:19,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:19,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 02:39:19,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:39:19,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-11 02:39:19,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 02:39:19,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:39:19,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-11 02:39:19,895 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-11 02:39:19,895 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 02:39:19,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:39:19,896 INFO L85 PathProgramCache]: Analyzing trace with hash -844834483, now seen corresponding path program 3 times [2022-02-11 02:39:19,896 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:39:19,896 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460283837] [2022-02-11 02:39:19,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:39:19,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:39:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:39:20,074 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-11 02:39:20,074 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:39:20,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460283837] [2022-02-11 02:39:20,074 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460283837] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 02:39:20,075 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070633122] [2022-02-11 02:39:20,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-11 02:39:20,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 02:39:20,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 02:39:20,077 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-11 02:39:20,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-11 02:39:20,164 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-11 02:39:20,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 02:39:20,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-11 02:39:20,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 02:39:20,205 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-11 02:39:20,230 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-11 02:39:20,230 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-11 02:39:20,524 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-11 02:39:20,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, 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-11 02:39:20,566 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-11 02:39:20,588 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-11 02:39:20,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 02:39:20,620 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-11 02:39:20,647 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-11 02:39:20,648 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-11 02:39:20,653 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-11 02:39:20,934 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-11 02:39:20,934 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070633122] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 02:39:20,934 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 02:39:20,934 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 14 [2022-02-11 02:39:20,934 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175306122] [2022-02-11 02:39:20,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 02:39:20,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-11 02:39:20,936 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 02:39:20,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-11 02:39:20,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=129, Unknown=1, NotChecked=22, Total=182 [2022-02-11 02:39:20,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:20,937 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 02:39:20,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.714285714285714) internal successors, (136), 14 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 02:39:20,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:20,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 02:39:20,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:39:20,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-02-11 02:39:20,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 02:39:20,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:39:20,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:21,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:21,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-11 02:39:21,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:39:21,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-11 02:39:21,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 02:39:21,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:39:21,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:39:21,576 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-11 02:39:21,773 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-11 02:39:21,774 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 02:39:21,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:39:21,774 INFO L85 PathProgramCache]: Analyzing trace with hash 2043294425, now seen corresponding path program 1 times [2022-02-11 02:39:21,774 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:39:21,774 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744319657] [2022-02-11 02:39:21,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:39:21,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:39:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:39:21,997 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-11 02:39:21,998 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:39:21,998 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744319657] [2022-02-11 02:39:21,998 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744319657] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 02:39:21,998 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545702763] [2022-02-11 02:39:21,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:39:21,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 02:39:21,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 02:39:21,999 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-11 02:39:22,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-11 02:39:22,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:39:22,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-11 02:39:22,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 02:39:22,486 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-11 02:39:22,486 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-11 02:39:22,486 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545702763] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 02:39:22,486 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-11 02:39:22,486 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 17 [2022-02-11 02:39:22,487 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212435231] [2022-02-11 02:39:22,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 02:39:22,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-11 02:39:22,487 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 02:39:22,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-11 02:39:22,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2022-02-11 02:39:22,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:22,488 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 02:39:22,488 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-11 02:39:22,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:22,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-11 02:39:22,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:39:22,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-02-11 02:39:22,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 02:39:22,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:39:22,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:39:22,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:23,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:23,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:39:23,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:39:23,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-11 02:39:23,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 02:39:23,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:39:23,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:39:23,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:39:23,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-11 02:39:23,247 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-11 02:39:23,247 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 02:39:23,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:39:23,248 INFO L85 PathProgramCache]: Analyzing trace with hash 421905766, now seen corresponding path program 2 times [2022-02-11 02:39:23,248 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:39:23,248 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237073946] [2022-02-11 02:39:23,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:39:23,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:39:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:39:23,534 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-11 02:39:23,535 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:39:23,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237073946] [2022-02-11 02:39:23,535 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237073946] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 02:39:23,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023502430] [2022-02-11 02:39:23,535 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-11 02:39:23,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 02:39:23,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 02:39:23,536 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-11 02:39:23,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-11 02:39:23,665 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-11 02:39:23,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 02:39:23,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-11 02:39:23,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 02:39:24,118 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-11 02:39:24,167 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:39:24,168 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-11 02:39:24,175 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-11 02:39:24,205 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-11 02:39:24,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 02:39:24,729 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-11 02:39:24,730 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023502430] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 02:39:24,730 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 02:39:24,730 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 38 [2022-02-11 02:39:24,730 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819611629] [2022-02-11 02:39:24,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 02:39:24,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-02-11 02:39:24,731 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 02:39:24,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-02-11 02:39:24,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1181, Unknown=0, NotChecked=0, Total=1406 [2022-02-11 02:39:24,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:24,731 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 02:39:24,732 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-11 02:39:24,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:24,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:39:24,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:39:24,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-02-11 02:39:24,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 02:39:24,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:39:24,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:39:24,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:39:24,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:26,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:26,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:39:26,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:39:26,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-11 02:39:26,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 02:39:26,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:39:26,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:39:26,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:39:26,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-02-11 02:39:26,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-11 02:39:26,633 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-11 02:39:26,633 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 02:39:26,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:39:26,634 INFO L85 PathProgramCache]: Analyzing trace with hash -91412896, now seen corresponding path program 1 times [2022-02-11 02:39:26,634 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:39:26,634 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901292219] [2022-02-11 02:39:26,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:39:26,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:39:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:39:26,701 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-11 02:39:26,702 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:39:26,702 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901292219] [2022-02-11 02:39:26,702 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901292219] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 02:39:26,702 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 02:39:26,702 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-11 02:39:26,702 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659235296] [2022-02-11 02:39:26,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 02:39:26,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-11 02:39:26,702 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 02:39:26,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-11 02:39:26,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-11 02:39:26,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:26,703 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 02:39:26,704 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-11 02:39:26,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:26,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:39:26,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:39:26,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-02-11 02:39:26,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 02:39:26,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:39:26,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:39:26,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:39:26,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2022-02-11 02:39:26,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:28,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:28,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:39:28,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:39:28,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-11 02:39:28,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 02:39:28,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:39:28,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:39:28,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:39:28,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-02-11 02:39:28,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:39:28,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-11 02:39:28,031 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 02:39:28,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:39:28,031 INFO L85 PathProgramCache]: Analyzing trace with hash -2007965222, now seen corresponding path program 3 times [2022-02-11 02:39:28,031 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:39:28,031 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539730634] [2022-02-11 02:39:28,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:39:28,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:39:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:39:28,365 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-11 02:39:28,365 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:39:28,365 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539730634] [2022-02-11 02:39:28,366 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539730634] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 02:39:28,366 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871209721] [2022-02-11 02:39:28,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-11 02:39:28,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 02:39:28,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 02:39:28,367 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-11 02:39:28,368 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-11 02:39:28,798 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-02-11 02:39:28,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 02:39:28,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 34 conjunts are in the unsatisfiable core [2022-02-11 02:39:28,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 02:39:29,212 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-11 02:39:29,294 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-02-11 02:39:29,294 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-11 02:39:29,346 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-02-11 02:39:29,346 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-11 02:39:29,452 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-02-11 02:39:29,453 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-11 02:39:29,472 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-02-11 02:39:29,472 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-11 02:39:29,557 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-02-11 02:39:29,557 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-11 02:39:29,574 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-02-11 02:39:29,575 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-11 02:39:29,704 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:39:29,705 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-11 02:39:29,711 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-11 02:39:29,745 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-11 02:39:29,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 02:39:32,020 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-11 02:39:32,476 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) (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-11 02:39:34,490 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-11 02:39:51,169 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_subst_2 Int) (v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_2) 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-11 02:39:51,293 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 39 treesize of output 37 [2022-02-11 02:39:51,625 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 56 proven. 88 refuted. 0 times theorem prover too weak. 139 trivial. 245 not checked. [2022-02-11 02:39:51,625 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871209721] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 02:39:51,625 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 02:39:51,625 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 15, 20] total 47 [2022-02-11 02:39:51,625 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658350460] [2022-02-11 02:39:51,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 02:39:51,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-02-11 02:39:51,626 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 02:39:51,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-02-11 02:39:51,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1596, Unknown=9, NotChecked=340, Total=2162 [2022-02-11 02:39:51,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:51,627 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 02:39:51,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 10.446808510638299) internal successors, (491), 47 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 02:39:51,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:51,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:39:51,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:39:51,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-02-11 02:39:51,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 02:39:51,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:39:51,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:39:51,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:39:51,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2022-02-11 02:39:51,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:39:51,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:39:56,581 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) (forall ((v_subst_2 Int) (v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_2) 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)))) (<= (+ 5 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#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-11 02:39:57,102 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|) (forall ((v_subst_2 Int) (v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_2) 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)))) (<= (+ 6 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#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-11 02:39:57,590 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) (forall ((v_subst_2 Int) (v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_2) 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)))) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 2) |c_thrThread2of2ForFork0_~c~0#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-11 02:39:58,158 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_subst_2 Int) (v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_2) 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)))) (<= (+ 8 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#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-11 02:39:58,619 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) (forall ((v_subst_2 Int) (v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_2) 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)))) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 2) |c_thrThread2of2ForFork0_~c~0#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-11 02:39:59,028 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) (forall ((v_subst_2 Int) (v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_2) 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)))) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#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-11 02:39:59,526 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_subst_2 Int) (v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_2) 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)))) (<= (+ 8 |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))) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 3) |c_thrThread2of2ForFork0_~c~0#1|)) is different from false [2022-02-11 02:39:59,939 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_subst_2 Int) (v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_2) 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)))) (<= (+ 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))) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 3) |c_thrThread2of2ForFork0_~c~0#1|)) is different from false [2022-02-11 02:40:01,967 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-11 02:40:03,971 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))) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 3) |c_thrThread2of2ForFork0_~c~0#1|)) is different from false [2022-02-11 02:40:05,975 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_thrThread2of2ForFork0_~c~0#1| 4))) (let ((.cse1 (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ .cse0 c_~data~0.offset))))) (and (or (= (* |c_thrThread1of2ForFork0_~c~0#1| 4) .cse0) .cse1) (<= (+ 6 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) .cse1 (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)))) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 3) |c_thrThread2of2ForFork0_~c~0#1|)))) is different from false [2022-02-11 02:40:07,979 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 ((|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-11 02:40:09,987 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 ((|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-11 02:40:12,013 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))) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 3) |c_thrThread2of2ForFork0_~c~0#1|)) is different from false [2022-02-11 02:40:14,018 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)) (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-11 02:40:16,027 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))) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 3) |c_thrThread2of2ForFork0_~c~0#1|)) is different from false [2022-02-11 02:40:18,052 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_thrThread2of2ForFork0_~c~0#1| 4))) (let ((.cse1 (= 1 (select (select |c_#memory_int| c_~data~0.base) (+ .cse0 c_~data~0.offset))))) (and (or (= (* |c_thrThread1of2ForFork0_~c~0#1| 4) .cse0) .cse1) (<= |c_thrThread1of2ForFork0_~end~0#1| |c_thrThread2of2ForFork0_~c~0#1|) .cse1 (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)))) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 3) |c_thrThread2of2ForFork0_~c~0#1|)))) is different from false [2022-02-11 02:40:20,057 WARN L838 $PredicateComparison]: unable to prove that (and (<= |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-11 02:40:22,082 WARN L838 $PredicateComparison]: unable to prove that (and (< (+ 3 |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 ((|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-11 02:40:22,580 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_2 Int) (v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_2) 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| 2) |c_thrThread2of2ForFork0_~c~0#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-11 02:40:23,172 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_subst_2 Int) (v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_2) 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)))) (<= (+ 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)))) is different from false [2022-02-11 02:40:25,175 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 6 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_2 Int) (v_subst_1 Int)) (or (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)) (forall ((v_ArrVal_785 Int)) (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_2) 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| |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-11 02:40:27,180 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-11 02:40:29,204 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-11 02:40:31,207 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-11 02:40:33,214 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 ((|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-11 02:40:35,219 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (and (<= |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-11 02:40:35,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:40:35,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:40:35,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:40:35,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-11 02:40:35,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 02:40:35,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:40:35,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:40:35,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:40:35,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-02-11 02:40:35,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:40:35,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-02-11 02:40:35,751 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-11 02:40:35,932 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-11 02:40:35,932 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 02:40:35,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:40:35,933 INFO L85 PathProgramCache]: Analyzing trace with hash 45194586, now seen corresponding path program 4 times [2022-02-11 02:40:35,933 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:40:35,933 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029259769] [2022-02-11 02:40:35,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:40:35,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:40:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:40:36,389 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-11 02:40:36,389 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:40:36,389 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029259769] [2022-02-11 02:40:36,389 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029259769] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 02:40:36,389 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44655140] [2022-02-11 02:40:36,389 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-11 02:40:36,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 02:40:36,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 02:40:36,392 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-11 02:40:36,393 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-11 02:40:36,519 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-11 02:40:36,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 02:40:36,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 47 conjunts are in the unsatisfiable core [2022-02-11 02:40:36,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 02:40:36,546 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-11 02:40:36,566 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-11 02:40:36,566 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-11 02:40:37,102 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-11 02:40:37,142 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-11 02:40:37,232 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:40:37,232 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-11 02:40:37,248 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:40:37,249 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-11 02:40:37,306 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:40:37,307 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-11 02:40:37,320 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:40:37,320 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-11 02:40:37,369 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:40:37,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, 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-11 02:40:37,381 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:40:37,381 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-11 02:40:37,450 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:40:37,450 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-11 02:40:37,462 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-11 02:40:37,498 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-11 02:40:37,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 02:40:38,023 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-11 02:40:38,050 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-11 02:40:38,050 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-11 02:40:38,052 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-11 02:40:38,054 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-11 02:40:38,788 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-11 02:40:38,789 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44655140] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 02:40:38,789 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 02:40:38,789 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 48 [2022-02-11 02:40:38,789 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452608613] [2022-02-11 02:40:38,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 02:40:38,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-02-11 02:40:38,790 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 02:40:38,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-02-11 02:40:38,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=1896, Unknown=1, NotChecked=90, Total=2256 [2022-02-11 02:40:38,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:40:38,791 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 02:40:38,791 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-11 02:40:38,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:40:38,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:40:38,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:40:38,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-02-11 02:40:38,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 02:40:38,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:40:38,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:40:38,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:40:38,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2022-02-11 02:40:38,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:40:38,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 86 states. [2022-02-11 02:40:38,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:40:40,641 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_2 Int) (v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_2) 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-11 02:40:41,171 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) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 1) |c_thrThread2of2ForFork0_~c~0#1|) (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_2 Int) (v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_2) 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-11 02:40:41,630 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_subst_2 Int) (v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_2) 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-11 02:40:43,911 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))) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 3) |c_thrThread2of2ForFork0_~c~0#1|)) is different from false [2022-02-11 02:40:47,156 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_2 Int) (v_subst_1 Int)) (or (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)) (forall ((v_ArrVal_785 Int)) (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_2) 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| |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-11 02:40:49,186 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-11 02:40:51,190 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-11 02:40:53,193 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 ((|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-11 02:40:55,230 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 (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-11 02:40:57,233 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ 5 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (forall ((v_subst_2 Int) (v_subst_1 Int)) (or (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)) (forall ((v_ArrVal_785 Int)) (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_2) 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| |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-11 02:40:59,237 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)) (not (= (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) .cse0)))) is different from false [2022-02-11 02:41:41,301 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-11 02:41:43,304 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_subst_2 Int) (v_subst_1 Int)) (or (<= |c_thrThread1of2ForFork0_~end~0#1| (+ v_subst_1 1)) (forall ((v_ArrVal_785 Int)) (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_2) 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| |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-11 02:41:45,307 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-11 02:41:47,312 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-11 02:41:49,315 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-11 02:41:51,318 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_thrThread1of2ForFork0_~c~0#1| 1))) (and (or (<= |c_thrThread1of2ForFork0_~end~0#1| .cse0) (forall ((v_ArrVal_785 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |c_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| |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)))) (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-11 02:41:53,367 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)))) (<= |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-11 02:41:55,371 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|))) (<= |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-11 02:41:57,468 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|) (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-11 02:41:59,470 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|) (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-11 02:42:01,474 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|)) is different from false [2022-02-11 02:42:03,720 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) (forall ((v_subst_2 Int) (v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_2) 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)))) (<= (+ 6 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#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-11 02:42:04,236 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|) (forall ((v_subst_2 Int) (v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_2) 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)))) (<= (+ 7 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#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-11 02:42:04,668 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) (forall ((v_subst_2 Int) (v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_2) 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)))) (<= (+ 8 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#1|) (<= (+ |c_thrThread1of2ForFork0_~end~0#1| 2) |c_thrThread2of2ForFork0_~c~0#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-11 02:42:05,332 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) (forall ((v_subst_2 Int) (v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_2) 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)))) (<= (+ 8 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#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-11 02:42:05,808 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|) (forall ((v_subst_2 Int) (v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_2) 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)))) (<= (+ 8 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#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-11 02:42:06,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:42:06,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:42:06,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:42:06,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-11 02:42:06,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 02:42:06,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:42:06,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:42:06,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:42:06,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-02-11 02:42:06,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:42:06,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2022-02-11 02:42:06,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-02-11 02:42:06,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-02-11 02:42:06,463 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-11 02:42:06,464 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 02:42:06,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:42:06,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1056291974, now seen corresponding path program 5 times [2022-02-11 02:42:06,464 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:42:06,464 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305010269] [2022-02-11 02:42:06,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:42:06,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:42:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:42:06,879 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-11 02:42:06,880 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:42:06,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305010269] [2022-02-11 02:42:06,880 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305010269] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 02:42:06,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560753113] [2022-02-11 02:42:06,880 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-11 02:42:06,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 02:42:06,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 02:42:06,881 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-11 02:42:06,882 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-11 02:42:07,237 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-02-11 02:42:07,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 02:42:07,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 49 conjunts are in the unsatisfiable core [2022-02-11 02:42:07,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 02:42:07,269 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-11 02:42:07,290 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-11 02:42:07,290 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-11 02:42:07,718 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-11 02:42:07,752 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-11 02:42:07,799 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:42:07,799 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-11 02:42:07,812 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:42:07,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, 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-11 02:42:07,857 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:42:07,857 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-11 02:42:07,869 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:42:07,869 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-11 02:42:07,915 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:42:07,915 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-11 02:42:07,929 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:42:07,929 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-11 02:42:07,979 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:42:07,979 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-11 02:42:07,992 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:42:07,992 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-11 02:42:08,055 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:42:08,055 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-11 02:42:08,061 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-11 02:42:08,094 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-11 02:42:08,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 02:42:08,556 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-11 02:42:08,592 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-11 02:42:08,592 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-11 02:42:08,594 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-11 02:42:08,596 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-02-11 02:42:09,120 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-11 02:42:09,121 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560753113] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 02:42:09,121 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 02:42:09,121 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 40 [2022-02-11 02:42:09,121 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442522713] [2022-02-11 02:42:09,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 02:42:09,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-02-11 02:42:09,122 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 02:42:09,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-02-11 02:42:09,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1300, Unknown=1, NotChecked=74, Total=1560 [2022-02-11 02:42:09,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:42:09,123 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 02:42:09,123 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-11 02:42:09,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:42:09,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:42:09,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:42:09,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-02-11 02:42:09,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 02:42:09,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:42:09,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:42:09,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:42:09,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-02-11 02:42:09,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:42:09,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 183 states. [2022-02-11 02:42:09,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-02-11 02:42:09,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:42:11,081 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) (forall ((v_subst_2 Int) (v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_2) 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)))) (<= (+ 8 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#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-11 02:42:12,930 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) (forall ((v_subst_2 Int) (v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_2) 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)))) (<= (+ 8 |c_thrThread1of2ForFork0_~c~0#1|) |c_thrThread2of2ForFork0_~c~0#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-11 02:42:15,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:42:15,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:42:15,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:42:15,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-11 02:42:15,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-11 02:42:15,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:42:15,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:42:15,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:42:15,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-02-11 02:42:15,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:42:15,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2022-02-11 02:42:15,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-02-11 02:42:15,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-02-11 02:42:15,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-11 02:42:15,363 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-11 02:42:15,363 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 02:42:15,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:42:15,364 INFO L85 PathProgramCache]: Analyzing trace with hash 758781662, now seen corresponding path program 6 times [2022-02-11 02:42:15,364 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:42:15,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195172008] [2022-02-11 02:42:15,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:42:15,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:42:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:42:15,930 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 45 proven. 295 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-11 02:42:15,930 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:42:15,930 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195172008] [2022-02-11 02:42:15,930 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195172008] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 02:42:15,930 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937677175] [2022-02-11 02:42:15,930 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-11 02:42:15,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 02:42:15,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 02:42:15,935 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-11 02:42:15,945 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-11 02:42:16,064 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-02-11 02:42:16,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 02:42:16,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-11 02:42:16,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 02:42:16,318 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-02-11 02:42:16,318 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-11 02:42:16,318 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937677175] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 02:42:16,318 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-11 02:42:16,318 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [28] total 29 [2022-02-11 02:42:16,319 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030465439] [2022-02-11 02:42:16,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 02:42:16,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-11 02:42:16,319 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 02:42:16,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-11 02:42:16,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2022-02-11 02:42:16,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:42:16,320 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 02:42:16,320 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-11 02:42:16,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:42:16,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:42:16,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:42:16,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-02-11 02:42:16,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-02-11 02:42:16,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:42:16,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:42:16,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:42:16,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 129 states. [2022-02-11 02:42:16,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:42:16,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 203 states. [2022-02-11 02:42:16,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2022-02-11 02:42:16,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2022-02-11 02:42:16,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:42:28,707 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset))) (let ((.cse0 (= 1 (select (select |c_#memory_int| c_~data~0.base) .cse1)))) (and (or (and .cse0 (not (= (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) .cse1))) (not (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread1of2ForFork0_~end~0#1|))) (forall ((v_subst_2 Int) (v_subst_1 Int) (|thrThread1of2ForFork0_~c~0#1| Int)) (or (forall ((v_ArrVal_785 Int)) (= (select (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset) 1) (+ (* 4 v_subst_2) 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|) .cse0))) is different from false [2022-02-11 02:42:32,987 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 (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-11 02:42:34,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:42:34,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:42:34,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:42:34,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-11 02:42:34,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-11 02:42:34,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-11 02:42:34,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:42:34,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:42:34,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states. [2022-02-11 02:42:34,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:42:34,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2022-02-11 02:42:34,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2022-02-11 02:42:34,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-02-11 02:42:34,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 02:42:34,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-02-11 02:42:34,741 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-11 02:42:34,741 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 02:42:34,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:42:34,743 INFO L85 PathProgramCache]: Analyzing trace with hash 728137024, now seen corresponding path program 1 times [2022-02-11 02:42:34,743 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:42:34,743 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145799767] [2022-02-11 02:42:34,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:42:34,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:42:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:42:34,967 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-11 02:42:34,967 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:42:34,967 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145799767] [2022-02-11 02:42:34,967 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145799767] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 02:42:34,967 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225760185] [2022-02-11 02:42:34,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:42:34,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 02:42:34,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 02:42:34,968 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-11 02:42:34,969 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-11 02:42:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:42:35,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-11 02:42:35,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 02:42:35,155 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-11 02:42:35,176 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-11 02:42:35,176 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-11 02:42:35,453 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-11 02:42:35,485 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-11 02:42:35,547 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:42:35,548 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-11 02:42:35,552 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-11 02:42:35,579 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-11 02:42:35,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 02:42:35,676 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1248 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1248) c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |c_thrThread2of2ForFork0_~c~0#1|))) is different from false [2022-02-11 02:42:35,703 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-11 02:42:35,704 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-11 02:42:35,707 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-11 02:42:35,709 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-11 02:42:36,135 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-11 02:42:36,135 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225760185] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 02:42:36,135 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 02:42:36,135 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-02-11 02:42:36,135 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619047272] [2022-02-11 02:42:36,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 02:42:36,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-02-11 02:42:36,136 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 02:42:36,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-02-11 02:42:36,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1136, Unknown=1, NotChecked=70, Total=1406 [2022-02-11 02:42:36,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:42:36,137 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 02:42:36,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 7.473684210526316) internal successors, (284), 38 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 02:42:36,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:42:36,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:42:36,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:42:36,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-02-11 02:42:36,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-02-11 02:42:36,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-02-11 02:42:36,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:42:36,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:42:36,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 229 states. [2022-02-11 02:42:36,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:42:36,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 244 states. [2022-02-11 02:42:36,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 111 states. [2022-02-11 02:42:36,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 116 states. [2022-02-11 02:42:36,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 02:42:36,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:42:37,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:42:37,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:42:37,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:42:37,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-11 02:42:37,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-11 02:42:37,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-11 02:42:37,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:42:37,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:42:37,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states. [2022-02-11 02:42:37,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:42:37,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2022-02-11 02:42:37,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2022-02-11 02:42:37,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-02-11 02:42:37,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 02:42:37,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-02-11 02:42:37,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-02-11 02:42:37,830 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-11 02:42:37,830 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 02:42:37,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:42:37,830 INFO L85 PathProgramCache]: Analyzing trace with hash -332878701, now seen corresponding path program 2 times [2022-02-11 02:42:37,830 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:42:37,831 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585951226] [2022-02-11 02:42:37,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:42:37,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:42:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:42:38,150 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-11 02:42:38,150 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:42:38,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585951226] [2022-02-11 02:42:38,150 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585951226] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 02:42:38,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304752821] [2022-02-11 02:42:38,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-11 02:42:38,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 02:42:38,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 02:42:38,152 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-11 02:42:38,152 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-11 02:42:38,286 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-11 02:42:38,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 02:42:38,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 32 conjunts are in the unsatisfiable core [2022-02-11 02:42:38,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 02:42:38,322 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-11 02:42:38,343 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-11 02:42:38,343 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-11 02:42:38,857 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-11 02:42:38,895 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-11 02:42:38,957 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:42:38,957 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-11 02:42:38,961 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-11 02:42:38,993 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-11 02:42:38,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 02:42:39,098 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1358 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1358) c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (<= (+ |c_thrThread2of2ForFork0_~c~0#1| 1) c_~next~0)) is different from false [2022-02-11 02:42:39,122 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-11 02:42:39,122 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-11 02:42:39,124 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-11 02:42:39,126 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-11 02:42:39,652 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-11 02:42:39,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304752821] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 02:42:39,653 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 02:42:39,653 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 35 [2022-02-11 02:42:39,653 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51110657] [2022-02-11 02:42:39,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 02:42:39,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-02-11 02:42:39,653 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 02:42:39,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-02-11 02:42:39,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=958, Unknown=1, NotChecked=64, Total=1190 [2022-02-11 02:42:39,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:42:39,654 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 02:42:39,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 8.114285714285714) internal successors, (284), 35 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 02:42:39,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:42:39,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:42:39,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:42:39,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-02-11 02:42:39,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-02-11 02:42:39,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-02-11 02:42:39,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:42:39,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:42:39,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 229 states. [2022-02-11 02:42:39,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:42:39,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 244 states. [2022-02-11 02:42:39,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 111 states. [2022-02-11 02:42:39,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 116 states. [2022-02-11 02:42:39,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 02:42:39,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2022-02-11 02:42:39,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:42:41,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:42:41,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:42:41,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:42:41,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-11 02:42:41,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-11 02:42:41,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-11 02:42:41,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:42:41,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:42:41,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states. [2022-02-11 02:42:41,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:42:41,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2022-02-11 02:42:41,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2022-02-11 02:42:41,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-02-11 02:42:41,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 02:42:41,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-02-11 02:42:41,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-02-11 02:42:41,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-02-11 02:42:41,203 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-11 02:42:41,204 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 02:42:41,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:42:41,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1381090954, now seen corresponding path program 3 times [2022-02-11 02:42:41,204 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:42:41,204 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8051603] [2022-02-11 02:42:41,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:42:41,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:42:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:42:41,369 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-11 02:42:41,369 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:42:41,369 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8051603] [2022-02-11 02:42:41,370 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8051603] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 02:42:41,370 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531145108] [2022-02-11 02:42:41,370 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-11 02:42:41,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 02:42:41,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 02:42:41,384 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-11 02:42:41,424 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-11 02:42:41,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-11 02:42:41,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 02:42:41,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-11 02:42:41,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 02:42:41,578 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-11 02:42:41,605 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-11 02:42:41,605 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-11 02:42:42,078 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-11 02:42:42,126 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-11 02:42:42,195 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:42:42,196 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-11 02:42:42,230 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-11 02:42:42,271 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-11 02:42:42,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 02:42:44,336 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)) (forall ((v_ArrVal_1477 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1477) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)))) is different from false [2022-02-11 02:42:44,363 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1477 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1476) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1477) (+ (* |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-11 02:42:44,400 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-11 02:42:44,400 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-11 02:42:44,401 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-11 02:42:44,405 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-11 02:42:44,408 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-11 02:42:44,914 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-11 02:42:44,915 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531145108] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 02:42:44,915 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 02:42:44,915 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 31 [2022-02-11 02:42:44,915 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250827034] [2022-02-11 02:42:44,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 02:42:44,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-02-11 02:42:44,915 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 02:42:44,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-02-11 02:42:44,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=702, Unknown=2, NotChecked=110, Total=930 [2022-02-11 02:42:44,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:42:44,916 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 02:42:44,916 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-11 02:42:44,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:42:44,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:42:44,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:42:44,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-02-11 02:42:44,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-02-11 02:42:44,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-02-11 02:42:44,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:42:44,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:42:44,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 229 states. [2022-02-11 02:42:44,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:42:44,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 244 states. [2022-02-11 02:42:44,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 111 states. [2022-02-11 02:42:44,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 116 states. [2022-02-11 02:42:44,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 02:42:44,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2022-02-11 02:42:44,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2022-02-11 02:42:44,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:42:45,510 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1477 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1476) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1477) (+ (* |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-11 02:42:45,940 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1477 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1476) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1477) (+ (* |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-11 02:42:46,422 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1477 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1476) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1477) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) (<= |c_thrThread2of2ForFork0_~end~0#1| (+ 9 |c_thrThread2of2ForFork0_~c~0#1|)) (< |c_thrThread2of2ForFork0_~c~0#1| c_~next~0) (<= |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))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-11 02:42:46,921 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1477 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1476) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1477) (+ (* |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| 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|)) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-11 02:42:47,416 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1477 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1476) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1477) (+ (* |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|)) (<= |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))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-11 02:42:47,897 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1477 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1476) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1477) (+ (* |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| 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|)) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-11 02:42:48,382 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1477 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1476) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1477) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) (<= |c_thrThread2of2ForFork0_~end~0#1| (+ 5 |c_thrThread2of2ForFork0_~c~0#1|)) (< |c_thrThread2of2ForFork0_~c~0#1| c_~next~0) (<= |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))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-11 02:42:48,881 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1477 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1476) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1477) (+ (* |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| 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))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-11 02:42:49,369 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1477 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1476) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1477) (+ (* |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|)) (<= |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))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-11 02:42:49,857 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1477 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1476) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1477) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) (<= |c_thrThread2of2ForFork0_~end~0#1| (+ 2 |c_thrThread2of2ForFork0_~c~0#1|)) (< |c_thrThread2of2ForFork0_~c~0#1| c_~next~0) (<= |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))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-11 02:42:50,362 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1477 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1476) c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1477) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)))) (<= |c_thrThread2of2ForFork0_~end~0#1| (+ |c_thrThread2of2ForFork0_~c~0#1| 1)) (< |c_thrThread2of2ForFork0_~c~0#1| c_~next~0) (<= |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))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-11 02:42:52,470 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_thrThread2of2ForFork0_~c~0#1| c_~next~0) (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)) (forall ((v_ArrVal_1477 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1477) (+ (* |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))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| c_~data~0.base))) is different from false [2022-02-11 02:42:54,475 WARN L838 $PredicateComparison]: unable to prove that (and (< |c_thrThread2of2ForFork0_~c~0#1| c_~next~0) (forall ((|v_thrThread1of2ForFork0_~c~0#1_140| Int)) (or (not (<= c_~next~0 |v_thrThread1of2ForFork0_~c~0#1_140|)) (forall ((v_ArrVal_1477 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* |v_thrThread1of2ForFork0_~c~0#1_140| 4) c_~data~0.offset) v_ArrVal_1477) (+ (* |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)))) is different from false [2022-02-11 02:42:54,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:42:54,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:42:54,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:42:54,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-11 02:42:54,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-11 02:42:54,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-11 02:42:54,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:42:54,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:42:54,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states. [2022-02-11 02:42:54,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:42:54,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2022-02-11 02:42:54,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2022-02-11 02:42:54,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-02-11 02:42:54,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 02:42:54,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-02-11 02:42:54,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-02-11 02:42:54,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-02-11 02:42:54,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-02-11 02:42:54,851 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-11 02:42:54,851 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 02:42:54,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:42:54,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1549144161, now seen corresponding path program 1 times [2022-02-11 02:42:54,852 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:42:54,852 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626987272] [2022-02-11 02:42:54,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:42:54,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:42:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:42:54,940 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-11 02:42:54,940 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:42:54,940 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626987272] [2022-02-11 02:42:54,940 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626987272] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 02:42:54,940 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 02:42:54,940 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-11 02:42:54,940 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674650443] [2022-02-11 02:42:54,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 02:42:54,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-11 02:42:54,941 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 02:42:54,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-11 02:42:54,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-11 02:42:54,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:42:54,941 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 02:42:54,941 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-11 02:42:54,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:42:54,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:42:54,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:42:54,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-02-11 02:42:54,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-02-11 02:42:54,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-02-11 02:42:54,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:42:54,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:42:54,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 229 states. [2022-02-11 02:42:54,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:42:54,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 244 states. [2022-02-11 02:42:54,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 111 states. [2022-02-11 02:42:54,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 116 states. [2022-02-11 02:42:54,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 02:42:54,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2022-02-11 02:42:54,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2022-02-11 02:42:54,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2022-02-11 02:42:54,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:42:55,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:42:55,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:42:55,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:42:55,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-11 02:42:55,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-11 02:42:55,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-11 02:42:55,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:42:55,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:42:55,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 234 states. [2022-02-11 02:42:55,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:42:55,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 250 states. [2022-02-11 02:42:55,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-02-11 02:42:55,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-02-11 02:42:55,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 02:42:55,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-02-11 02:42:55,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-02-11 02:42:55,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-02-11 02:42:55,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:42:55,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-11 02:42:55,729 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 02:42:55,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:42:55,729 INFO L85 PathProgramCache]: Analyzing trace with hash 244179958, now seen corresponding path program 7 times [2022-02-11 02:42:55,729 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:42:55,730 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630214705] [2022-02-11 02:42:55,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:42:55,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:42:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:42:56,023 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-11 02:42:56,024 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:42:56,024 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630214705] [2022-02-11 02:42:56,024 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630214705] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 02:42:56,024 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751221205] [2022-02-11 02:42:56,024 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-11 02:42:56,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 02:42:56,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 02:42:56,025 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-11 02:42:56,026 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-11 02:42:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:42:56,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 29 conjunts are in the unsatisfiable core [2022-02-11 02:42:56,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 02:42:56,452 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-11 02:42:56,464 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:42:56,464 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-11 02:42:56,573 INFO L353 Elim1Store]: treesize reduction 88, result has 20.7 percent of original size [2022-02-11 02:42:56,573 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-11 02:42:56,601 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-02-11 02:42:56,601 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-11 02:42:56,634 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-11 02:42:56,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 02:42:56,749 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-11 02:42:57,031 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-11 02:42:57,031 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751221205] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 02:42:57,031 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 02:42:57,031 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 35 [2022-02-11 02:42:57,031 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401109859] [2022-02-11 02:42:57,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 02:42:57,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-02-11 02:42:57,032 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 02:42:57,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-02-11 02:42:57,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1008, Unknown=0, NotChecked=0, Total=1190 [2022-02-11 02:42:57,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:42:57,033 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 02:42:57,033 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-11 02:42:57,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:42:57,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:42:57,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:42:57,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-02-11 02:42:57,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-02-11 02:42:57,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-02-11 02:42:57,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:42:57,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:42:57,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 234 states. [2022-02-11 02:42:57,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:42:57,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 250 states. [2022-02-11 02:42:57,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2022-02-11 02:42:57,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 121 states. [2022-02-11 02:42:57,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 02:42:57,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2022-02-11 02:42:57,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2022-02-11 02:42:57,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-02-11 02:42:57,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:42:57,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:03,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:03,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:43:03,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-11 02:43:03,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-11 02:43:03,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-11 02:43:03,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-11 02:43:03,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:43:03,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:43:03,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 239 states. [2022-02-11 02:43:03,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:43:03,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 254 states. [2022-02-11 02:43:03,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-02-11 02:43:03,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-02-11 02:43:03,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 02:43:03,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-02-11 02:43:03,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-02-11 02:43:03,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-02-11 02:43:03,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:43:03,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2022-02-11 02:43:03,723 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-11 02:43:03,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-02-11 02:43:03,925 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-11 02:43:03,930 INFO L733 BasicCegarLoop]: Path program histogram: [7, 3, 3, 1, 1, 1, 1, 1, 1] [2022-02-11 02:43:03,930 INFO L313 ceAbstractionStarter]: Result for error location thrThread2of2ForFork0 was SAFE (1/3) [2022-02-11 02:43:04,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-11 02:43:04,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 02:43:04,041 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-02-11 02:43:04,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (17)] Waiting until timeout for monitored process [2022-02-11 02:43:04,044 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thrThread1of2ForFork0 ======== [2022-02-11 02:43:04,044 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-11 02:43:04,044 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-11 02:43:04,163 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 02:43:04,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:43:04,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1314986904, now seen corresponding path program 1 times [2022-02-11 02:43:04,163 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:43:04,163 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700706665] [2022-02-11 02:43:04,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:43:04,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:43:04,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:43:04,174 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-11 02:43:04,174 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:43:04,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700706665] [2022-02-11 02:43:04,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700706665] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 02:43:04,174 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 02:43:04,174 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-11 02:43:04,174 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059767693] [2022-02-11 02:43:04,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 02:43:04,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-11 02:43:04,174 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 02:43:04,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-11 02:43:04,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-11 02:43:04,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:04,175 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 02:43:04,175 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-11 02:43:04,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:04,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:04,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-11 02:43:04,178 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 02:43:04,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:43:04,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1543138609, now seen corresponding path program 1 times [2022-02-11 02:43:04,178 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:43:04,178 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297842323] [2022-02-11 02:43:04,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:43:04,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:43:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:43:04,203 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-11 02:43:04,203 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:43:04,203 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297842323] [2022-02-11 02:43:04,203 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297842323] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 02:43:04,203 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 02:43:04,203 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-11 02:43:04,204 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629517531] [2022-02-11 02:43:04,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 02:43:04,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-11 02:43:04,204 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 02:43:04,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-11 02:43:04,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-11 02:43:04,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:04,205 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 02:43:04,205 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-11 02:43:04,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:04,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:04,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:04,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 02:43:04,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-11 02:43:04,261 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 02:43:04,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:43:04,261 INFO L85 PathProgramCache]: Analyzing trace with hash -216175272, now seen corresponding path program 1 times [2022-02-11 02:43:04,261 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:43:04,261 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105859541] [2022-02-11 02:43:04,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:43:04,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:43:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:43:04,334 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-11 02:43:04,335 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:43:04,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105859541] [2022-02-11 02:43:04,335 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105859541] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 02:43:04,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682141230] [2022-02-11 02:43:04,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:43:04,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 02:43:04,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 02:43:04,376 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-11 02:43:04,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-02-11 02:43:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:43:04,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-11 02:43:04,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 02:43:04,507 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-11 02:43:04,541 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-11 02:43:04,541 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-11 02:43:04,598 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-11 02:43:04,630 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-11 02:43:04,635 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-11 02:43:04,659 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-11 02:43:04,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 02:43:04,681 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1720 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1720) c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) is different from false [2022-02-11 02:43:04,697 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-11 02:43:04,697 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-11 02:43:04,699 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-11 02:43:04,804 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-11 02:43:04,804 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682141230] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 02:43:04,804 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 02:43:04,804 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 14 [2022-02-11 02:43:04,805 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197412763] [2022-02-11 02:43:04,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 02:43:04,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-11 02:43:04,805 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 02:43:04,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-11 02:43:04,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=129, Unknown=1, NotChecked=22, Total=182 [2022-02-11 02:43:04,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:04,806 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 02:43:04,806 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-11 02:43:04,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:04,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 02:43:04,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:05,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:05,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-11 02:43:05,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-11 02:43:05,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-02-11 02:43:05,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 02:43:05,223 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 02:43:05,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:43:05,224 INFO L85 PathProgramCache]: Analyzing trace with hash -967143089, now seen corresponding path program 1 times [2022-02-11 02:43:05,224 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:43:05,224 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942160367] [2022-02-11 02:43:05,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:43:05,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:43:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:43:05,405 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-11 02:43:05,406 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:43:05,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942160367] [2022-02-11 02:43:05,406 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942160367] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 02:43:05,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933849444] [2022-02-11 02:43:05,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:43:05,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 02:43:05,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 02:43:05,407 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-11 02:43:05,408 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-11 02:43:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:43:05,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-11 02:43:05,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 02:43:05,552 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-11 02:43:05,574 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-11 02:43:05,574 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-11 02:43:05,808 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-11 02:43:05,847 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-11 02:43:05,929 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:43:05,929 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-11 02:43:05,934 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-11 02:43:05,964 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-11 02:43:05,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 02:43:06,093 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1780 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1780) c_~data~0.base) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |c_thrThread1of2ForFork0_~c~0#1|))) is different from false [2022-02-11 02:43:06,123 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-11 02:43:06,123 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-11 02:43:06,125 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-11 02:43:06,127 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-11 02:43:06,506 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-11 02:43:06,507 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933849444] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 02:43:06,507 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 02:43:06,507 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-02-11 02:43:06,507 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054027726] [2022-02-11 02:43:06,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 02:43:06,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-02-11 02:43:06,507 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 02:43:06,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-02-11 02:43:06,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1024, Unknown=1, NotChecked=66, Total=1260 [2022-02-11 02:43:06,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:06,508 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 02:43:06,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.444444444444445) internal successors, (268), 36 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 02:43:06,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:06,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-02-11 02:43:06,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-02-11 02:43:06,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:07,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:07,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-11 02:43:07,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-11 02:43:07,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-02-11 02:43:07,383 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-11 02:43:07,568 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-11 02:43:07,568 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 02:43:07,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:43:07,569 INFO L85 PathProgramCache]: Analyzing trace with hash -389824699, now seen corresponding path program 2 times [2022-02-11 02:43:07,569 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:43:07,569 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362273525] [2022-02-11 02:43:07,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:43:07,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:43:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:43:07,899 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-11 02:43:07,899 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:43:07,899 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362273525] [2022-02-11 02:43:07,899 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362273525] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 02:43:07,899 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756838351] [2022-02-11 02:43:07,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-11 02:43:07,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 02:43:07,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 02:43:07,900 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-11 02:43:07,904 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-11 02:43:08,060 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-11 02:43:08,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 02:43:08,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 32 conjunts are in the unsatisfiable core [2022-02-11 02:43:08,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 02:43:08,084 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-11 02:43:08,106 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-11 02:43:08,106 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-11 02:43:08,593 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-11 02:43:08,688 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-11 02:43:08,777 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:43:08,777 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-11 02:43:08,782 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-11 02:43:08,817 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-11 02:43:08,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 02:43:08,935 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1890 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1890) 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-11 02:43:08,962 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-11 02:43:08,962 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-11 02:43:08,963 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-11 02:43:08,965 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-11 02:43:09,456 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-11 02:43:09,457 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756838351] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 02:43:09,457 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 02:43:09,457 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 35 [2022-02-11 02:43:09,457 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513615350] [2022-02-11 02:43:09,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 02:43:09,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-02-11 02:43:09,457 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 02:43:09,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-02-11 02:43:09,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=958, Unknown=1, NotChecked=64, Total=1190 [2022-02-11 02:43:09,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:09,458 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 02:43:09,458 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-11 02:43:09,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:09,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-02-11 02:43:09,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-02-11 02:43:09,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2022-02-11 02:43:09,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:10,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:10,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-11 02:43:10,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-11 02:43:10,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-02-11 02:43:10,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-02-11 02:43:10,577 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-11 02:43:10,758 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-11 02:43:10,759 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 02:43:10,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:43:10,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1111430144, now seen corresponding path program 3 times [2022-02-11 02:43:10,759 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:43:10,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347321718] [2022-02-11 02:43:10,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:43:10,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:43:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:43:10,935 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-11 02:43:10,935 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:43:10,935 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347321718] [2022-02-11 02:43:10,935 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347321718] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 02:43:10,935 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611499753] [2022-02-11 02:43:10,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-11 02:43:10,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 02:43:10,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 02:43:10,937 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-11 02:43:10,938 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-11 02:43:11,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-11 02:43:11,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 02:43:11,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-11 02:43:11,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 02:43:11,143 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-11 02:43:11,176 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-11 02:43:11,176 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-11 02:43:11,782 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-11 02:43:11,837 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-11 02:43:11,937 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:43:11,938 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-11 02:43:11,956 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-11 02:43:11,999 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-11 02:43:11,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 02:43:14,072 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_149| Int)) (or (forall ((v_ArrVal_2025 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_149|) c_~data~0.offset) v_ArrVal_2025) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_149|)))) is different from false [2022-02-11 02:43:14,155 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2025 Int) (v_ArrVal_2024 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_149| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2024) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_149|) c_~data~0.offset) v_ArrVal_2025) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_149|)))) is different from false [2022-02-11 02:43:14,204 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-11 02:43:14,205 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-11 02:43:14,207 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-11 02:43:14,210 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-11 02:43:14,214 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-11 02:43:14,841 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-11 02:43:14,841 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611499753] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 02:43:14,841 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 02:43:14,842 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 33 [2022-02-11 02:43:14,842 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584318579] [2022-02-11 02:43:14,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 02:43:14,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-02-11 02:43:14,842 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 02:43:14,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-02-11 02:43:14,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=795, Unknown=2, NotChecked=118, Total=1056 [2022-02-11 02:43:14,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:14,843 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 02:43:14,843 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-11 02:43:14,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:14,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-02-11 02:43:14,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-02-11 02:43:14,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2022-02-11 02:43:14,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2022-02-11 02:43:14,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:15,433 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_2025 Int) (v_ArrVal_2024 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_149| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2024) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_149|) c_~data~0.offset) v_ArrVal_2025) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_149|)))) (= (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-11 02:43:15,865 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_2025 Int) (v_ArrVal_2024 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_149| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2024) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_149|) c_~data~0.offset) v_ArrVal_2025) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_149|)))) (< |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-11 02:43:16,368 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_2025 Int) (v_ArrVal_2024 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_149| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2024) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_149|) c_~data~0.offset) v_ArrVal_2025) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_149|)))) (<= |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-11 02:43:16,865 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_2025 Int) (v_ArrVal_2024 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_149| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2024) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_149|) c_~data~0.offset) v_ArrVal_2025) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_149|)))) (<= |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-11 02:43:17,372 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_2025 Int) (v_ArrVal_2024 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_149| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2024) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_149|) c_~data~0.offset) v_ArrVal_2025) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_149|)))) (< |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-11 02:43:17,873 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) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ 6 |c_thrThread1of2ForFork0_~c~0#1|)) (forall ((v_ArrVal_2025 Int) (v_ArrVal_2024 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_149| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2024) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_149|) c_~data~0.offset) v_ArrVal_2025) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_149|)))) (< |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-11 02:43:18,379 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_2025 Int) (v_ArrVal_2024 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_149| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2024) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_149|) c_~data~0.offset) v_ArrVal_2025) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_149|)))) (< |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-11 02:43:18,899 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_2025 Int) (v_ArrVal_2024 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_149| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2024) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_149|) c_~data~0.offset) v_ArrVal_2025) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_149|)))) (<= |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-11 02:43:19,418 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_2025 Int) (v_ArrVal_2024 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_149| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2024) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_149|) c_~data~0.offset) v_ArrVal_2025) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_149|)))) (< |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-11 02:43:19,948 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_2025 Int) (v_ArrVal_2024 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_149| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2024) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_149|) c_~data~0.offset) v_ArrVal_2025) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_149|)))) (< |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-11 02:43:20,484 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) (<= |c_thrThread1of2ForFork0_~end~0#1| (+ |c_thrThread1of2ForFork0_~c~0#1| 1)) (forall ((v_ArrVal_2025 Int) (v_ArrVal_2024 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_149| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2024) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_149|) c_~data~0.offset) v_ArrVal_2025) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_149|)))) (< |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-11 02:43:22,891 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_thrThread2of2ForFork0_~c~0#1_149| Int)) (or (forall ((v_ArrVal_2025 Int)) (= (select (store (select |c_#memory_int| c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_149|) c_~data~0.offset) v_ArrVal_2025) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1)) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_149|)))) (< |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-11 02:43:23,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:23,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-11 02:43:23,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-11 02:43:23,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-02-11 02:43:23,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-02-11 02:43:23,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-02-11 02:43:23,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-02-11 02:43:23,239 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-11 02:43:23,239 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 02:43:23,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:43:23,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1284615935, now seen corresponding path program 1 times [2022-02-11 02:43:23,240 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:43:23,240 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087760952] [2022-02-11 02:43:23,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:43:23,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:43:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:43:23,309 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-11 02:43:23,309 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:43:23,309 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087760952] [2022-02-11 02:43:23,309 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087760952] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 02:43:23,310 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 02:43:23,310 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-11 02:43:23,310 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656695797] [2022-02-11 02:43:23,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 02:43:23,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-11 02:43:23,310 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 02:43:23,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-11 02:43:23,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-11 02:43:23,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:23,310 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 02:43:23,311 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-11 02:43:23,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:23,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-11 02:43:23,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-02-11 02:43:23,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2022-02-11 02:43:23,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2022-02-11 02:43:23,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2022-02-11 02:43:23,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:23,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:23,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-11 02:43:23,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-11 02:43:23,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-02-11 02:43:23,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-02-11 02:43:23,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-02-11 02:43:23,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:43:23,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-02-11 02:43:23,586 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 02:43:23,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:43:23,586 INFO L85 PathProgramCache]: Analyzing trace with hash -441929258, now seen corresponding path program 1 times [2022-02-11 02:43:23,586 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:43:23,586 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153384990] [2022-02-11 02:43:23,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:43:23,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:43:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:43:23,844 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-11 02:43:23,845 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:43:23,845 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153384990] [2022-02-11 02:43:23,845 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153384990] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 02:43:23,845 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632853733] [2022-02-11 02:43:23,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:43:23,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 02:43:23,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 02:43:23,848 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-11 02:43:23,849 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-11 02:43:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:43:24,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 29 conjunts are in the unsatisfiable core [2022-02-11 02:43:24,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 02:43:24,322 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-11 02:43:24,333 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:43:24,333 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-11 02:43:24,444 INFO L353 Elim1Store]: treesize reduction 88, result has 20.7 percent of original size [2022-02-11 02:43:24,444 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-11 02:43:24,474 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-02-11 02:43:24,474 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-11 02:43:24,504 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-11 02:43:24,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 02:43:24,625 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-11 02:43:24,915 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-11 02:43:24,915 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632853733] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 02:43:24,915 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 02:43:24,915 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 35 [2022-02-11 02:43:24,915 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207965987] [2022-02-11 02:43:24,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 02:43:24,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-02-11 02:43:24,916 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 02:43:24,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-02-11 02:43:24,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1008, Unknown=0, NotChecked=0, Total=1190 [2022-02-11 02:43:24,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:24,917 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 02:43:24,917 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-11 02:43:24,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:24,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-11 02:43:24,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-02-11 02:43:24,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2022-02-11 02:43:24,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2022-02-11 02:43:24,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 85 states. [2022-02-11 02:43:24,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:43:24,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:32,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:32,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-11 02:43:32,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:43:32,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-02-11 02:43:32,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-02-11 02:43:32,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-02-11 02:43:32,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:43:32,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2022-02-11 02:43:32,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-02-11 02:43:33,135 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,SelfDestructingSolverStorable28 [2022-02-11 02:43:33,136 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 02:43:33,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:43:33,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1838239499, now seen corresponding path program 4 times [2022-02-11 02:43:33,136 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:43:33,136 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843701100] [2022-02-11 02:43:33,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:43:33,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:43:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:43:33,324 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-11 02:43:33,324 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:43:33,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843701100] [2022-02-11 02:43:33,324 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843701100] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 02:43:33,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602630421] [2022-02-11 02:43:33,324 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-11 02:43:33,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 02:43:33,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 02:43:33,326 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-11 02:43:33,326 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-11 02:43:33,485 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-11 02:43:33,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 02:43:33,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-11 02:43:33,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 02:43:33,695 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-11 02:43:33,695 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-11 02:43:33,695 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602630421] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 02:43:33,695 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-11 02:43:33,696 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [19] total 20 [2022-02-11 02:43:33,696 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044338470] [2022-02-11 02:43:33,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 02:43:33,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-11 02:43:33,696 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 02:43:33,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-11 02:43:33,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-02-11 02:43:33,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:33,697 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 02:43:33,697 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-11 02:43:33,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:33,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-11 02:43:33,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:43:33,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 76 states. [2022-02-11 02:43:33,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2022-02-11 02:43:33,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2022-02-11 02:43:33,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:43:33,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 155 states. [2022-02-11 02:43:33,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:34,741 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_2025 Int) (v_ArrVal_2024 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_149| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2024) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_149|) c_~data~0.offset) v_ArrVal_2025) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_149|)))) (= (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-11 02:43:35,433 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_2025 Int) (v_ArrVal_2024 (Array Int Int)) (|v_thrThread2of2ForFork0_~c~0#1_149| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2024) c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_149|) c_~data~0.offset) v_ArrVal_2025) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1) (not (<= c_~next~0 |v_thrThread2of2ForFork0_~c~0#1_149|)))) (< |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-11 02:43:35,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:35,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-11 02:43:35,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:43:35,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-02-11 02:43:35,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-02-11 02:43:35,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-02-11 02:43:35,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:43:35,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2022-02-11 02:43:35,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 02:43:35,726 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-11 02:43:35,909 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-11 02:43:35,910 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 02:43:35,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:43:35,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2031707968, now seen corresponding path program 5 times [2022-02-11 02:43:35,910 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:43:35,910 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670690404] [2022-02-11 02:43:35,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:43:35,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:43:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:43:36,050 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-11 02:43:36,050 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:43:36,050 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670690404] [2022-02-11 02:43:36,050 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670690404] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 02:43:36,050 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 02:43:36,050 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-11 02:43:36,050 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818772169] [2022-02-11 02:43:36,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 02:43:36,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-11 02:43:36,051 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 02:43:36,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-11 02:43:36,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2022-02-11 02:43:36,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:36,051 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 02:43:36,051 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-11 02:43:36,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:36,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-11 02:43:36,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:43:36,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 86 states. [2022-02-11 02:43:36,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2022-02-11 02:43:36,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 118 states. [2022-02-11 02:43:36,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:43:36,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 178 states. [2022-02-11 02:43:36,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 02:43:36,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:36,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:36,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-11 02:43:36,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:43:36,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-02-11 02:43:36,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-02-11 02:43:36,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-02-11 02:43:36,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:43:36,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2022-02-11 02:43:36,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 02:43:36,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:43:36,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-02-11 02:43:36,254 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 02:43:36,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:43:36,254 INFO L85 PathProgramCache]: Analyzing trace with hash -977844965, now seen corresponding path program 6 times [2022-02-11 02:43:36,254 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:43:36,254 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197052054] [2022-02-11 02:43:36,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:43:36,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:43:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:43:36,480 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-11 02:43:36,481 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:43:36,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197052054] [2022-02-11 02:43:36,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197052054] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 02:43:36,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366208781] [2022-02-11 02:43:36,481 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-11 02:43:36,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 02:43:36,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 02:43:36,482 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-11 02:43:36,483 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-11 02:43:36,881 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-02-11 02:43:36,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 02:43:36,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-11 02:43:36,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 02:43:37,265 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-11 02:43:37,302 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:43:37,303 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-11 02:43:37,308 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-11 02:43:37,338 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-11 02:43:37,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 02:43:37,756 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-11 02:43:37,756 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366208781] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 02:43:37,756 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 02:43:37,757 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 49 [2022-02-11 02:43:37,757 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526440412] [2022-02-11 02:43:37,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 02:43:37,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-02-11 02:43:37,757 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 02:43:37,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-02-11 02:43:37,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=490, Invalid=1862, Unknown=0, NotChecked=0, Total=2352 [2022-02-11 02:43:37,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:37,758 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 02:43:37,759 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-11 02:43:37,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:37,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-11 02:43:37,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:43:37,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 86 states. [2022-02-11 02:43:37,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2022-02-11 02:43:37,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 118 states. [2022-02-11 02:43:37,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:43:37,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 182 states. [2022-02-11 02:43:37,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 02:43:37,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:43:37,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:39,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:39,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-11 02:43:39,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:43:39,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-02-11 02:43:39,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-02-11 02:43:39,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-02-11 02:43:39,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:43:39,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2022-02-11 02:43:39,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 02:43:39,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:43:39,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-02-11 02:43:39,734 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-11 02:43:39,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 02:43:39,915 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 02:43:39,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:43:39,915 INFO L85 PathProgramCache]: Analyzing trace with hash -201255048, now seen corresponding path program 2 times [2022-02-11 02:43:39,915 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:43:39,915 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44514147] [2022-02-11 02:43:39,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:43:39,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:43:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:43:40,086 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-11 02:43:40,086 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:43:40,086 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44514147] [2022-02-11 02:43:40,087 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44514147] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 02:43:40,087 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043946084] [2022-02-11 02:43:40,087 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-11 02:43:40,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 02:43:40,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 02:43:40,089 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-11 02:43:40,090 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-11 02:43:40,297 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-11 02:43:40,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 02:43:40,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-11 02:43:40,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 02:43:40,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 735 proven. 0 refuted. 0 times theorem prover too weak. 475 trivial. 0 not checked. [2022-02-11 02:43:40,740 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-11 02:43:40,740 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043946084] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 02:43:40,740 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-11 02:43:40,740 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [16] total 18 [2022-02-11 02:43:40,740 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058001214] [2022-02-11 02:43:40,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 02:43:40,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-11 02:43:40,741 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 02:43:40,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-11 02:43:40,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-02-11 02:43:40,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:40,741 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 02:43:40,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 16.0) internal successors, (224), 14 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 02:43:40,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:40,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-11 02:43:40,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:43:40,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 86 states. [2022-02-11 02:43:40,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 105 states. [2022-02-11 02:43:40,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 118 states. [2022-02-11 02:43:40,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:43:40,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 182 states. [2022-02-11 02:43:40,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 02:43:40,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:43:40,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2022-02-11 02:43:40,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:42,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 02:43:42,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-11 02:43:42,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-11 02:43:42,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-02-11 02:43:42,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-02-11 02:43:42,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-02-11 02:43:42,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-11 02:43:42,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2022-02-11 02:43:42,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 02:43:42,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:43:42,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-02-11 02:43:42,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-11 02:43:42,172 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-11 02:43:42,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 02:43:42,368 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 02:43:42,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 02:43:42,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2118196124, now seen corresponding path program 3 times [2022-02-11 02:43:42,368 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 02:43:42,368 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573013071] [2022-02-11 02:43:42,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 02:43:42,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 02:43:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 02:43:42,886 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-11 02:43:42,886 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 02:43:42,886 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573013071] [2022-02-11 02:43:42,887 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573013071] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 02:43:42,887 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175655138] [2022-02-11 02:43:42,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-11 02:43:42,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 02:43:42,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 02:43:42,888 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-11 02:43:42,888 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-11 02:43:44,528 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-02-11 02:43:44,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 02:43:44,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 69 conjunts are in the unsatisfiable core [2022-02-11 02:43:44,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 02:43:45,121 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-11 02:43:45,166 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:43:45,167 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-11 02:43:45,182 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:43:45,182 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-11 02:43:45,266 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:43:45,266 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-11 02:43:45,279 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:43:45,279 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-11 02:43:45,364 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:43:45,364 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 02:43:45,379 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:43:45,379 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-11 02:43:45,465 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:43:45,465 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-11 02:43:45,479 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:43:45,479 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-11 02:43:45,547 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-02-11 02:43:45,547 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-11 02:43:45,588 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-02-11 02:43:45,589 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-11 02:43:45,694 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-02-11 02:43:45,694 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 33 treesize of output 40 [2022-02-11 02:43:45,745 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-02-11 02:43:45,745 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 40 treesize of output 47 [2022-02-11 02:43:45,845 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-02-11 02:43:45,845 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 33 treesize of output 40 [2022-02-11 02:43:45,866 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-02-11 02:43:45,866 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 40 treesize of output 47 [2022-02-11 02:43:45,969 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-02-11 02:43:45,969 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 33 treesize of output 40 [2022-02-11 02:43:45,989 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-02-11 02:43:45,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 40 treesize of output 47 [2022-02-11 02:43:46,094 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-02-11 02:43:46,095 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 33 treesize of output 40 [2022-02-11 02:43:46,118 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-02-11 02:43:46,118 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 40 treesize of output 47 [2022-02-11 02:43:46,291 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-02-11 02:43:46,291 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-11 02:43:46,295 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-11 02:43:46,338 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 273 proven. 416 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-02-11 02:43:46,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 02:44:08,779 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_181| Int) (|v_thrThread2of2ForFork0_~c~0#1_182| Int) (|v_thrThread2of2ForFork0_~c~0#1_180| Int) (|thrThread2of2ForFork0_~c~0#1| Int) (|v_thrThread2of2ForFork0_~c~0#1_179| Int)) (or (not (<= (+ 1 |v_thrThread2of2ForFork0_~c~0#1_182|) |v_thrThread2of2ForFork0_~c~0#1_181|)) (not (<= (+ |thrThread2of2ForFork0_~c~0#1| 1) |v_thrThread2of2ForFork0_~c~0#1_182|)) (not (<= (+ 1 |v_thrThread2of2ForFork0_~c~0#1_181|) |v_thrThread2of2ForFork0_~c~0#1_180|)) (not (<= (+ 1 |v_thrThread2of2ForFork0_~c~0#1_180|) |v_thrThread2of2ForFork0_~c~0#1_179|)) (let ((.cse0 (+ 1 |v_thrThread2of2ForFork0_~c~0#1_179|))) (and (or (<= |c_thrThread2of2ForFork0_~end~0#1| .cse0) (forall ((v_ArrVal_2850 Int) (v_ArrVal_2863 Int) (v_ArrVal_2855 Int) (v_ArrVal_2858 Int) (v_ArrVal_2846 Int)) (= (select (store (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_2846) (+ c_~data~0.offset (* 4 |v_thrThread2of2ForFork0_~c~0#1_182|)) v_ArrVal_2850) (+ c_~data~0.offset (* 4 |v_thrThread2of2ForFork0_~c~0#1_181|)) v_ArrVal_2855) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_180|) c_~data~0.offset) v_ArrVal_2858) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_179|) c_~data~0.offset) v_ArrVal_2863) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (or (not (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread2of2ForFork0_~end~0#1|)) (not (<= .cse0 |c_thrThread1of2ForFork0_~c~0#1|))))))) is different from false [2022-02-11 02:44:12,815 WARN L322 ript$VariableManager]: TermVariable |thrThread2of2ForFork0_~c~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 02:46:04,182 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_185| Int)) (or (forall ((|v_thrThread2of2ForFork0_~c~0#1_181| Int) (|v_thrThread2of2ForFork0_~c~0#1_182| Int) (|v_thrThread2of2ForFork0_~c~0#1_180| Int) (|v_thrThread2of2ForFork0_~c~0#1_184| Int) (|v_thrThread2of2ForFork0_~c~0#1_179| Int)) (or (not (<= (+ 1 |v_thrThread2of2ForFork0_~c~0#1_182|) |v_thrThread2of2ForFork0_~c~0#1_181|)) (not (<= (+ 1 |v_thrThread2of2ForFork0_~c~0#1_184|) |v_thrThread2of2ForFork0_~c~0#1_182|)) (not (<= (+ 1 |v_thrThread2of2ForFork0_~c~0#1_181|) |v_thrThread2of2ForFork0_~c~0#1_180|)) (not (<= (+ 1 |v_thrThread2of2ForFork0_~c~0#1_180|) |v_thrThread2of2ForFork0_~c~0#1_179|)) (let ((.cse0 (+ 1 |v_thrThread2of2ForFork0_~c~0#1_179|))) (and (or (<= |c_thrThread2of2ForFork0_~end~0#1| .cse0) (forall ((v_ArrVal_2850 Int) (v_ArrVal_2863 Int) (v_ArrVal_2843 Int) (v_ArrVal_2855 Int) (v_ArrVal_2858 Int) (v_ArrVal_2846 Int)) (= (select (store (store (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_185|) c_~data~0.offset) v_ArrVal_2843) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_184|) c_~data~0.offset) v_ArrVal_2846) (+ c_~data~0.offset (* 4 |v_thrThread2of2ForFork0_~c~0#1_182|)) v_ArrVal_2850) (+ c_~data~0.offset (* 4 |v_thrThread2of2ForFork0_~c~0#1_181|)) v_ArrVal_2855) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_180|) c_~data~0.offset) v_ArrVal_2858) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_179|) c_~data~0.offset) v_ArrVal_2863) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (or (not (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread2of2ForFork0_~end~0#1|)) (not (<= .cse0 |c_thrThread1of2ForFork0_~c~0#1|))))))) (not (<= |v_thrThread2of2ForFork0_~c~0#1_185| (+ |c_thrThread2of2ForFork0_~c~0#1| 1))))) is different from false [2022-02-11 02:46:13,176 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_181| Int) (|v_thrThread2of2ForFork0_~c~0#1_182| Int) (|v_thrThread2of2ForFork0_~c~0#1_180| Int) (|v_thrThread2of2ForFork0_~c~0#1_185| Int) (|v_thrThread2of2ForFork0_~c~0#1_184| Int) (|v_thrThread2of2ForFork0_~c~0#1_179| Int)) (or (not (<= (+ 1 |v_thrThread2of2ForFork0_~c~0#1_182|) |v_thrThread2of2ForFork0_~c~0#1_181|)) (let ((.cse0 (+ 1 |v_thrThread2of2ForFork0_~c~0#1_179|))) (and (or (not (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread2of2ForFork0_~end~0#1|)) (not (<= .cse0 |c_thrThread1of2ForFork0_~c~0#1|))) (or (<= |c_thrThread2of2ForFork0_~end~0#1| .cse0) (forall ((v_ArrVal_2839 Int) (v_ArrVal_2850 Int) (v_ArrVal_2863 Int) (v_ArrVal_2843 Int) (v_ArrVal_2855 Int) (v_ArrVal_2858 Int) (v_ArrVal_2846 Int)) (= (select (store (store (store (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_2839) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_185|) c_~data~0.offset) v_ArrVal_2843) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_184|) c_~data~0.offset) v_ArrVal_2846) (+ c_~data~0.offset (* 4 |v_thrThread2of2ForFork0_~c~0#1_182|)) v_ArrVal_2850) (+ c_~data~0.offset (* 4 |v_thrThread2of2ForFork0_~c~0#1_181|)) v_ArrVal_2855) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_180|) c_~data~0.offset) v_ArrVal_2858) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_179|) c_~data~0.offset) v_ArrVal_2863) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))))) (not (<= (+ 1 |v_thrThread2of2ForFork0_~c~0#1_184|) |v_thrThread2of2ForFork0_~c~0#1_182|)) (not (<= (+ 1 |v_thrThread2of2ForFork0_~c~0#1_181|) |v_thrThread2of2ForFork0_~c~0#1_180|)) (not (<= (+ 1 |v_thrThread2of2ForFork0_~c~0#1_180|) |v_thrThread2of2ForFork0_~c~0#1_179|)) (not (<= |v_thrThread2of2ForFork0_~c~0#1_185| (+ |c_thrThread2of2ForFork0_~c~0#1| 1))))) is different from false [2022-02-11 02:46:17,273 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_186| Int)) (or (not (<= |v_thrThread2of2ForFork0_~c~0#1_186| (+ |c_thrThread2of2ForFork0_~c~0#1| 1))) (forall ((|v_thrThread2of2ForFork0_~c~0#1_181| Int) (|v_thrThread2of2ForFork0_~c~0#1_182| Int) (|v_thrThread2of2ForFork0_~c~0#1_180| Int) (|v_thrThread2of2ForFork0_~c~0#1_185| Int) (|v_thrThread2of2ForFork0_~c~0#1_184| Int) (|v_thrThread2of2ForFork0_~c~0#1_179| Int)) (or (not (<= (+ 1 |v_thrThread2of2ForFork0_~c~0#1_182|) |v_thrThread2of2ForFork0_~c~0#1_181|)) (not (<= (+ 1 |v_thrThread2of2ForFork0_~c~0#1_184|) |v_thrThread2of2ForFork0_~c~0#1_182|)) (not (<= (+ 1 |v_thrThread2of2ForFork0_~c~0#1_181|) |v_thrThread2of2ForFork0_~c~0#1_180|)) (not (<= (+ 1 |v_thrThread2of2ForFork0_~c~0#1_180|) |v_thrThread2of2ForFork0_~c~0#1_179|)) (let ((.cse0 (+ 1 |v_thrThread2of2ForFork0_~c~0#1_179|))) (and (or (<= |c_thrThread2of2ForFork0_~end~0#1| .cse0) (forall ((v_ArrVal_2839 Int) (v_ArrVal_2850 Int) (v_ArrVal_2863 Int) (v_ArrVal_2843 Int) (v_ArrVal_2855 Int) (v_ArrVal_2858 Int) (v_ArrVal_2846 Int)) (= (select (store (store (store (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* 4 |v_thrThread2of2ForFork0_~c~0#1_186|)) v_ArrVal_2839) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_185|) c_~data~0.offset) v_ArrVal_2843) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_184|) c_~data~0.offset) v_ArrVal_2846) (+ c_~data~0.offset (* 4 |v_thrThread2of2ForFork0_~c~0#1_182|)) v_ArrVal_2850) (+ c_~data~0.offset (* 4 |v_thrThread2of2ForFork0_~c~0#1_181|)) v_ArrVal_2855) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_180|) c_~data~0.offset) v_ArrVal_2858) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_179|) c_~data~0.offset) v_ArrVal_2863) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (or (not (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread2of2ForFork0_~end~0#1|)) (not (<= .cse0 |c_thrThread1of2ForFork0_~c~0#1|))))) (not (<= |v_thrThread2of2ForFork0_~c~0#1_185| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_186|))))))) is different from false [2022-02-11 02:48:39,707 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_187| Int)) (or (not (<= |v_thrThread2of2ForFork0_~c~0#1_187| (+ |c_thrThread2of2ForFork0_~c~0#1| 1))) (forall ((|v_thrThread2of2ForFork0_~c~0#1_181| Int) (|v_thrThread2of2ForFork0_~c~0#1_182| Int) (|v_thrThread2of2ForFork0_~c~0#1_180| Int) (|v_thrThread2of2ForFork0_~c~0#1_185| Int) (|v_thrThread2of2ForFork0_~c~0#1_186| Int) (|v_thrThread2of2ForFork0_~c~0#1_184| Int) (|v_thrThread2of2ForFork0_~c~0#1_179| Int)) (or (not (<= (+ 1 |v_thrThread2of2ForFork0_~c~0#1_182|) |v_thrThread2of2ForFork0_~c~0#1_181|)) (let ((.cse0 (+ 1 |v_thrThread2of2ForFork0_~c~0#1_179|))) (and (or (not (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread2of2ForFork0_~end~0#1|)) (not (<= .cse0 |c_thrThread1of2ForFork0_~c~0#1|))) (or (<= |c_thrThread2of2ForFork0_~end~0#1| .cse0) (forall ((v_ArrVal_2839 Int) (v_ArrVal_2850 Int) (v_ArrVal_2863 Int) (v_ArrVal_2843 Int) (v_ArrVal_2834 Int) (v_ArrVal_2855 Int) (v_ArrVal_2858 Int) (v_ArrVal_2846 Int)) (= (select (store (store (store (store (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ c_~data~0.offset (* 4 |v_thrThread2of2ForFork0_~c~0#1_187|)) v_ArrVal_2834) (+ c_~data~0.offset (* 4 |v_thrThread2of2ForFork0_~c~0#1_186|)) v_ArrVal_2839) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_185|) c_~data~0.offset) v_ArrVal_2843) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_184|) c_~data~0.offset) v_ArrVal_2846) (+ c_~data~0.offset (* 4 |v_thrThread2of2ForFork0_~c~0#1_182|)) v_ArrVal_2850) (+ c_~data~0.offset (* 4 |v_thrThread2of2ForFork0_~c~0#1_181|)) v_ArrVal_2855) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_180|) c_~data~0.offset) v_ArrVal_2858) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_179|) c_~data~0.offset) v_ArrVal_2863) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))))) (not (<= (+ 1 |v_thrThread2of2ForFork0_~c~0#1_184|) |v_thrThread2of2ForFork0_~c~0#1_182|)) (not (<= (+ 1 |v_thrThread2of2ForFork0_~c~0#1_181|) |v_thrThread2of2ForFork0_~c~0#1_180|)) (not (<= (+ 1 |v_thrThread2of2ForFork0_~c~0#1_180|) |v_thrThread2of2ForFork0_~c~0#1_179|)) (not (<= |v_thrThread2of2ForFork0_~c~0#1_186| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_187|))) (not (<= |v_thrThread2of2ForFork0_~c~0#1_185| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_186|))))))) is different from false [2022-02-11 02:49:06,828 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thrThread2of2ForFork0_~c~0#1_181| Int) (|v_thrThread2of2ForFork0_~c~0#1_182| Int) (|v_thrThread2of2ForFork0_~c~0#1_180| Int) (|v_thrThread2of2ForFork0_~c~0#1_185| Int) (|v_thrThread2of2ForFork0_~c~0#1_186| Int) (|v_thrThread2of2ForFork0_~c~0#1_184| Int) (|v_thrThread2of2ForFork0_~c~0#1_179| Int) (|v_thrThread2of2ForFork0_~c~0#1_187| Int)) (or (not (<= (+ 1 |v_thrThread2of2ForFork0_~c~0#1_182|) |v_thrThread2of2ForFork0_~c~0#1_181|)) (not (<= |v_thrThread2of2ForFork0_~c~0#1_187| (+ |c_thrThread2of2ForFork0_~c~0#1| 1))) (not (<= (+ 1 |v_thrThread2of2ForFork0_~c~0#1_184|) |v_thrThread2of2ForFork0_~c~0#1_182|)) (not (<= (+ 1 |v_thrThread2of2ForFork0_~c~0#1_181|) |v_thrThread2of2ForFork0_~c~0#1_180|)) (not (<= (+ 1 |v_thrThread2of2ForFork0_~c~0#1_180|) |v_thrThread2of2ForFork0_~c~0#1_179|)) (let ((.cse0 (+ 1 |v_thrThread2of2ForFork0_~c~0#1_179|))) (and (or (<= |c_thrThread2of2ForFork0_~end~0#1| .cse0) (forall ((v_ArrVal_2839 Int) (v_ArrVal_2850 Int) (v_ArrVal_2830 Int) (v_ArrVal_2863 Int) (v_ArrVal_2843 Int) (v_ArrVal_2834 Int) (v_ArrVal_2855 Int) (v_ArrVal_2858 Int) (v_ArrVal_2846 Int)) (= (select (store (store (store (store (store (store (store (store (store (select |c_#memory_int| c_~data~0.base) (+ (* |c_thrThread2of2ForFork0_~c~0#1| 4) c_~data~0.offset) v_ArrVal_2830) (+ c_~data~0.offset (* 4 |v_thrThread2of2ForFork0_~c~0#1_187|)) v_ArrVal_2834) (+ c_~data~0.offset (* 4 |v_thrThread2of2ForFork0_~c~0#1_186|)) v_ArrVal_2839) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_185|) c_~data~0.offset) v_ArrVal_2843) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_184|) c_~data~0.offset) v_ArrVal_2846) (+ c_~data~0.offset (* 4 |v_thrThread2of2ForFork0_~c~0#1_182|)) v_ArrVal_2850) (+ c_~data~0.offset (* 4 |v_thrThread2of2ForFork0_~c~0#1_181|)) v_ArrVal_2855) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_180|) c_~data~0.offset) v_ArrVal_2858) (+ (* 4 |v_thrThread2of2ForFork0_~c~0#1_179|) c_~data~0.offset) v_ArrVal_2863) (+ (* |c_thrThread1of2ForFork0_~c~0#1| 4) c_~data~0.offset)) 1))) (or (not (< |c_thrThread1of2ForFork0_~c~0#1| |c_thrThread2of2ForFork0_~end~0#1|)) (not (<= .cse0 |c_thrThread1of2ForFork0_~c~0#1|))))) (not (<= |v_thrThread2of2ForFork0_~c~0#1_186| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_187|))) (not (<= |v_thrThread2of2ForFork0_~c~0#1_185| (+ 1 |v_thrThread2of2ForFork0_~c~0#1_186|))))) is different from false [2022-02-11 02:49:11,079 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 99 treesize of output 97 Received shutdown request... [2022-02-11 02:53:15,836 WARN L244 SmtUtils]: Removed 1 from assertion stack [2022-02-11 02:53:15,841 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-11 02:53:15,862 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-11 02:53:15,871 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-11 02:53:15,873 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-11 02:53:15,873 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (17)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-11 02:53:15,876 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-11 02:53:15,876 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-11 02:53:16,041 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-11 02:53:16,041 WARN L594 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 287 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-8-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2022-02-11 02:53:16,043 INFO L733 BasicCegarLoop]: Path program histogram: [6, 3, 1, 1, 1, 1] [2022-02-11 02:53:16,043 INFO L313 ceAbstractionStarter]: Result for error location thrThread1of2ForFork0 was TIMEOUT (2/3) [2022-02-11 02:53:16,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-11 02:53:16,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 02:53:16,047 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-02-11 02:53:16,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (27)] Waiting until timeout for monitored process [2022-02-11 02:53:16,048 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (27)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-11 02:53:16,053 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-02-11 02:53:16,053 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-11 02:53:16,053 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-11 02:53:16,053 WARN L594 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was constructing initial abstraction,while executing PartialOrderCegarLoop. [2022-02-11 02:53:16,053 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 1 remaining) [2022-02-11 02:53:16,054 INFO L733 BasicCegarLoop]: Path program histogram: [] [2022-02-11 02:53:16,054 INFO L313 ceAbstractionStarter]: Result for error location ULTIMATE.start was TIMEOUT (3/3) [2022-02-11 02:53:16,054 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2022-02-11 02:53:16,054 INFO L184 ceAbstractionStarter]: Computing trace abstraction results [2022-02-11 02:53:16,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.02 02:53:16 BasicIcfg [2022-02-11 02:53:16,059 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-11 02:53:16,059 INFO L158 Benchmark]: Toolchain (without parser) took 840653.37ms. Allocated memory was 172.0MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 120.3MB in the beginning and 573.6MB in the end (delta: -453.3MB). Peak memory consumption was 683.6MB. Max. memory is 8.0GB. [2022-02-11 02:53:16,059 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 172.0MB. Free memory is still 138.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-11 02:53:16,060 INFO L158 Benchmark]: CACSL2BoogieTranslator took 493.25ms. Allocated memory is still 172.0MB. Free memory was 120.0MB in the beginning and 131.3MB in the end (delta: -11.3MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. [2022-02-11 02:53:16,060 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.50ms. Allocated memory is still 172.0MB. Free memory was 131.3MB in the beginning and 129.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-11 02:53:16,060 INFO L158 Benchmark]: Boogie Preprocessor took 17.91ms. Allocated memory is still 172.0MB. Free memory was 129.2MB in the beginning and 127.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-11 02:53:16,060 INFO L158 Benchmark]: RCFGBuilder took 383.81ms. Allocated memory is still 172.0MB. Free memory was 127.7MB in the beginning and 113.5MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-02-11 02:53:16,060 INFO L158 Benchmark]: TraceAbstraction took 839708.02ms. Allocated memory was 172.0MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 113.0MB in the beginning and 573.6MB in the end (delta: -460.6MB). Peak memory consumption was 677.1MB. Max. memory is 8.0GB. [2022-02-11 02:53:16,061 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 172.0MB. Free memory is still 138.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 493.25ms. Allocated memory is still 172.0MB. Free memory was 120.0MB in the beginning and 131.3MB in the end (delta: -11.3MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.50ms. Allocated memory is still 172.0MB. Free memory was 131.3MB in the beginning and 129.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.91ms. Allocated memory is still 172.0MB. Free memory was 129.2MB in the beginning and 127.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 383.81ms. Allocated memory is still 172.0MB. Free memory was 127.7MB in the beginning and 113.5MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 839708.02ms. Allocated memory was 172.0MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 113.0MB in the beginning and 573.6MB in the end (delta: -460.6MB). Peak memory consumption was 677.1MB. 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: 37, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 6, negative conditional: 0, negative unconditional: 6, 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: 37, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 6, negative conditional: 0, negative unconditional: 6, 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: 303661, positive: 276556, positive conditional: 270658, positive unconditional: 5898, negative: 27105, negative conditional: 27023, negative unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 277034, positive: 276556, positive conditional: 270658, positive unconditional: 5898, 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: 277034, positive: 276556, positive conditional: 270658, positive unconditional: 5898, 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: 282667, positive: 276556, positive conditional: 270308, positive unconditional: 6248, negative: 6111, negative conditional: 5633, negative unconditional: 478, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 282667, positive: 276556, positive conditional: 152178, positive unconditional: 124378, negative: 6111, negative conditional: 3729, negative unconditional: 2382, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 282667, positive: 276556, positive conditional: 152178, positive unconditional: 124378, negative: 6111, negative conditional: 3729, negative unconditional: 2382, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5682, positive: 5171, positive conditional: 824, positive unconditional: 4347, negative: 511, negative conditional: 428, negative unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5682, positive: 4404, positive conditional: 0, positive unconditional: 4404, negative: 1278, negative conditional: 0, negative unconditional: 1278, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1278, positive: 767, positive conditional: 719, positive unconditional: 48, negative: 482, negative conditional: 399, negative unconditional: 83, unknown: 29, unknown conditional: 29, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1659, positive: 933, positive conditional: 843, positive unconditional: 91, negative: 665, negative conditional: 484, negative unconditional: 181, unknown: 61, unknown conditional: 61, unknown unconditional: 0] ], Cache Queries: [ total: 282667, positive: 271385, positive conditional: 151354, positive unconditional: 120031, negative: 5600, negative conditional: 3301, negative unconditional: 2299, unknown: 5682, unknown conditional: 1252, unknown unconditional: 4430] , Statistics on independence cache: Total cache size (in pairs): 5682, Positive cache size: 5171, Positive conditional cache size: 824, Positive unconditional cache size: 4347, Negative cache size: 511, Negative conditional cache size: 428, Negative unconditional cache size: 83, Eliminated conditions: 120034, Maximal queried relation: 14, Independence queries for same thread: 26627 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.5s, Number of persistent set computation: 3044, Number of trivial persistent sets: 1516, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5980, positive: 5898, positive conditional: 0, positive unconditional: 5898, 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: 303661, positive: 276556, positive conditional: 270658, positive unconditional: 5898, negative: 27105, negative conditional: 27023, negative unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 277034, positive: 276556, positive conditional: 270658, positive unconditional: 5898, 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: 277034, positive: 276556, positive conditional: 270658, positive unconditional: 5898, 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: 282667, positive: 276556, positive conditional: 270308, positive unconditional: 6248, negative: 6111, negative conditional: 5633, negative unconditional: 478, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 282667, positive: 276556, positive conditional: 152178, positive unconditional: 124378, negative: 6111, negative conditional: 3729, negative unconditional: 2382, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 282667, positive: 276556, positive conditional: 152178, positive unconditional: 124378, negative: 6111, negative conditional: 3729, negative unconditional: 2382, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5682, positive: 5171, positive conditional: 824, positive unconditional: 4347, negative: 511, negative conditional: 428, negative unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5682, positive: 4404, positive conditional: 0, positive unconditional: 4404, negative: 1278, negative conditional: 0, negative unconditional: 1278, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1278, positive: 767, positive conditional: 719, positive unconditional: 48, negative: 482, negative conditional: 399, negative unconditional: 83, unknown: 29, unknown conditional: 29, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1659, positive: 933, positive conditional: 843, positive unconditional: 91, negative: 665, negative conditional: 484, negative unconditional: 181, unknown: 61, unknown conditional: 61, unknown unconditional: 0] ], Cache Queries: [ total: 282667, positive: 271385, positive conditional: 151354, positive unconditional: 120031, negative: 5600, negative conditional: 3301, negative unconditional: 2299, unknown: 5682, unknown conditional: 1252, unknown unconditional: 4430] , Statistics on independence cache: Total cache size (in pairs): 5682, Positive cache size: 5171, Positive conditional cache size: 824, Positive unconditional cache size: 4347, Negative cache size: 511, Negative conditional cache size: 428, Negative unconditional cache size: 83, Eliminated conditions: 120034, Maximal queried relation: 14, Independence queries for same thread: 26627 - 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: 91160, positive: 83912, positive conditional: 78639, positive unconditional: 5273, negative: 7248, negative conditional: 7171, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84031, positive: 83912, positive conditional: 78639, positive unconditional: 5273, negative: 119, negative conditional: 42, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 84031, positive: 83912, positive conditional: 78639, positive unconditional: 5273, negative: 119, negative conditional: 42, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84838, positive: 83912, positive conditional: 78445, positive unconditional: 5467, negative: 926, negative conditional: 807, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 84838, positive: 83912, positive conditional: 45179, positive unconditional: 38733, negative: 926, negative conditional: 656, negative unconditional: 270, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 84838, positive: 83912, positive conditional: 45179, positive unconditional: 38733, negative: 926, negative conditional: 656, negative unconditional: 270, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4522, positive: 4205, positive conditional: 261, positive unconditional: 3944, negative: 317, negative conditional: 240, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4522, positive: 3900, positive conditional: 0, positive unconditional: 3900, negative: 622, negative conditional: 0, negative unconditional: 622, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 622, positive: 305, positive conditional: 258, positive unconditional: 47, negative: 316, negative conditional: 239, negative unconditional: 77, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 678, positive: 337, positive conditional: 269, positive unconditional: 68, negative: 338, negative conditional: 263, negative unconditional: 75, unknown: 2, unknown conditional: 2, unknown unconditional: 0] ], Cache Queries: [ total: 84838, positive: 79707, positive conditional: 44918, positive unconditional: 34789, negative: 609, negative conditional: 416, negative unconditional: 193, unknown: 4522, unknown conditional: 501, unknown unconditional: 4021] , Statistics on independence cache: Total cache size (in pairs): 4522, Positive cache size: 4205, Positive conditional cache size: 261, Positive unconditional cache size: 3944, Negative cache size: 317, Negative conditional cache size: 240, Negative unconditional cache size: 77, Eliminated conditions: 33417, Maximal queried relation: 8, Independence queries for same thread: 7129 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 1632, Number of trivial persistent sets: 1255, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5350, positive: 5273, positive conditional: 0, positive unconditional: 5273, negative: 77, negative conditional: 0, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 91160, positive: 83912, positive conditional: 78639, positive unconditional: 5273, negative: 7248, negative conditional: 7171, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84031, positive: 83912, positive conditional: 78639, positive unconditional: 5273, negative: 119, negative conditional: 42, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 84031, positive: 83912, positive conditional: 78639, positive unconditional: 5273, negative: 119, negative conditional: 42, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84838, positive: 83912, positive conditional: 78445, positive unconditional: 5467, negative: 926, negative conditional: 807, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 84838, positive: 83912, positive conditional: 45179, positive unconditional: 38733, negative: 926, negative conditional: 656, negative unconditional: 270, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 84838, positive: 83912, positive conditional: 45179, positive unconditional: 38733, negative: 926, negative conditional: 656, negative unconditional: 270, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4522, positive: 4205, positive conditional: 261, positive unconditional: 3944, negative: 317, negative conditional: 240, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4522, positive: 3900, positive conditional: 0, positive unconditional: 3900, negative: 622, negative conditional: 0, negative unconditional: 622, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 622, positive: 305, positive conditional: 258, positive unconditional: 47, negative: 316, negative conditional: 239, negative unconditional: 77, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 678, positive: 337, positive conditional: 269, positive unconditional: 68, negative: 338, negative conditional: 263, negative unconditional: 75, unknown: 2, unknown conditional: 2, unknown unconditional: 0] ], Cache Queries: [ total: 84838, positive: 79707, positive conditional: 44918, positive unconditional: 34789, negative: 609, negative conditional: 416, negative unconditional: 193, unknown: 4522, unknown conditional: 501, unknown unconditional: 4021] , Statistics on independence cache: Total cache size (in pairs): 4522, Positive cache size: 4205, Positive conditional cache size: 261, Positive unconditional cache size: 3944, Negative cache size: 317, Negative conditional cache size: 240, Negative unconditional cache size: 77, Eliminated conditions: 33417, Maximal queried relation: 8, Independence queries for same thread: 7129 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 998]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 287 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-8-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 1047]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was constructing initial abstraction,while executing PartialOrderCegarLoop. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 3 procedures, 116 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 46 ConstructedInterpolants, 0 QuantifiedInterpolants, 46 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 5/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 2 thread instances CFG has 4 procedures, 149 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thrThread2of2ForFork0 with 1 thread instances CFG has 4 procedures, 149 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 227.0s, OverallIterations: 19, TraceHistogramMax: 0, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 180.9s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 1203, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 40.5s InterpolantComputationTime, 6203 NumberOfCodeBlocks, 5808 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 8358 ConstructedInterpolants, 86 QuantifiedInterpolants, 50403 SizeOfPredicates, 128 NumberOfNonLiveVariables, 4965 ConjunctsInSsa, 320 ConjunctsInUnsatCore, 43 InterpolantComputations, 8 PerfectInterpolantSequences, 7142/16907 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thrThread1of2ForFork0 with 1 thread instances CFG has 4 procedures, 149 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 612.0s, OverallIterations: 13, TraceHistogramMax: 0, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 24.4s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 679, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 3774 NumberOfCodeBlocks, 3652 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 4816 ConstructedInterpolants, 47 QuantifiedInterpolants, 26795 SizeOfPredicates, 80 NumberOfNonLiveVariables, 3211 ConjunctsInSsa, 169 ConjunctsInUnsatCore, 26 InterpolantComputations, 6 PerfectInterpolantSequences, 8469/12695 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown