/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 19:05:53,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 19:05:53,338 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 19:05:53,362 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 19:05:53,362 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 19:05:53,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 19:05:53,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 19:05:53,378 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 19:05:53,380 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 19:05:53,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 19:05:53,382 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 19:05:53,382 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 19:05:53,382 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 19:05:53,383 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 19:05:53,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 19:05:53,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 19:05:53,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 19:05:53,391 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 19:05:53,398 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 19:05:53,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 19:05:53,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 19:05:53,404 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 19:05:53,405 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 19:05:53,405 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 19:05:53,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 19:05:53,407 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 19:05:53,408 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 19:05:53,408 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 19:05:53,409 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 19:05:53,409 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 19:05:53,409 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 19:05:53,410 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 19:05:53,410 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 19:05:53,411 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 19:05:53,412 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 19:05:53,412 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 19:05:53,413 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 19:05:53,413 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 19:05:53,413 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 19:05:53,414 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 19:05:53,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 19:05:53,417 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 19:05:53,438 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 19:05:53,438 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 19:05:53,439 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 19:05:53,439 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 19:05:53,440 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 19:05:53,440 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 19:05:53,440 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 19:05:53,440 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 19:05:53,440 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 19:05:53,440 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 19:05:53,441 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 19:05:53,441 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 19:05:53,441 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 19:05:53,441 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 19:05:53,441 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 19:05:53,441 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 19:05:53,441 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 19:05:53,441 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 19:05:53,441 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 19:05:53,442 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 19:05:53,442 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 19:05:53,442 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 19:05:53,442 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 19:05:53,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:05:53,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 19:05:53,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 19:05:53,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 19:05:53,443 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 19:05:53,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 19:05:53,443 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 19:05:53,443 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 19:05:53,443 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 19:05:53,443 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 19:05:53,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 19:05:53,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 19:05:53,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 19:05:53,672 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-15 19:05:53,673 INFO L275 PluginConnector]: CDTParser initialized [2022-03-15 19:05:53,674 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue2.wvr.c [2022-03-15 19:05:53,725 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a752ee3a/cf0d2ea686c640f9bc3036de03550391/FLAG5f641f2d9 [2022-03-15 19:05:54,096 INFO L306 CDTParser]: Found 1 translation units. [2022-03-15 19:05:54,096 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue2.wvr.c [2022-03-15 19:05:54,101 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a752ee3a/cf0d2ea686c640f9bc3036de03550391/FLAG5f641f2d9 [2022-03-15 19:05:54,112 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a752ee3a/cf0d2ea686c640f9bc3036de03550391 [2022-03-15 19:05:54,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 19:05:54,119 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-15 19:05:54,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-15 19:05:54,121 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-15 19:05:54,127 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-15 19:05:54,127 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:05:54" (1/1) ... [2022-03-15 19:05:54,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@153ebb49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:05:54, skipping insertion in model container [2022-03-15 19:05:54,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 07:05:54" (1/1) ... [2022-03-15 19:05:54,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-15 19:05:54,146 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-15 19:05:54,360 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue2.wvr.c[2271,2284] [2022-03-15 19:05:54,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:05:54,392 INFO L203 MainTranslator]: Completed pre-run [2022-03-15 19:05:54,428 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue2.wvr.c[2271,2284] [2022-03-15 19:05:54,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-15 19:05:54,445 INFO L208 MainTranslator]: Completed translation [2022-03-15 19:05:54,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:05:54 WrapperNode [2022-03-15 19:05:54,446 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-15 19:05:54,447 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 19:05:54,447 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 19:05:54,448 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 19:05:54,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:05:54" (1/1) ... [2022-03-15 19:05:54,471 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:05:54" (1/1) ... [2022-03-15 19:05:54,502 INFO L137 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 138 [2022-03-15 19:05:54,502 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 19:05:54,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 19:05:54,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 19:05:54,503 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 19:05:54,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:05:54" (1/1) ... [2022-03-15 19:05:54,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:05:54" (1/1) ... [2022-03-15 19:05:54,524 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:05:54" (1/1) ... [2022-03-15 19:05:54,525 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:05:54" (1/1) ... [2022-03-15 19:05:54,536 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:05:54" (1/1) ... [2022-03-15 19:05:54,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:05:54" (1/1) ... [2022-03-15 19:05:54,542 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:05:54" (1/1) ... [2022-03-15 19:05:54,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 19:05:54,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 19:05:54,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 19:05:54,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 19:05:54,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:05:54" (1/1) ... [2022-03-15 19:05:54,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 19:05:54,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:05:54,572 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 19:05:54,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 19:05:54,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-15 19:05:54,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-15 19:05:54,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-15 19:05:54,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-15 19:05:54,607 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 19:05:54,607 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 19:05:54,607 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 19:05:54,607 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 19:05:54,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-15 19:05:54,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-15 19:05:54,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-15 19:05:54,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-03-15 19:05:54,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 19:05:54,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 19:05:54,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-15 19:05:54,611 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 19:05:54,686 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 19:05:54,687 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 19:05:54,949 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 19:05:55,050 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 19:05:55,051 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-15 19:05:55,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:05:55 BoogieIcfgContainer [2022-03-15 19:05:55,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 19:05:55,058 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 19:05:55,058 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 19:05:55,061 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 19:05:55,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 07:05:54" (1/3) ... [2022-03-15 19:05:55,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@542cab4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:05:55, skipping insertion in model container [2022-03-15 19:05:55,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 07:05:54" (2/3) ... [2022-03-15 19:05:55,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@542cab4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 07:05:55, skipping insertion in model container [2022-03-15 19:05:55,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 07:05:55" (3/3) ... [2022-03-15 19:05:55,064 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue2.wvr.c [2022-03-15 19:05:55,068 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 19:05:55,069 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 19:05:55,069 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 19:05:55,069 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 19:05:55,123 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,124 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,124 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,124 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,125 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,125 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,125 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,125 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,125 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,125 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,126 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,126 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,126 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,126 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,126 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,126 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,126 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,127 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,127 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,127 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,128 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,128 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,128 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,128 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,128 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,128 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,129 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,129 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,129 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,129 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,130 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,130 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,130 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,130 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,131 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,131 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,131 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,131 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,131 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,131 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,132 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,132 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,132 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,132 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,133 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,133 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,133 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,133 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,133 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,133 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,134 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,134 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,134 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,134 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,134 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,134 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,134 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,134 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,135 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,139 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,139 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,139 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,139 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,140 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,140 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,140 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,140 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,140 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,140 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,141 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,141 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,141 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,141 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,141 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,141 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,141 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,141 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,142 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,142 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,144 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,144 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,144 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,145 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,145 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,145 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,145 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,145 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,145 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,146 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,146 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,146 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,147 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,147 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,148 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,148 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,148 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,148 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,148 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,148 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,149 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,149 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,149 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,149 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,149 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,149 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:05:55,152 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-15 19:05:55,186 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 19:05:55,192 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, 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=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 19:05:55,192 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-15 19:05:55,202 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 19:05:55,209 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 117 transitions, 250 flow [2022-03-15 19:05:55,212 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 117 transitions, 250 flow [2022-03-15 19:05:55,213 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 115 places, 117 transitions, 250 flow [2022-03-15 19:05:55,255 INFO L129 PetriNetUnfolder]: 9/115 cut-off events. [2022-03-15 19:05:55,255 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-03-15 19:05:55,258 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 115 events. 9/115 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-03-15 19:05:55,259 INFO L116 LiptonReduction]: Number of co-enabled transitions 500 [2022-03-15 19:05:59,287 INFO L131 LiptonReduction]: Checked pairs total: 596 [2022-03-15 19:05:59,287 INFO L133 LiptonReduction]: Total number of compositions: 114 [2022-03-15 19:05:59,293 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 24 places, 20 transitions, 56 flow [2022-03-15 19:05:59,306 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:59,307 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:59,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 19:05:59,312 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:05:59,312 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:05:59,313 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:05:59,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:05:59,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1628212080, now seen corresponding path program 1 times [2022-03-15 19:05:59,331 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:05:59,332 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499599719] [2022-03-15 19:05:59,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:05:59,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:05:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:05:59,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:05:59,567 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:05:59,567 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499599719] [2022-03-15 19:05:59,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499599719] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:05:59,568 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:05:59,568 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 19:05:59,569 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2121647672] [2022-03-15 19:05:59,569 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:05:59,575 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:05:59,597 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 58 transitions. [2022-03-15 19:05:59,597 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:05:59,828 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:05:59,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 19:05:59,830 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:05:59,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 19:05:59,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:05:59,851 INFO L87 Difference]: Start difference. First operand has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 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) Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:59,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:05:59,888 INFO L93 Difference]: Finished difference Result 62 states and 136 transitions. [2022-03-15 19:05:59,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 19:05:59,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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) Word has length 14 [2022-03-15 19:05:59,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:05:59,899 INFO L225 Difference]: With dead ends: 62 [2022-03-15 19:05:59,900 INFO L226 Difference]: Without dead ends: 57 [2022-03-15 19:05:59,900 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 19:05:59,904 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:05:59,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 4 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:05:59,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-03-15 19:05:59,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-03-15 19:05:59,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 2.25) internal successors, (126), 56 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:59,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 126 transitions. [2022-03-15 19:05:59,941 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 126 transitions. Word has length 14 [2022-03-15 19:05:59,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:05:59,941 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 126 transitions. [2022-03-15 19:05:59,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:05:59,942 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 126 transitions. [2022-03-15 19:05:59,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 19:05:59,943 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:05:59,944 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:05:59,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 19:05:59,944 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:05:59,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:05:59,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1985475477, now seen corresponding path program 1 times [2022-03-15 19:05:59,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:05:59,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228875446] [2022-03-15 19:05:59,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:05:59,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:00,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:00,080 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:00,080 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228875446] [2022-03-15 19:06:00,080 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228875446] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:06:00,080 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:06:00,080 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 19:06:00,080 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [612040859] [2022-03-15 19:06:00,080 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:00,082 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:00,087 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 75 transitions. [2022-03-15 19:06:00,087 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:00,457 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [372#(< |thread2Thread1of1ForFork1_~i~1#1| ~N~0), 373#(or (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (< (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0)), 374#(or (<= ~N~0 0) (< 1 ~N~0))] [2022-03-15 19:06:00,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 19:06:00,458 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:00,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 19:06:00,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-03-15 19:06:00,459 INFO L87 Difference]: Start difference. First operand 57 states and 126 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:00,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:00,573 INFO L93 Difference]: Finished difference Result 109 states and 227 transitions. [2022-03-15 19:06:00,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 19:06:00,573 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 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) Word has length 15 [2022-03-15 19:06:00,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:00,574 INFO L225 Difference]: With dead ends: 109 [2022-03-15 19:06:00,574 INFO L226 Difference]: Without dead ends: 99 [2022-03-15 19:06:00,575 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-15 19:06:00,576 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 40 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:00,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 15 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:06:00,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-03-15 19:06:00,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2022-03-15 19:06:00,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 2.244186046511628) internal successors, (193), 86 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:00,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 193 transitions. [2022-03-15 19:06:00,587 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 193 transitions. Word has length 15 [2022-03-15 19:06:00,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:00,587 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 193 transitions. [2022-03-15 19:06:00,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:00,587 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 193 transitions. [2022-03-15 19:06:00,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 19:06:00,588 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:00,588 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:00,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 19:06:00,589 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:06:00,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:00,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1573371461, now seen corresponding path program 1 times [2022-03-15 19:06:00,591 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:00,592 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886484596] [2022-03-15 19:06:00,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:00,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:00,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:00,651 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:00,652 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886484596] [2022-03-15 19:06:00,652 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886484596] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 19:06:00,652 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 19:06:00,652 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 19:06:00,652 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1315503925] [2022-03-15 19:06:00,652 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:00,654 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:00,657 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 43 transitions. [2022-03-15 19:06:00,657 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:00,730 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [667#(< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)] [2022-03-15 19:06:00,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-15 19:06:00,730 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:00,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-15 19:06:00,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-15 19:06:00,731 INFO L87 Difference]: Start difference. First operand 87 states and 193 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:00,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:00,806 INFO L93 Difference]: Finished difference Result 75 states and 155 transitions. [2022-03-15 19:06:00,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:06:00,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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) Word has length 15 [2022-03-15 19:06:00,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:00,807 INFO L225 Difference]: With dead ends: 75 [2022-03-15 19:06:00,807 INFO L226 Difference]: Without dead ends: 58 [2022-03-15 19:06:00,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-03-15 19:06:00,808 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 19 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:00,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 10 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:06:00,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-03-15 19:06:00,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-03-15 19:06:00,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 2.2280701754385963) internal successors, (127), 57 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:00,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 127 transitions. [2022-03-15 19:06:00,814 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 127 transitions. Word has length 15 [2022-03-15 19:06:00,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:00,814 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 127 transitions. [2022-03-15 19:06:00,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:00,815 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 127 transitions. [2022-03-15 19:06:00,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 19:06:00,815 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:00,815 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:00,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 19:06:00,816 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:06:00,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:00,816 INFO L85 PathProgramCache]: Analyzing trace with hash 268474802, now seen corresponding path program 1 times [2022-03-15 19:06:00,817 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:00,817 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188860412] [2022-03-15 19:06:00,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:00,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:00,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:06:00,864 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:00,864 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188860412] [2022-03-15 19:06:00,865 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188860412] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:00,865 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016335859] [2022-03-15 19:06:00,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:00,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:00,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:00,872 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:00,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 19:06:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:00,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 19:06:00,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:01,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:06:01,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:01,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:06:01,046 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016335859] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:01,047 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:06:01,047 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2022-03-15 19:06:01,047 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [626533276] [2022-03-15 19:06:01,047 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:01,049 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:01,054 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 76 transitions. [2022-03-15 19:06:01,054 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:01,352 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:06:01,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 19:06:01,353 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:01,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 19:06:01,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-03-15 19:06:01,353 INFO L87 Difference]: Start difference. First operand 58 states and 127 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:01,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:01,403 INFO L93 Difference]: Finished difference Result 52 states and 115 transitions. [2022-03-15 19:06:01,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:06:01,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 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) Word has length 16 [2022-03-15 19:06:01,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:01,404 INFO L225 Difference]: With dead ends: 52 [2022-03-15 19:06:01,404 INFO L226 Difference]: Without dead ends: 52 [2022-03-15 19:06:01,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-03-15 19:06:01,406 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 22 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:01,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 4 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:06:01,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-03-15 19:06:01,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2022-03-15 19:06:01,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:01,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 95 transitions. [2022-03-15 19:06:01,410 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 95 transitions. Word has length 16 [2022-03-15 19:06:01,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:01,410 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 95 transitions. [2022-03-15 19:06:01,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:01,411 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 95 transitions. [2022-03-15 19:06:01,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 19:06:01,411 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:01,412 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:01,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 19:06:01,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:01,634 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:06:01,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:01,635 INFO L85 PathProgramCache]: Analyzing trace with hash 680578818, now seen corresponding path program 1 times [2022-03-15 19:06:01,637 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:01,637 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278312361] [2022-03-15 19:06:01,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:01,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:01,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:06:01,731 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:01,731 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278312361] [2022-03-15 19:06:01,731 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278312361] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:01,731 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456119867] [2022-03-15 19:06:01,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:01,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:01,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:01,740 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:01,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 19:06:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:01,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 19:06:01,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:01,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:06:01,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:01,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:06:01,920 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456119867] provided 1 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:01,921 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-03-15 19:06:01,921 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2022-03-15 19:06:01,921 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1892336573] [2022-03-15 19:06:01,921 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:01,924 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:01,929 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 44 transitions. [2022-03-15 19:06:01,929 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:02,029 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:06:02,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 19:06:02,029 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:02,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 19:06:02,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-15 19:06:02,030 INFO L87 Difference]: Start difference. First operand 44 states and 95 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:02,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:02,072 INFO L93 Difference]: Finished difference Result 54 states and 119 transitions. [2022-03-15 19:06:02,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 19:06:02,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 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) Word has length 16 [2022-03-15 19:06:02,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:02,074 INFO L225 Difference]: With dead ends: 54 [2022-03-15 19:06:02,074 INFO L226 Difference]: Without dead ends: 54 [2022-03-15 19:06:02,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-03-15 19:06:02,076 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 22 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:02,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 4 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 19:06:02,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-03-15 19:06:02,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-03-15 19:06:02,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 2.2452830188679247) internal successors, (119), 53 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:02,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 119 transitions. [2022-03-15 19:06:02,087 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 119 transitions. Word has length 16 [2022-03-15 19:06:02,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:02,088 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 119 transitions. [2022-03-15 19:06:02,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:02,088 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 119 transitions. [2022-03-15 19:06:02,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 19:06:02,089 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:02,089 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:02,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-15 19:06:02,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:02,300 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:06:02,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:02,300 INFO L85 PathProgramCache]: Analyzing trace with hash 867565625, now seen corresponding path program 1 times [2022-03-15 19:06:02,303 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:02,303 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536922481] [2022-03-15 19:06:02,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:02,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:02,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:06:02,517 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:02,517 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536922481] [2022-03-15 19:06:02,517 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536922481] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:02,517 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832321569] [2022-03-15 19:06:02,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:02,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:02,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:02,519 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:02,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 19:06:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:02,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 54 conjunts are in the unsatisfiable core [2022-03-15 19:06:02,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:02,646 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-15 19:06:02,681 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-03-15 19:06:02,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:06:02,775 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-03-15 19:06:02,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:02,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:02,949 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_133 (Array Int Int))) (<= c_~counter~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) c_~A~0.offset))) (forall ((v_ArrVal_133 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) c_~A~0.offset) (+ c_~counter~0 1)))) is different from false [2022-03-15 19:06:02,971 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_133 (Array Int Int))) (<= (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~counter~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) c_~A~0.offset))) (forall ((v_ArrVal_133 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) c_~A~0.offset) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~counter~0 1)))) is different from false [2022-03-15 19:06:02,982 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_133 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) c_~A~0.offset) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~counter~0 1))) (forall ((v_ArrVal_133 (Array Int Int))) (<= (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~counter~0) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) c_~A~0.offset)))) is different from false [2022-03-15 19:06:03,005 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_133 (Array Int Int)) (v_ArrVal_132 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_132))) (<= (+ c_~counter~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (forall ((v_ArrVal_133 (Array Int Int)) (v_ArrVal_132 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_132))) (< (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ c_~counter~0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1))))) is different from false [2022-03-15 19:06:03,021 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:06:03,022 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 46 treesize of output 35 [2022-03-15 19:06:03,032 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 286 treesize of output 254 [2022-03-15 19:06:03,038 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 254 treesize of output 238 [2022-03-15 19:06:03,046 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 238 treesize of output 222 [2022-03-15 19:06:03,127 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:06:03,128 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 36 [2022-03-15 19:06:03,130 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:06:03,133 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 64 treesize of output 56 [2022-03-15 19:06:03,136 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 56 treesize of output 52 [2022-03-15 19:06:03,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-15 19:06:03,172 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832321569] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:03,172 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:03,172 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 20 [2022-03-15 19:06:03,173 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1716636240] [2022-03-15 19:06:03,173 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:03,176 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:03,181 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 56 transitions. [2022-03-15 19:06:03,182 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:03,679 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [1486#(and (or (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 1))) (or (<= ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0))), 1487#(and (or (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) ~counter~0) (<= ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (or (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~counter~0 1)) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) ~A~0.offset))))] [2022-03-15 19:06:03,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:06:03,680 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:03,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:06:03,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=305, Unknown=4, NotChecked=156, Total=552 [2022-03-15 19:06:03,680 INFO L87 Difference]: Start difference. First operand 54 states and 119 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:03,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:03,830 INFO L93 Difference]: Finished difference Result 89 states and 198 transitions. [2022-03-15 19:06:03,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 19:06:03,830 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 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) Word has length 17 [2022-03-15 19:06:03,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:03,831 INFO L225 Difference]: With dead ends: 89 [2022-03-15 19:06:03,831 INFO L226 Difference]: Without dead ends: 84 [2022-03-15 19:06:03,831 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=373, Unknown=4, NotChecked=172, Total=650 [2022-03-15 19:06:03,832 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 36 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:03,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 14 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:06:03,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-03-15 19:06:03,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 72. [2022-03-15 19:06:03,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 2.3098591549295775) internal successors, (164), 71 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:03,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 164 transitions. [2022-03-15 19:06:03,836 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 164 transitions. Word has length 17 [2022-03-15 19:06:03,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:03,836 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 164 transitions. [2022-03-15 19:06:03,836 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:03,837 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 164 transitions. [2022-03-15 19:06:03,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 19:06:03,837 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:03,837 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:03,863 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-03-15 19:06:04,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:04,047 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:06:04,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:04,048 INFO L85 PathProgramCache]: Analyzing trace with hash 607128157, now seen corresponding path program 2 times [2022-03-15 19:06:04,050 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:04,050 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372375506] [2022-03-15 19:06:04,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:04,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:04,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:06:04,221 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:04,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372375506] [2022-03-15 19:06:04,221 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372375506] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:04,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943350985] [2022-03-15 19:06:04,221 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:06:04,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:04,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:04,222 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:04,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 19:06:04,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:06:04,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:04,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 19:06:04,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:04,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:06:04,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:04,483 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:06:04,483 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 22 treesize of output 23 [2022-03-15 19:06:04,503 INFO L353 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2022-03-15 19:06:04,503 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 21 treesize of output 10 [2022-03-15 19:06:04,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:06:04,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943350985] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:04,558 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:04,558 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 4] total 9 [2022-03-15 19:06:04,559 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1061840831] [2022-03-15 19:06:04,559 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:04,561 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:04,566 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 62 transitions. [2022-03-15 19:06:04,566 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:05,181 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [1836#(and (or (not (<= ~counter~0 (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 2147483648))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (or (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0))), 1839#(and (= ~A~0.offset 0) (= ~counter~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 1835#(and (or (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0) (< 0 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1))) (or (< 2147483647 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 0))), 1838#(and (= ~A~0.offset 0) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 0) (<= 0 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)))), 1834#(and (or (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~counter~0 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) ~counter~0) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (or (not (<= ~counter~0 (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~counter~0 2147483648))))), 1837#(and (or (< 2147483647 ~counter~0) (<= ~counter~0 0) (not (<= ~counter~0 (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)))) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~counter~0 2147483648)))) (or (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) ~counter~0) (< 0 (+ ~counter~0 1)) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (+ ~counter~0 2147483648) 0))), 1832#(and (or (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0) (< 0 (+ ~counter~0 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (or (< 2147483647 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0))), 1833#(and (or (not (<= ~counter~0 (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 2147483648))) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (or (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0)))] [2022-03-15 19:06:05,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:06:05,182 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:05,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:06:05,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2022-03-15 19:06:05,183 INFO L87 Difference]: Start difference. First operand 72 states and 164 transitions. Second operand has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:05,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:05,397 INFO L93 Difference]: Finished difference Result 93 states and 213 transitions. [2022-03-15 19:06:05,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 19:06:05,397 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 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) Word has length 17 [2022-03-15 19:06:05,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:05,398 INFO L225 Difference]: With dead ends: 93 [2022-03-15 19:06:05,398 INFO L226 Difference]: Without dead ends: 88 [2022-03-15 19:06:05,398 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2022-03-15 19:06:05,399 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 43 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:05,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 16 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:06:05,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-03-15 19:06:05,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2022-03-15 19:06:05,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 2.329113924050633) internal successors, (184), 79 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:05,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 184 transitions. [2022-03-15 19:06:05,403 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 184 transitions. Word has length 17 [2022-03-15 19:06:05,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:05,404 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 184 transitions. [2022-03-15 19:06:05,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:05,404 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 184 transitions. [2022-03-15 19:06:05,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 19:06:05,404 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:05,405 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:05,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 19:06:05,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:05,605 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:06:05,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:05,606 INFO L85 PathProgramCache]: Analyzing trace with hash -801199277, now seen corresponding path program 3 times [2022-03-15 19:06:05,606 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:05,607 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525711352] [2022-03-15 19:06:05,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:05,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:05,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:06:05,730 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:05,730 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525711352] [2022-03-15 19:06:05,730 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525711352] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:05,730 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935917053] [2022-03-15 19:06:05,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:06:05,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:05,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:05,731 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:05,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 19:06:05,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:06:05,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:05,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-15 19:06:05,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:05,891 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 13 treesize of output 5 [2022-03-15 19:06:05,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:06:05,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:05,977 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:06:05,978 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 22 treesize of output 23 [2022-03-15 19:06:05,992 INFO L353 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2022-03-15 19:06:05,993 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 21 treesize of output 10 [2022-03-15 19:06:06,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:06:06,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935917053] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:06,056 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:06,056 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 4] total 9 [2022-03-15 19:06:06,056 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [16446236] [2022-03-15 19:06:06,056 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:06,059 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:06,067 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 74 transitions. [2022-03-15 19:06:06,067 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:06,957 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [2208#(and (or (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 1))) (or (<= ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0))), 2215#(and (= ~A~0.offset 0) (= ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))), 2214#(and (= ~A~0.offset 0) (= ~counter~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 2213#(and (or (< 2147483647 ~counter~0) (not (<= 0 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (<= ~counter~0 0) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647))) (or (< 2147483647 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< 0 (+ ~counter~0 1)) (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0) (< (+ ~counter~0 2147483648) 0))), 2211#(and (or (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~counter~0 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0) (< 2147483647 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (or (not (<= 0 (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) ~A~0.offset)))), 2210#(and (or (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< 2147483647 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (or (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (<= 0 (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)))), 2212#(and (or (not (<= 0 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647))) (or (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< 2147483647 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)) (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0))), 2209#(and (or (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) ~counter~0) (<= ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (or (< (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~counter~0 1)) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) ~A~0.offset))))] [2022-03-15 19:06:06,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 19:06:06,957 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:06,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 19:06:06,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2022-03-15 19:06:06,958 INFO L87 Difference]: Start difference. First operand 80 states and 184 transitions. Second operand has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:07,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:07,216 INFO L93 Difference]: Finished difference Result 121 states and 278 transitions. [2022-03-15 19:06:07,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 19:06:07,216 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 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) Word has length 17 [2022-03-15 19:06:07,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:07,217 INFO L225 Difference]: With dead ends: 121 [2022-03-15 19:06:07,217 INFO L226 Difference]: Without dead ends: 116 [2022-03-15 19:06:07,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2022-03-15 19:06:07,218 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 49 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:07,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 23 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 19:06:07,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-03-15 19:06:07,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 80. [2022-03-15 19:06:07,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 2.329113924050633) internal successors, (184), 79 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:07,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 184 transitions. [2022-03-15 19:06:07,223 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 184 transitions. Word has length 17 [2022-03-15 19:06:07,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:07,223 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 184 transitions. [2022-03-15 19:06:07,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:07,223 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 184 transitions. [2022-03-15 19:06:07,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:06:07,224 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:07,224 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:07,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-15 19:06:07,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:07,440 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:06:07,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:07,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1925777950, now seen corresponding path program 4 times [2022-03-15 19:06:07,441 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:07,441 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001724576] [2022-03-15 19:06:07,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:07,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:07,506 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:06:07,506 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:07,506 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001724576] [2022-03-15 19:06:07,506 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001724576] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:07,506 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800428531] [2022-03-15 19:06:07,506 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:06:07,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:07,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:07,508 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:07,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 19:06:07,588 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:06:07,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:07,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:06:07,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:07,651 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:06:07,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:07,709 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:06:07,709 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800428531] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:07,709 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:07,709 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-03-15 19:06:07,710 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1581580927] [2022-03-15 19:06:07,710 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:07,712 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:07,722 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 68 transitions. [2022-03-15 19:06:07,722 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:08,135 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [2621#(< |thread2Thread1of1ForFork1_~i~1#1| ~N~0), 2623#(or (<= ~N~0 (+ |thread2Thread1of1ForFork1_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0)), 2624#(or (<= ~N~0 1) (< 2 ~N~0)), 2622#(or (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (< (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0))] [2022-03-15 19:06:08,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 19:06:08,136 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:08,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 19:06:08,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-03-15 19:06:08,136 INFO L87 Difference]: Start difference. First operand 80 states and 184 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:08,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:08,279 INFO L93 Difference]: Finished difference Result 156 states and 340 transitions. [2022-03-15 19:06:08,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:06:08,280 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 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) Word has length 18 [2022-03-15 19:06:08,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:08,281 INFO L225 Difference]: With dead ends: 156 [2022-03-15 19:06:08,281 INFO L226 Difference]: Without dead ends: 142 [2022-03-15 19:06:08,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2022-03-15 19:06:08,282 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 61 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:08,282 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 23 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:06:08,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-03-15 19:06:08,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 128. [2022-03-15 19:06:08,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 2.3149606299212597) internal successors, (294), 127 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:08,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 294 transitions. [2022-03-15 19:06:08,287 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 294 transitions. Word has length 18 [2022-03-15 19:06:08,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:08,287 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 294 transitions. [2022-03-15 19:06:08,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:08,287 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 294 transitions. [2022-03-15 19:06:08,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 19:06:08,288 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:08,288 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:08,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 19:06:08,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:08,489 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:06:08,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:08,489 INFO L85 PathProgramCache]: Analyzing trace with hash -2035455342, now seen corresponding path program 5 times [2022-03-15 19:06:08,490 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:08,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235218067] [2022-03-15 19:06:08,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:08,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:08,539 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:06:08,539 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:08,539 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235218067] [2022-03-15 19:06:08,539 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235218067] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:08,540 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410618573] [2022-03-15 19:06:08,540 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:06:08,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:08,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:08,541 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:08,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 19:06:08,622 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:06:08,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:08,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:06:08,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:08,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:06:08,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:08,743 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:06:08,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410618573] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:08,743 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:08,743 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-03-15 19:06:08,746 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1891316225] [2022-03-15 19:06:08,746 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:08,748 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:08,753 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 57 transitions. [2022-03-15 19:06:08,753 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:08,885 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [3159#(< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)] [2022-03-15 19:06:08,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 19:06:08,886 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:08,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 19:06:08,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-03-15 19:06:08,887 INFO L87 Difference]: Start difference. First operand 128 states and 294 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:08,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:08,996 INFO L93 Difference]: Finished difference Result 112 states and 243 transitions. [2022-03-15 19:06:08,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:06:08,996 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 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) Word has length 18 [2022-03-15 19:06:08,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:08,997 INFO L225 Difference]: With dead ends: 112 [2022-03-15 19:06:08,997 INFO L226 Difference]: Without dead ends: 81 [2022-03-15 19:06:08,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2022-03-15 19:06:08,998 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 38 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:08,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 21 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:06:08,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-03-15 19:06:09,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-03-15 19:06:09,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 2.3125) internal successors, (185), 80 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:09,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 185 transitions. [2022-03-15 19:06:09,002 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 185 transitions. Word has length 18 [2022-03-15 19:06:09,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:09,003 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 185 transitions. [2022-03-15 19:06:09,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:09,003 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 185 transitions. [2022-03-15 19:06:09,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:06:09,003 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:09,003 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:09,031 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-03-15 19:06:09,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:09,211 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:06:09,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:09,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2011721925, now seen corresponding path program 6 times [2022-03-15 19:06:09,213 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:09,213 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263300371] [2022-03-15 19:06:09,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:09,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:09,285 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:06:09,285 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:09,285 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263300371] [2022-03-15 19:06:09,285 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263300371] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:09,285 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564328912] [2022-03-15 19:06:09,285 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:06:09,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:09,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:09,287 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:09,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 19:06:09,367 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 19:06:09,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:09,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:06:09,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:09,442 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:06:09,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:09,507 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:06:09,507 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564328912] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:09,507 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:09,507 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-03-15 19:06:09,507 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1598777840] [2022-03-15 19:06:09,507 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:09,510 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:09,516 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 69 transitions. [2022-03-15 19:06:09,516 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:09,768 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:06:09,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 19:06:09,768 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:09,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 19:06:09,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-03-15 19:06:09,769 INFO L87 Difference]: Start difference. First operand 81 states and 185 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:09,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:09,864 INFO L93 Difference]: Finished difference Result 77 states and 174 transitions. [2022-03-15 19:06:09,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 19:06:09,864 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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) Word has length 19 [2022-03-15 19:06:09,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:09,865 INFO L225 Difference]: With dead ends: 77 [2022-03-15 19:06:09,865 INFO L226 Difference]: Without dead ends: 77 [2022-03-15 19:06:09,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-03-15 19:06:09,866 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 49 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:09,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 9 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:06:09,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-03-15 19:06:09,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2022-03-15 19:06:09,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 2.25) internal successors, (144), 64 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:09,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 144 transitions. [2022-03-15 19:06:09,868 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 144 transitions. Word has length 19 [2022-03-15 19:06:09,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:09,868 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 144 transitions. [2022-03-15 19:06:09,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:09,869 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 144 transitions. [2022-03-15 19:06:09,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 19:06:09,869 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:09,869 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:09,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-15 19:06:10,083 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,SelfDestructingSolverStorable10 [2022-03-15 19:06:10,083 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:06:10,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:10,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2121399317, now seen corresponding path program 7 times [2022-03-15 19:06:10,085 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:10,085 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541649663] [2022-03-15 19:06:10,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:10,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:10,152 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:06:10,153 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:10,153 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541649663] [2022-03-15 19:06:10,153 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541649663] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:10,153 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210125341] [2022-03-15 19:06:10,153 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:06:10,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:10,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:10,154 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:10,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 19:06:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:10,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:06:10,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:10,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:06:10,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:10,388 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:06:10,388 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210125341] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:10,388 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:10,388 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-03-15 19:06:10,388 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1116904365] [2022-03-15 19:06:10,388 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:10,390 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:10,400 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 58 transitions. [2022-03-15 19:06:10,400 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:10,681 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [3899#(or (<= ~N~0 0) (<= 2 ~N~0)), 3898#(or (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0))] [2022-03-15 19:06:10,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 19:06:10,681 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:10,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 19:06:10,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-03-15 19:06:10,682 INFO L87 Difference]: Start difference. First operand 65 states and 144 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:10,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:10,782 INFO L93 Difference]: Finished difference Result 77 states and 173 transitions. [2022-03-15 19:06:10,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 19:06:10,783 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 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) Word has length 19 [2022-03-15 19:06:10,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:10,784 INFO L225 Difference]: With dead ends: 77 [2022-03-15 19:06:10,784 INFO L226 Difference]: Without dead ends: 77 [2022-03-15 19:06:10,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2022-03-15 19:06:10,784 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 45 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:10,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 10 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:06:10,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-03-15 19:06:10,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-03-15 19:06:10,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 2.276315789473684) internal successors, (173), 76 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:10,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 173 transitions. [2022-03-15 19:06:10,787 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 173 transitions. Word has length 19 [2022-03-15 19:06:10,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:10,787 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 173 transitions. [2022-03-15 19:06:10,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:10,788 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 173 transitions. [2022-03-15 19:06:10,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:06:10,788 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:10,788 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:10,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 19:06:11,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:11,002 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:06:11,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:11,003 INFO L85 PathProgramCache]: Analyzing trace with hash -94410640, now seen corresponding path program 8 times [2022-03-15 19:06:11,003 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:11,003 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073699760] [2022-03-15 19:06:11,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:11,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:11,404 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:11,404 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:11,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073699760] [2022-03-15 19:06:11,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073699760] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:11,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193685815] [2022-03-15 19:06:11,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:06:11,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:11,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:11,406 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:11,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 19:06:11,503 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:06:11,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:11,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 76 conjunts are in the unsatisfiable core [2022-03-15 19:06:11,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:11,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:06:11,693 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 22 treesize of output 22 [2022-03-15 19:06:11,776 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 13 treesize of output 5 [2022-03-15 19:06:11,809 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:06:11,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:11,957 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_356 (Array Int Int))) (<= c_~counter~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) c_~A~0.base))) (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4)))))) (forall ((v_ArrVal_356 (Array Int Int))) (< (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) c_~A~0.base))) (+ (select .cse1 c_~A~0.offset) (select .cse1 (+ c_~A~0.offset 4)))) (+ c_~counter~0 1)))) is different from false [2022-03-15 19:06:11,980 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_356 (Array Int Int))) (<= (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~counter~0) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) c_~A~0.base))) (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 4)))))) (forall ((v_ArrVal_356 (Array Int Int))) (< (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_356) c_~A~0.base))) (+ (select .cse1 c_~A~0.offset) (select .cse1 (+ c_~A~0.offset 4)))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~counter~0 1)))) is different from false [2022-03-15 19:06:12,019 INFO L353 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2022-03-15 19:06:12,019 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 76 [2022-03-15 19:06:12,032 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 19:06:12,032 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 19 treesize of output 13 [2022-03-15 19:06:12,162 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:06:12,175 INFO L353 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2022-03-15 19:06:12,175 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 17 [2022-03-15 19:06:12,258 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-03-15 19:06:12,258 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193685815] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:12,258 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:12,258 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 27 [2022-03-15 19:06:12,258 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [744377402] [2022-03-15 19:06:12,258 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:12,260 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:12,267 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 70 transitions. [2022-03-15 19:06:12,267 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:13,928 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [4287#(and (or (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= ~counter~0 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (< 0 (+ ~counter~0 1)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 4286#(and (or (< 0 (+ ~counter~0 1)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (<= ~counter~0 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 4293#(and (or (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (or (<= ~counter~0 (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) 0))) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) 0)) ~counter~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (= ~A~0.offset 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 4285#(and (or (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) ~counter~0) (<= ~counter~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~counter~0) (<= ~N~0 1) (< 2 ~N~0)) (or (< (+ ~counter~0 2147483648) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) ~counter~0) (< (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ ~counter~0 1)) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~N~0 1) (< 2 ~N~0))), 4289#(and (or (<= ~counter~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0) (<= ~N~0 (+ |thread2Thread1of1ForFork1_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0)) (or (< (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 1)) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (<= ~N~0 (+ |thread2Thread1of1ForFork1_~i~1#1| 1)) (< (+ ~counter~0 2147483648) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0))), 4282#(and (or (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= ~counter~0 0)) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (< 0 (+ ~counter~0 1)))), 4283#(and (or (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 1)) (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (< (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0)) (or (<= ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (< (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0))), 4284#(and (or (< (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 1)) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (<= ~N~0 (+ |thread2Thread1of1ForFork1_~i~1#1| 1)) (< (+ ~counter~0 2147483648) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0)) (or (<= ~counter~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0) (<= ~N~0 (+ |thread2Thread1of1ForFork1_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0))), 4288#(and (or (<= ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (< (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0)) (or (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 1)) (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (< (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 4290#(and (or (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) ~counter~0) (<= ~counter~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~counter~0) (<= ~N~0 1) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0) (< 2 ~N~0)) (or (< (+ ~counter~0 2147483648) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) ~counter~0) (< (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ ~counter~0 1)) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~N~0 1) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0) (< 2 ~N~0))), 4291#(and (or (<= (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) ~counter~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (or (<= ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (= ~A~0.offset 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 4292#(and (or (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (or (= ~A~0.offset 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (<= ~counter~0 (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (= |thread2Thread1of1ForFork1_~i~1#1| 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)))] [2022-03-15 19:06:13,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:06:13,929 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:13,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:06:13,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1277, Unknown=2, NotChecked=150, Total=1640 [2022-03-15 19:06:13,930 INFO L87 Difference]: Start difference. First operand 77 states and 173 transitions. Second operand has 25 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 24 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:16,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:16,120 INFO L93 Difference]: Finished difference Result 176 states and 402 transitions. [2022-03-15 19:06:16,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 19:06:16,120 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 24 states have internal predecessors, (59), 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) Word has length 20 [2022-03-15 19:06:16,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:16,121 INFO L225 Difference]: With dead ends: 176 [2022-03-15 19:06:16,121 INFO L226 Difference]: Without dead ends: 171 [2022-03-15 19:06:16,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=560, Invalid=3352, Unknown=2, NotChecked=246, Total=4160 [2022-03-15 19:06:16,123 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 176 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:16,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 34 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:06:16,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-03-15 19:06:16,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 101. [2022-03-15 19:06:16,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 2.35) internal successors, (235), 100 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:16,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 235 transitions. [2022-03-15 19:06:16,127 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 235 transitions. Word has length 20 [2022-03-15 19:06:16,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:16,127 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 235 transitions. [2022-03-15 19:06:16,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 24 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:16,127 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 235 transitions. [2022-03-15 19:06:16,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:06:16,128 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:16,128 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:16,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-03-15 19:06:16,328 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,SelfDestructingSolverStorable12 [2022-03-15 19:06:16,328 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:06:16,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:16,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1962568016, now seen corresponding path program 9 times [2022-03-15 19:06:16,330 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:16,330 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786016447] [2022-03-15 19:06:16,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:16,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:16,746 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:16,746 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:16,746 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786016447] [2022-03-15 19:06:16,746 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786016447] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:16,746 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692091824] [2022-03-15 19:06:16,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:06:16,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:16,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:16,748 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:16,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 19:06:16,830 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:06:16,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:16,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 80 conjunts are in the unsatisfiable core [2022-03-15 19:06:16,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:16,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:06:16,966 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-03-15 19:06:17,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 13 treesize of output 5 [2022-03-15 19:06:17,113 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:06:17,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:17,272 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_391 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_391) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (+ (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 c_~A~0.offset))))) (forall ((v_ArrVal_391 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_391) c_~A~0.base))) (< (+ (select .cse1 (+ c_~A~0.offset 4)) (select .cse1 c_~A~0.offset)) (+ c_~counter~0 (select .cse1 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) 1))))) is different from false [2022-03-15 19:06:17,303 INFO L353 Elim1Store]: treesize reduction 39, result has 52.4 percent of original size [2022-03-15 19:06:17,303 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 83 [2022-03-15 19:06:17,323 INFO L353 Elim1Store]: treesize reduction 16, result has 59.0 percent of original size [2022-03-15 19:06:17,323 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 36 [2022-03-15 19:06:17,441 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:06:17,458 INFO L353 Elim1Store]: treesize reduction 73, result has 11.0 percent of original size [2022-03-15 19:06:17,462 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 17 [2022-03-15 19:06:17,569 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:06:17,569 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692091824] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:17,569 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:17,569 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 28 [2022-03-15 19:06:17,569 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1013615965] [2022-03-15 19:06:17,570 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:17,572 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:17,577 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 46 transitions. [2022-03-15 19:06:17,577 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:18,304 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [4868#(and (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (< 2147483647 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0)) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (< 0 (+ ~counter~0 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))))), 4867#(and (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (< 0 (+ ~counter~0 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (< 2147483647 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0))), 4870#(and (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 2147483648))) (< (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (not (<= ~counter~0 (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (not (< (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 2147483648))) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (not (<= ~counter~0 (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (< (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0)))), 4864#(and (or (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= ~counter~0 0)) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (< 0 (+ ~counter~0 1)))), 4871#(and (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= ~counter~0 (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))) (not (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ ~counter~0 2147483648))) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (< 1 ~N~0)) (< (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ ~counter~0 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< 2 ~N~0)) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= ~counter~0 (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (not (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ ~counter~0 2147483648))) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (< 1 ~N~0)) (< 2 ~N~0))), 4866#(and (or (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= ~counter~0 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (< 0 (+ ~counter~0 1)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 4865#(and (or (< 0 (+ ~counter~0 1)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (<= ~counter~0 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 4869#(and (or (not (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= ~counter~0 (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 2147483648))) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0)) (or (not (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= ~counter~0 (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 2147483648))) (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0)))] [2022-03-15 19:06:18,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 19:06:18,305 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:18,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 19:06:18,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1114, Unknown=1, NotChecked=70, Total=1406 [2022-03-15 19:06:18,305 INFO L87 Difference]: Start difference. First operand 101 states and 235 transitions. Second operand has 21 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:22,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:22,256 INFO L93 Difference]: Finished difference Result 322 states and 733 transitions. [2022-03-15 19:06:22,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-03-15 19:06:22,256 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 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) Word has length 20 [2022-03-15 19:06:22,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:22,258 INFO L225 Difference]: With dead ends: 322 [2022-03-15 19:06:22,258 INFO L226 Difference]: Without dead ends: 312 [2022-03-15 19:06:22,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1504 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=922, Invalid=4483, Unknown=1, NotChecked=144, Total=5550 [2022-03-15 19:06:22,260 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 192 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:22,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 26 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:06:22,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-03-15 19:06:22,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 128. [2022-03-15 19:06:22,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 2.574803149606299) internal successors, (327), 127 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-03-15 19:06:22,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 327 transitions. [2022-03-15 19:06:22,265 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 327 transitions. Word has length 20 [2022-03-15 19:06:22,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:22,265 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 327 transitions. [2022-03-15 19:06:22,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:22,266 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 327 transitions. [2022-03-15 19:06:22,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:06:22,266 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:22,266 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:22,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 19:06:22,483 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,SelfDestructingSolverStorable13 [2022-03-15 19:06:22,483 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:06:22,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:22,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1234822282, now seen corresponding path program 10 times [2022-03-15 19:06:22,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:22,484 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862615078] [2022-03-15 19:06:22,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:22,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:22,793 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:22,793 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:22,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862615078] [2022-03-15 19:06:22,793 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862615078] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:22,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150516412] [2022-03-15 19:06:22,793 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:06:22,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:22,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:22,796 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:22,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 19:06:22,887 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:06:22,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:22,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 69 conjunts are in the unsatisfiable core [2022-03-15 19:06:22,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:23,083 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:06:23,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:23,201 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:06:23,202 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 61 [2022-03-15 19:06:23,264 INFO L353 Elim1Store]: treesize reduction 94, result has 8.7 percent of original size [2022-03-15 19:06:23,264 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 18 [2022-03-15 19:06:23,337 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:06:23,338 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150516412] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:23,338 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:23,338 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 6] total 18 [2022-03-15 19:06:23,338 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1827799021] [2022-03-15 19:06:23,338 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:23,340 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:23,347 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 79 transitions. [2022-03-15 19:06:23,347 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:24,816 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [5666#(and (or (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (not (<= ~counter~0 (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 2147483648))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0) (< (+ ~counter~0 2147483648) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (or (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0) (< (+ ~counter~0 2147483648) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 1)) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0))), 5662#(and (= ~A~0.offset 0) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)) 0) (<= 0 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4)))), 5667#(and (or (< (+ ~counter~0 2147483648) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) ~counter~0) (< 0 (+ ~counter~0 1)) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~counter~0) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~counter~0) (< (+ ~counter~0 2147483648) 0)) (or (< 2147483647 ~counter~0) (< (+ ~counter~0 2147483648) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~counter~0) (<= ~counter~0 0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~counter~0) (not (<= ~counter~0 (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)))) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~counter~0 2147483648))))), 5668#(and (= ~A~0.offset 0) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 0) (<= 0 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|)), 5660#(and (or (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (<= ~counter~0 (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 2147483648))) (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))))), 5659#(and (or (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0) (< 2147483647 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< 2147483647 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0)) (or (not (<= 0 (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0) (< 0 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)))), 5665#(and (or (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 1)) (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (not (<= ~counter~0 (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 2147483648))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))))), 5664#(and (or (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ ~counter~0 2147483648) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~counter~0) (not (<= ~counter~0 (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)))) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~counter~0 2147483648)))) (or (< (+ ~counter~0 2147483648) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) ~counter~0) (< (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~counter~0) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))))), 5669#(and (= ~A~0.offset 0) (<= 0 ~counter~0) (<= ~counter~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 5550#(and (= ~A~0.offset 0) (= ~counter~0 0)), 5658#(and (or (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0) (< 0 (+ ~counter~0 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (or (< 2147483647 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0))), 5661#(and (or (< 2147483647 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 0) (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0) (< 2147483647 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))) (or (< 0 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 1)) (not (<= 0 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 0) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)))), 5663#(and (or (not (<= ~counter~0 (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 2147483648))) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0) (< (+ ~counter~0 2147483648) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (or (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0) (< (+ ~counter~0 2147483648) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))))] [2022-03-15 19:06:24,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:06:24,816 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:24,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:06:24,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=863, Unknown=0, NotChecked=0, Total=992 [2022-03-15 19:06:24,817 INFO L87 Difference]: Start difference. First operand 128 states and 327 transitions. Second operand has 26 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:25,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:25,472 INFO L93 Difference]: Finished difference Result 188 states and 465 transitions. [2022-03-15 19:06:25,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 19:06:25,475 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 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) Word has length 20 [2022-03-15 19:06:25,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:25,476 INFO L225 Difference]: With dead ends: 188 [2022-03-15 19:06:25,476 INFO L226 Difference]: Without dead ends: 178 [2022-03-15 19:06:25,476 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=209, Invalid=1273, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 19:06:25,477 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 58 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:25,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 50 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 19:06:25,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-03-15 19:06:25,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 142. [2022-03-15 19:06:25,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 2.5815602836879434) internal successors, (364), 141 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:25,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 364 transitions. [2022-03-15 19:06:25,482 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 364 transitions. Word has length 20 [2022-03-15 19:06:25,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:25,482 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 364 transitions. [2022-03-15 19:06:25,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:25,482 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 364 transitions. [2022-03-15 19:06:25,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:06:25,483 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:25,483 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:25,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 19:06:25,695 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,SelfDestructingSolverStorable14 [2022-03-15 19:06:25,696 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:06:25,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:25,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1943299776, now seen corresponding path program 11 times [2022-03-15 19:06:25,697 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:25,697 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977270010] [2022-03-15 19:06:25,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:25,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:25,919 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:06:25,919 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:25,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977270010] [2022-03-15 19:06:25,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977270010] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:25,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090995372] [2022-03-15 19:06:25,919 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:06:25,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:25,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:25,921 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:25,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 19:06:26,017 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:06:26,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:26,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 73 conjunts are in the unsatisfiable core [2022-03-15 19:06:26,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:26,167 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:06:26,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:26,279 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:06:26,279 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 61 [2022-03-15 19:06:26,345 INFO L353 Elim1Store]: treesize reduction 94, result has 8.7 percent of original size [2022-03-15 19:06:26,346 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 18 [2022-03-15 19:06:26,403 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:06:26,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090995372] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:26,404 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:26,404 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 6] total 14 [2022-03-15 19:06:26,404 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [609456175] [2022-03-15 19:06:26,404 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:26,406 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:26,410 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 64 transitions. [2022-03-15 19:06:26,410 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:27,464 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [6289#(and (or (not (<= 0 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648))) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 2147483647)) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 1)) (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< 2147483647 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))))), 6286#(and (or (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0) (< 0 (+ ~counter~0 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (or (< 2147483647 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0))), 6293#(and (= ~A~0.offset 0) (= ~counter~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 6295#(and (or (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) ~counter~0) (< 0 (+ ~counter~0 1)) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~counter~0) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (+ ~counter~0 2147483648) 0)) (or (< 2147483647 ~counter~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) ~counter~0) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~counter~0) (<= ~counter~0 0) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) ~A~0.offset)))), 6287#(and (or (not (<= ~counter~0 (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 2147483648))) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (or (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0))), 6292#(and (or (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (not (<= ~counter~0 (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 2147483648))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 1))) (or (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0))), 6290#(and (= ~A~0.offset 0) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 0) (<= 0 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (<= 1 |thread2Thread1of1ForFork1_~i~1#1|)), 6294#(and (or (< (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (<= ~counter~0 (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)))) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~counter~0 2147483648)))) (or (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) ~counter~0) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) ~A~0.offset)))), 6288#(and (or (not (<= 0 (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< 2147483647 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))), 6291#(and (or (not (<= ~counter~0 (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 2147483648))) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (or (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))))] [2022-03-15 19:06:27,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 19:06:27,464 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:27,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 19:06:27,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2022-03-15 19:06:27,465 INFO L87 Difference]: Start difference. First operand 142 states and 364 transitions. Second operand has 20 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:27,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:27,932 INFO L93 Difference]: Finished difference Result 184 states and 455 transitions. [2022-03-15 19:06:27,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-15 19:06:27,932 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 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) Word has length 20 [2022-03-15 19:06:27,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:27,933 INFO L225 Difference]: With dead ends: 184 [2022-03-15 19:06:27,933 INFO L226 Difference]: Without dead ends: 174 [2022-03-15 19:06:27,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2022-03-15 19:06:27,934 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 65 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:27,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 17 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 19:06:27,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-03-15 19:06:27,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 144. [2022-03-15 19:06:27,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 2.6083916083916083) internal successors, (373), 143 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:27,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 373 transitions. [2022-03-15 19:06:27,938 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 373 transitions. Word has length 20 [2022-03-15 19:06:27,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:27,938 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 373 transitions. [2022-03-15 19:06:27,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:27,938 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 373 transitions. [2022-03-15 19:06:27,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:06:27,939 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:27,939 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:27,963 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-03-15 19:06:28,162 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,SelfDestructingSolverStorable15 [2022-03-15 19:06:28,163 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:06:28,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:28,163 INFO L85 PathProgramCache]: Analyzing trace with hash 943340086, now seen corresponding path program 12 times [2022-03-15 19:06:28,164 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:28,164 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730124720] [2022-03-15 19:06:28,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:28,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:28,464 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:28,464 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:28,464 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730124720] [2022-03-15 19:06:28,464 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730124720] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:28,464 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505821387] [2022-03-15 19:06:28,464 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:06:28,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:28,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:28,466 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:28,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 19:06:28,550 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:06:28,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:28,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 69 conjunts are in the unsatisfiable core [2022-03-15 19:06:28,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:28,702 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 13 treesize of output 5 [2022-03-15 19:06:28,730 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:06:28,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:28,847 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:06:28,848 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 61 [2022-03-15 19:06:28,920 INFO L353 Elim1Store]: treesize reduction 94, result has 8.7 percent of original size [2022-03-15 19:06:28,921 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 18 [2022-03-15 19:06:28,984 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:06:28,984 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505821387] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:28,984 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:28,985 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 6] total 23 [2022-03-15 19:06:28,985 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1731813547] [2022-03-15 19:06:28,985 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:28,986 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:28,991 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 68 transitions. [2022-03-15 19:06:28,992 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:30,587 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [6923#(and (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (not (<= 0 (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (<= 0 (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)))), 6922#(and (or (<= ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0)) (or (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 1)) (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 6928#(and (= ~A~0.offset 0) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) 0) (or (<= 2 ~N~0) (= (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset) 4)) (<= 0 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= |thread2Thread1of1ForFork1_~i~1#1| 1)), 6919#(and (or (<= ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0)) (or (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 1)) (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0))), 6925#(and (or (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 1)) (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0) (not (< 1 ~N~0)) (not (<= 0 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 2147483647)) (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (< 2 ~N~0)) (or (< 2147483647 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (< 1 ~N~0)) (not (<= 0 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 2147483647)) (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (< 2 ~N~0) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))), 6929#(and (= ~A~0.offset 0) (= ~counter~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 2 ~N~0)), 6926#(and (or (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (<= ~N~0 (+ |thread2Thread1of1ForFork1_~i~1#1| 1)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0) (<= (+ 3 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0)) (or (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (<= ~N~0 (+ |thread2Thread1of1ForFork1_~i~1#1| 1)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0) (<= (+ 3 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0))), 6927#(and (or (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= ~N~0 (+ |thread2Thread1of1ForFork1_~i~1#1| 1)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))) (not (< 1 ~N~0)) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0) (< 2 ~N~0) (<= (+ 3 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0)) (or (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (<= ~N~0 (+ |thread2Thread1of1ForFork1_~i~1#1| 1)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 1)) (not (< 1 ~N~0)) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0) (< 2 ~N~0) (<= (+ 3 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0))), 6920#(and (or (< 0 (+ ~counter~0 1)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (<= ~counter~0 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 6930#(and (or (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) ~counter~0) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (<= ~N~0 1) (<= 3 ~N~0) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset))))) (or (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) ~counter~0) (< (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (<= ~N~0 1) (<= 3 ~N~0) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)))))), 6921#(and (or (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= ~counter~0 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (< 0 (+ ~counter~0 1)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 6924#(and (or (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< 2147483647 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (<= 0 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (or (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0) (not (<= 0 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0))), 6931#(and (or (< 2147483647 ~counter~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) ~counter~0) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 0) (<= ~counter~0 0) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< 2147483647 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= ~N~0 1) (< 2 ~N~0)) (or (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) ~counter~0) (< 0 (+ ~counter~0 1)) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 0) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< 2147483647 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= ~N~0 1) (< (+ ~counter~0 2147483648) 0) (< 2 ~N~0)))] [2022-03-15 19:06:30,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:06:30,587 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:30,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:06:30,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1105, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:06:30,588 INFO L87 Difference]: Start difference. First operand 144 states and 373 transitions. Second operand has 26 states, 25 states have (on average 2.36) internal successors, (59), 25 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:35,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:35,847 INFO L93 Difference]: Finished difference Result 366 states and 859 transitions. [2022-03-15 19:06:35,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-03-15 19:06:35,848 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.36) internal successors, (59), 25 states have internal predecessors, (59), 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) Word has length 20 [2022-03-15 19:06:35,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:35,849 INFO L225 Difference]: With dead ends: 366 [2022-03-15 19:06:35,849 INFO L226 Difference]: Without dead ends: 361 [2022-03-15 19:06:35,850 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=847, Invalid=3575, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 19:06:35,850 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 213 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:35,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 30 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:06:35,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-03-15 19:06:35,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 173. [2022-03-15 19:06:35,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 2.744186046511628) internal successors, (472), 172 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:35,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 472 transitions. [2022-03-15 19:06:35,857 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 472 transitions. Word has length 20 [2022-03-15 19:06:35,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:35,857 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 472 transitions. [2022-03-15 19:06:35,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.36) internal successors, (59), 25 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:35,857 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 472 transitions. [2022-03-15 19:06:35,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 19:06:35,858 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:35,858 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:35,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 19:06:36,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:36,063 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:06:36,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:36,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1163444034, now seen corresponding path program 13 times [2022-03-15 19:06:36,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:36,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229353202] [2022-03-15 19:06:36,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:36,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:36,341 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:36,341 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:36,341 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229353202] [2022-03-15 19:06:36,341 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229353202] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:36,341 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261990419] [2022-03-15 19:06:36,341 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:06:36,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:36,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:36,344 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-03-15 19:06:36,374 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-03-15 19:06:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:36,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 69 conjunts are in the unsatisfiable core [2022-03-15 19:06:36,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:36,608 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 13 treesize of output 5 [2022-03-15 19:06:36,635 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:06:36,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:36,754 INFO L353 Elim1Store]: treesize reduction 50, result has 51.5 percent of original size [2022-03-15 19:06:36,755 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 61 [2022-03-15 19:06:36,827 INFO L353 Elim1Store]: treesize reduction 94, result has 8.7 percent of original size [2022-03-15 19:06:36,828 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 18 [2022-03-15 19:06:36,889 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:06:36,889 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261990419] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:36,889 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:36,889 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 6] total 23 [2022-03-15 19:06:36,890 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1957254913] [2022-03-15 19:06:36,890 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:36,891 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:36,896 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 70 transitions. [2022-03-15 19:06:36,896 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:38,521 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [7853#(and (or (< 2147483647 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< 2147483647 ~counter~0) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 0) (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0) (<= ~counter~0 0) (< 2147483647 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= ~N~0 1) (< 2 ~N~0)) (or (< 2147483647 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (< 0 (+ ~counter~0 1)) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) 0) (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0) (< 2147483647 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (<= ~N~0 1) (< (+ ~counter~0 2147483648) 0) (< 2 ~N~0))), 7844#(and (or (<= ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0)) (or (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 1)) (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 7852#(and (or (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0) (< 2147483647 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (<= ~N~0 1) (<= 3 ~N~0) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset))))) (or (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0) (< 2147483647 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (<= ~N~0 1) (<= 3 ~N~0) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)))))), 7849#(and (= ~A~0.offset 0) (= ~counter~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= 2 ~N~0)), 7845#(and (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (not (<= 0 (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (<= 0 (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)))), 7842#(and (or (< 0 (+ ~counter~0 1)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (<= ~counter~0 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 7843#(and (or (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= ~counter~0 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (< 0 (+ ~counter~0 1)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 7851#(and (= ~A~0.offset 0) (= (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset) 4) (<= 2 ~N~0) (= ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))), 7846#(and (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (<= ~N~0 (+ |thread2Thread1of1ForFork1_~i~1#1| 1)) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (<= (+ 3 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork1_~i~1#1| 1)) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0) (<= (+ 3 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))))), 7847#(and (or (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< 2147483647 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (<= ~N~0 (+ |thread2Thread1of1ForFork1_~i~1#1| 1)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= (+ 3 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0)) (or (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< 2147483647 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (<= ~N~0 (+ |thread2Thread1of1ForFork1_~i~1#1| 1)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 2) ~N~0) (not (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0)) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (<= (+ 3 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0))), 7841#(and (or (<= ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0)) (or (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 1)) (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0))), 7848#(and (or (< 2147483647 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (<= ~N~0 (+ |thread2Thread1of1ForFork1_~i~1#1| 1)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))) (not (< 1 ~N~0)) (< 2 ~N~0) (<= (+ 3 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0)) (or (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< 2147483647 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset))) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (< (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648) 0) (<= ~N~0 (+ |thread2Thread1of1ForFork1_~i~1#1| 1)) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) 2147483648 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)) 1)) (not (< 1 ~N~0)) (< 2 ~N~0) (<= (+ 3 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0))), 7850#(and (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) ~counter~0) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)))) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (<= ~N~0 1) (<= 3 ~N~0)) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)))) (not (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~N~0 1) (<= 3 ~N~0) (< (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ ~counter~0 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))))] [2022-03-15 19:06:38,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:06:38,521 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:38,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:06:38,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=1088, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 19:06:38,522 INFO L87 Difference]: Start difference. First operand 173 states and 472 transitions. Second operand has 26 states, 25 states have (on average 2.4) internal successors, (60), 25 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:43,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:43,793 INFO L93 Difference]: Finished difference Result 416 states and 1020 transitions. [2022-03-15 19:06:43,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 19:06:43,793 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.4) internal successors, (60), 25 states have internal predecessors, (60), 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) Word has length 20 [2022-03-15 19:06:43,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:43,795 INFO L225 Difference]: With dead ends: 416 [2022-03-15 19:06:43,795 INFO L226 Difference]: Without dead ends: 406 [2022-03-15 19:06:43,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1571 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1003, Invalid=3967, Unknown=0, NotChecked=0, Total=4970 [2022-03-15 19:06:43,797 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 212 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:43,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 35 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:06:43,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2022-03-15 19:06:43,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 195. [2022-03-15 19:06:43,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 2.845360824742268) internal successors, (552), 194 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:43,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 552 transitions. [2022-03-15 19:06:43,804 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 552 transitions. Word has length 20 [2022-03-15 19:06:43,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:43,804 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 552 transitions. [2022-03-15 19:06:43,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.4) internal successors, (60), 25 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:43,805 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 552 transitions. [2022-03-15 19:06:43,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:06:43,805 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:43,805 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:43,829 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-03-15 19:06:44,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 19:06:44,030 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:06:44,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:44,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1682271093, now seen corresponding path program 14 times [2022-03-15 19:06:44,031 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:44,031 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031197759] [2022-03-15 19:06:44,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:44,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:44,105 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:06:44,105 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:44,105 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031197759] [2022-03-15 19:06:44,105 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031197759] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:44,105 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526192090] [2022-03-15 19:06:44,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:06:44,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:44,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:44,108 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 19:06:44,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 19:06:44,213 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:06:44,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:44,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:06:44,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:44,303 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:06:44,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:44,378 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:06:44,379 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526192090] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:44,379 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:44,379 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-03-15 19:06:44,379 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [573013287] [2022-03-15 19:06:44,379 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:44,381 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:44,387 INFO L252 McrAutomatonBuilder]: Finished intersection with 50 states and 82 transitions. [2022-03-15 19:06:44,387 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:44,915 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [8866#(or (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (< (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0)), 8869#(or (< 3 ~N~0) (<= ~N~0 2)), 8867#(or (<= ~N~0 (+ |thread2Thread1of1ForFork1_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0)), 8868#(or (< (+ 3 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork1_~i~1#1|))), 8865#(< |thread2Thread1of1ForFork1_~i~1#1| ~N~0)] [2022-03-15 19:06:44,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 19:06:44,915 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:44,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 19:06:44,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=427, Unknown=0, NotChecked=0, Total=552 [2022-03-15 19:06:44,916 INFO L87 Difference]: Start difference. First operand 195 states and 552 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:45,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:45,057 INFO L93 Difference]: Finished difference Result 381 states and 1017 transitions. [2022-03-15 19:06:45,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:06:45,058 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 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) Word has length 21 [2022-03-15 19:06:45,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:45,059 INFO L225 Difference]: With dead ends: 381 [2022-03-15 19:06:45,059 INFO L226 Difference]: Without dead ends: 359 [2022-03-15 19:06:45,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2022-03-15 19:06:45,060 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 73 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:45,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 34 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:06:45,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-03-15 19:06:45,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 309. [2022-03-15 19:06:45,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 2.6948051948051948) internal successors, (830), 308 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:45,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 830 transitions. [2022-03-15 19:06:45,075 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 830 transitions. Word has length 21 [2022-03-15 19:06:45,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:45,075 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 830 transitions. [2022-03-15 19:06:45,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:45,075 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 830 transitions. [2022-03-15 19:06:45,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 19:06:45,076 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:45,076 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:45,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 19:06:45,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:45,295 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:06:45,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:45,296 INFO L85 PathProgramCache]: Analyzing trace with hash -787302949, now seen corresponding path program 15 times [2022-03-15 19:06:45,296 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:45,296 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30724187] [2022-03-15 19:06:45,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:45,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:45,365 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:06:45,366 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:45,366 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30724187] [2022-03-15 19:06:45,366 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30724187] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:45,366 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185592420] [2022-03-15 19:06:45,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:06:45,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:45,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:45,368 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-03-15 19:06:45,391 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-03-15 19:06:45,483 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:06:45,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:45,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:06:45,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:45,571 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:06:45,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:45,660 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 19:06:45,660 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185592420] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:45,660 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:45,660 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-03-15 19:06:45,660 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [947272623] [2022-03-15 19:06:45,660 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:45,663 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:45,670 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 71 transitions. [2022-03-15 19:06:45,670 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:45,848 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [10016#(< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)] [2022-03-15 19:06:45,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:06:45,849 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:45,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:06:45,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2022-03-15 19:06:45,849 INFO L87 Difference]: Start difference. First operand 309 states and 830 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:45,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:45,966 INFO L93 Difference]: Finished difference Result 286 states and 726 transitions. [2022-03-15 19:06:45,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:06:45,966 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 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) Word has length 21 [2022-03-15 19:06:45,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:45,967 INFO L225 Difference]: With dead ends: 286 [2022-03-15 19:06:45,967 INFO L226 Difference]: Without dead ends: 196 [2022-03-15 19:06:45,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2022-03-15 19:06:45,968 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 54 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:45,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 31 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:06:45,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-03-15 19:06:45,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-03-15 19:06:45,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 2.835897435897436) internal successors, (553), 195 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:45,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 553 transitions. [2022-03-15 19:06:45,973 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 553 transitions. Word has length 21 [2022-03-15 19:06:45,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:45,973 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 553 transitions. [2022-03-15 19:06:45,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:45,973 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 553 transitions. [2022-03-15 19:06:45,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:06:45,974 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:45,974 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:45,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-03-15 19:06:46,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:46,192 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:06:46,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:46,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2056245394, now seen corresponding path program 16 times [2022-03-15 19:06:46,193 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:46,193 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922617335] [2022-03-15 19:06:46,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:46,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:46,272 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:06:46,272 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:46,272 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922617335] [2022-03-15 19:06:46,272 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922617335] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:46,272 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202473135] [2022-03-15 19:06:46,272 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 19:06:46,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:46,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:46,273 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-03-15 19:06:46,274 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-03-15 19:06:46,358 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 19:06:46,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:46,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 19:06:46,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:46,451 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:06:46,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:46,527 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:06:46,527 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202473135] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:46,527 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:46,527 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2022-03-15 19:06:46,527 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [456779251] [2022-03-15 19:06:46,527 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:46,530 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:46,539 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 83 transitions. [2022-03-15 19:06:46,539 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:46,831 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 19:06:46,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 19:06:46,831 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:46,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 19:06:46,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-03-15 19:06:46,831 INFO L87 Difference]: Start difference. First operand 196 states and 553 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:46,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:46,926 INFO L93 Difference]: Finished difference Result 208 states and 548 transitions. [2022-03-15 19:06:46,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-15 19:06:46,927 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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) Word has length 22 [2022-03-15 19:06:46,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:46,927 INFO L225 Difference]: With dead ends: 208 [2022-03-15 19:06:46,927 INFO L226 Difference]: Without dead ends: 208 [2022-03-15 19:06:46,928 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 54 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2022-03-15 19:06:46,928 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 42 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:46,928 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 10 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:06:46,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-03-15 19:06:46,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 174. [2022-03-15 19:06:46,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 2.6647398843930636) internal successors, (461), 173 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:46,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 461 transitions. [2022-03-15 19:06:46,933 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 461 transitions. Word has length 22 [2022-03-15 19:06:46,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:46,933 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 461 transitions. [2022-03-15 19:06:46,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:46,933 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 461 transitions. [2022-03-15 19:06:46,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 19:06:46,933 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:46,934 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:46,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-03-15 19:06:47,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:47,153 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:06:47,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:47,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1343753758, now seen corresponding path program 17 times [2022-03-15 19:06:47,155 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:47,155 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656037031] [2022-03-15 19:06:47,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:47,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:47,232 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:06:47,232 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:47,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656037031] [2022-03-15 19:06:47,232 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656037031] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:47,233 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085388137] [2022-03-15 19:06:47,233 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 19:06:47,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:47,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:47,236 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-03-15 19:06:47,271 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-03-15 19:06:47,356 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 19:06:47,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:47,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 19:06:47,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:47,441 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:06:47,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:47,483 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:06:47,483 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085388137] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:47,483 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:47,483 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 16 [2022-03-15 19:06:47,483 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [772712801] [2022-03-15 19:06:47,483 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:47,486 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:47,493 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 72 transitions. [2022-03-15 19:06:47,494 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:47,880 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [11556#(or (<= ~N~0 (+ |thread2Thread1of1ForFork1_~i~1#1| 1)) (<= (+ 3 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0)), 11557#(or (<= ~N~0 1) (<= 3 ~N~0)), 11555#(or (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0))] [2022-03-15 19:06:47,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-15 19:06:47,882 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:47,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-15 19:06:47,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2022-03-15 19:06:47,883 INFO L87 Difference]: Start difference. First operand 174 states and 461 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:48,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:48,004 INFO L93 Difference]: Finished difference Result 208 states and 511 transitions. [2022-03-15 19:06:48,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 19:06:48,005 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 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) Word has length 22 [2022-03-15 19:06:48,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:48,006 INFO L225 Difference]: With dead ends: 208 [2022-03-15 19:06:48,006 INFO L226 Difference]: Without dead ends: 208 [2022-03-15 19:06:48,006 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2022-03-15 19:06:48,007 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 64 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:48,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 13 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 19:06:48,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-03-15 19:06:48,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 147. [2022-03-15 19:06:48,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 2.452054794520548) internal successors, (358), 146 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:48,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 358 transitions. [2022-03-15 19:06:48,011 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 358 transitions. Word has length 22 [2022-03-15 19:06:48,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:48,011 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 358 transitions. [2022-03-15 19:06:48,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:48,011 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 358 transitions. [2022-03-15 19:06:48,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:06:48,012 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:48,012 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:48,039 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-03-15 19:06:48,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:48,223 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:06:48,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:48,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1757202087, now seen corresponding path program 18 times [2022-03-15 19:06:48,224 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:48,225 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066190761] [2022-03-15 19:06:48,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:48,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:48,713 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:48,714 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:48,714 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066190761] [2022-03-15 19:06:48,714 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066190761] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:48,714 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92339951] [2022-03-15 19:06:48,714 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 19:06:48,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:48,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:48,715 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-03-15 19:06:48,716 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-03-15 19:06:48,813 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 19:06:48,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:06:48,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 116 conjunts are in the unsatisfiable core [2022-03-15 19:06:48,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:49,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:06:49,148 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 29 treesize of output 27 [2022-03-15 19:06:49,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:06:49,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:06:49,313 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:06:49,313 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 43 [2022-03-15 19:06:49,407 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:49,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:49,550 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-15 19:06:49,777 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_~i~1#1_406| Int)) (or (< (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_406|) c_~N~0) (and (forall ((v_ArrVal_710 (Array Int Int))) (<= c_~counter~0 (let ((.cse1 (* |v_thread2Thread1of1ForFork1_~i~1#1_406| 4)) (.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_710) c_~A~0.base))) (+ (select .cse0 (+ c_~A~0.offset 4 .cse1)) (select .cse0 (+ c_~A~0.offset .cse1)) (select .cse0 c_~A~0.offset))))) (forall ((v_ArrVal_710 (Array Int Int))) (< (let ((.cse3 (* |v_thread2Thread1of1ForFork1_~i~1#1_406| 4)) (.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_710) c_~A~0.base))) (+ (select .cse2 (+ c_~A~0.offset 4 .cse3)) (select .cse2 (+ c_~A~0.offset .cse3)) (select .cse2 c_~A~0.offset))) (+ c_~counter~0 1)))) (not (< (+ |v_thread2Thread1of1ForFork1_~i~1#1_406| 1) c_~N~0)))) is different from false [2022-03-15 19:06:49,840 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_~i~1#1_406| Int)) (or (< (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_406|) c_~N~0) (and (forall ((v_ArrVal_710 (Array Int Int))) (< (let ((.cse1 (* |v_thread2Thread1of1ForFork1_~i~1#1_406| 4)) (.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_710) c_~A~0.base))) (+ (select .cse0 (+ c_~A~0.offset 4 .cse1)) (select .cse0 (+ c_~A~0.offset .cse1)) (select .cse0 c_~A~0.offset))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~counter~0 1))) (forall ((v_ArrVal_710 (Array Int Int))) (<= (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~counter~0) (let ((.cse3 (* |v_thread2Thread1of1ForFork1_~i~1#1_406| 4)) (.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_710) c_~A~0.base))) (+ (select .cse2 (+ c_~A~0.offset 4 .cse3)) (select .cse2 (+ c_~A~0.offset .cse3)) (select .cse2 c_~A~0.offset)))))) (not (< (+ |v_thread2Thread1of1ForFork1_~i~1#1_406| 1) c_~N~0)))) is different from false [2022-03-15 19:06:49,868 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork1_~i~1#1_406| Int)) (or (< (+ 2 |v_thread2Thread1of1ForFork1_~i~1#1_406|) c_~N~0) (and (forall ((v_ArrVal_710 (Array Int Int))) (< (let ((.cse1 (* |v_thread2Thread1of1ForFork1_~i~1#1_406| 4)) (.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_710) c_~A~0.base))) (+ (select .cse0 (+ c_~A~0.offset 4 .cse1)) (select .cse0 (+ c_~A~0.offset .cse1)) (select .cse0 c_~A~0.offset))) (let ((.cse2 (select |c_#memory_int| c_~A~0.base)) (.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ (select .cse2 (+ c_~A~0.offset .cse3)) c_~counter~0 (select .cse2 (+ c_~A~0.offset .cse3 4)) 1)))) (forall ((v_ArrVal_710 (Array Int Int))) (<= (let ((.cse4 (select |c_#memory_int| c_~A~0.base)) (.cse5 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ (select .cse4 (+ c_~A~0.offset .cse5)) c_~counter~0 (select .cse4 (+ c_~A~0.offset .cse5 4)))) (let ((.cse7 (* |v_thread2Thread1of1ForFork1_~i~1#1_406| 4)) (.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_710) c_~A~0.base))) (+ (select .cse6 (+ c_~A~0.offset 4 .cse7)) (select .cse6 (+ c_~A~0.offset .cse7)) (select .cse6 c_~A~0.offset)))))) (not (< (+ |v_thread2Thread1of1ForFork1_~i~1#1_406| 1) c_~N~0)))) is different from false [2022-03-15 19:06:49,971 INFO L353 Elim1Store]: treesize reduction 99, result has 58.1 percent of original size [2022-03-15 19:06:49,971 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 239 treesize of output 230 [2022-03-15 19:06:49,996 INFO L353 Elim1Store]: treesize reduction 20, result has 53.5 percent of original size [2022-03-15 19:06:49,996 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 101 [2022-03-15 19:06:50,020 INFO L353 Elim1Store]: treesize reduction 20, result has 53.5 percent of original size [2022-03-15 19:06:50,020 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 86 [2022-03-15 19:06:51,413 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-03-15 19:06:51,413 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92339951] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:51,413 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:51,413 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 43 [2022-03-15 19:06:51,413 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1857206826] [2022-03-15 19:06:51,413 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:51,415 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:51,423 INFO L252 McrAutomatonBuilder]: Finished intersection with 52 states and 84 transitions. [2022-03-15 19:06:51,423 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:53,853 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [12250#(and (or (< (+ ~counter~0 2147483648) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) ~counter~0) (< (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ ~counter~0 1)) (< (+ ~counter~0 2147483648) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~counter~0) (< 3 ~N~0) (<= ~N~0 2)) (or (< (+ ~counter~0 2147483648) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) ~counter~0) (<= ~counter~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~counter~0) (< 3 ~N~0) (<= ~N~0 2) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~counter~0))), 12258#(and (or (<= ~counter~0 (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) 8))) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) 8)) ~counter~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (= ~A~0.offset 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (= |thread2Thread1of1ForFork1_~i~1#1| 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 12251#(and (or (< 0 (+ ~counter~0 1)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (<= ~counter~0 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 12259#(and (or (< (+ ~counter~0 2147483648) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) ~counter~0) (< (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ ~counter~0 1)) (< (+ ~counter~0 2147483648) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~counter~0) (< 3 ~N~0) (<= ~N~0 2) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (< (+ ~counter~0 2147483648) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) ~counter~0) (<= ~counter~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~counter~0) (< 3 ~N~0) (<= ~N~0 2) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~counter~0))), 12256#(and (or (< (+ 3 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 1)) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0) (< (+ ~counter~0 2147483648) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork1_~i~1#1|)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0) (< (+ ~counter~0 2147483648) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (or (< (+ 3 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0) (< (+ ~counter~0 2147483648) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (<= ~counter~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork1_~i~1#1|)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0))), 12249#(and (or (< (+ 3 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0) (< (+ ~counter~0 2147483648) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (<= ~counter~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork1_~i~1#1|)) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0)) (or (< (+ 3 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 1)) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0) (< (+ ~counter~0 2147483648) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork1_~i~1#1|)) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0) (< (+ ~counter~0 2147483648) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))))), 12252#(and (or (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= ~counter~0 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (< 0 (+ ~counter~0 1)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 12247#(and (or (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 1)) (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (< (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0)) (or (<= ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (< (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0))), 12257#(and (or (<= ~counter~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (<= 1 |thread2Thread1of1ForFork1_~i~1#1|) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (<= |thread2Thread1of1ForFork1_~i~1#1| 1) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (= ~A~0.offset 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0))), 12254#(and (or (<= (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) ~counter~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (<= ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (= ~A~0.offset 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 12260#(and (or (<= (+ (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) 0) (select (select |#memory_int| ~A~0.base) 8)) ~counter~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (= ~A~0.offset 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (<= ~counter~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) 4) (select (select |#memory_int| ~A~0.base) 8))) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 12248#(and (or (< (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 1)) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (<= ~N~0 (+ |thread2Thread1of1ForFork1_~i~1#1| 1)) (< (+ ~counter~0 2147483648) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0)) (or (<= ~counter~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0) (<= ~N~0 (+ |thread2Thread1of1ForFork1_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0))), 12185#(or (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (and (< 0 (+ ~counter~0 1)) (<= ~counter~0 0))), 12253#(and (or (<= ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (< (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0)) (or (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 1)) (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (< (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 12255#(and (or (<= ~counter~0 (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0) (<= ~N~0 (+ |thread2Thread1of1ForFork1_~i~1#1| 1)) (< (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0)) (or (< (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 1)) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (<= ~N~0 (+ |thread2Thread1of1ForFork1_~i~1#1| 1)) (< (+ ~counter~0 2147483648) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0)))] [2022-03-15 19:06:53,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-03-15 19:06:53,853 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:53,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-03-15 19:06:53,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=2758, Unknown=3, NotChecked=330, Total=3422 [2022-03-15 19:06:53,855 INFO L87 Difference]: Start difference. First operand 147 states and 358 transitions. Second operand has 32 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 31 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:56,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:06:56,398 INFO L93 Difference]: Finished difference Result 244 states and 578 transitions. [2022-03-15 19:06:56,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 19:06:56,398 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 31 states have internal predecessors, (71), 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) Word has length 23 [2022-03-15 19:06:56,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:06:56,399 INFO L225 Difference]: With dead ends: 244 [2022-03-15 19:06:56,399 INFO L226 Difference]: Without dead ends: 239 [2022-03-15 19:06:56,401 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 22 SyntacticMatches, 8 SemanticMatches, 79 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1811 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=701, Invalid=5314, Unknown=3, NotChecked=462, Total=6480 [2022-03-15 19:06:56,401 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 197 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:06:56,401 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 50 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:06:56,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-03-15 19:06:56,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 165. [2022-03-15 19:06:56,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 2.4451219512195124) internal successors, (401), 164 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:56,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 401 transitions. [2022-03-15 19:06:56,406 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 401 transitions. Word has length 23 [2022-03-15 19:06:56,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:06:56,406 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 401 transitions. [2022-03-15 19:06:56,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 31 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:06:56,406 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 401 transitions. [2022-03-15 19:06:56,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:06:56,406 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:06:56,406 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:06:56,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 19:06:56,623 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,SelfDestructingSolverStorable22 [2022-03-15 19:06:56,623 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:06:56,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:06:56,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1925069059, now seen corresponding path program 19 times [2022-03-15 19:06:56,625 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:06:56,625 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638022189] [2022-03-15 19:06:56,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:06:56,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:06:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:57,179 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:06:57,179 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:06:57,179 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638022189] [2022-03-15 19:06:57,179 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638022189] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:06:57,179 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648330850] [2022-03-15 19:06:57,179 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 19:06:57,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:06:57,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:06:57,180 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-03-15 19:06:57,181 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-03-15 19:06:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:06:57,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 108 conjunts are in the unsatisfiable core [2022-03-15 19:06:57,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:06:57,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:06:57,474 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-03-15 19:06:57,661 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 13 treesize of output 5 [2022-03-15 19:06:57,689 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 19:06:57,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:06:57,888 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_749 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_749) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (+ (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 c_~A~0.offset))))) (forall ((v_ArrVal_749 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_749) c_~A~0.base))) (< (+ (select .cse1 (+ c_~A~0.offset 8)) (select .cse1 (+ c_~A~0.offset 4)) (select .cse1 c_~A~0.offset)) (+ c_~counter~0 (select .cse1 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) 1))))) is different from false [2022-03-15 19:06:57,897 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_749 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_749) c_~A~0.base))) (< (+ (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 (+ c_~A~0.offset 4)) (select .cse0 c_~A~0.offset)) (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse1)) c_~counter~0 (select .cse0 (+ c_~A~0.offset .cse1 4)) 1))))) (forall ((v_ArrVal_749 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_749) c_~A~0.base))) (<= (let ((.cse2 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse2)) c_~counter~0 (select .cse3 (+ c_~A~0.offset .cse2 4)))) (+ (select .cse3 (+ c_~A~0.offset 8)) (select .cse3 (+ c_~A~0.offset 4)) (select .cse3 c_~A~0.offset)))))) is different from false [2022-03-15 19:06:57,970 INFO L353 Elim1Store]: treesize reduction 114, result has 46.0 percent of original size [2022-03-15 19:06:57,971 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 106 treesize of output 143 [2022-03-15 19:06:57,999 INFO L353 Elim1Store]: treesize reduction 41, result has 46.1 percent of original size [2022-03-15 19:06:58,000 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 49 [2022-03-15 19:06:58,343 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:06:58,369 INFO L353 Elim1Store]: treesize reduction 198, result has 6.2 percent of original size [2022-03-15 19:06:58,369 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 53 treesize of output 24 [2022-03-15 19:06:58,499 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 3 not checked. [2022-03-15 19:06:58,499 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648330850] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:06:58,499 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:06:58,499 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 37 [2022-03-15 19:06:58,499 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [7955659] [2022-03-15 19:06:58,500 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:06:58,502 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:06:58,507 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 51 transitions. [2022-03-15 19:06:58,508 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:06:59,495 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [13054#(and (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (< 2147483647 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0)) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (< 0 (+ ~counter~0 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))))), 13052#(and (or (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= ~counter~0 0)) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (< 0 (+ ~counter~0 1)))), 13051#(and (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (< 0 (+ ~counter~0 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (< 2147483647 (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 0))), 13058#(and (or (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (< 2 ~N~0)) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) ~counter~0) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (not (<= ~counter~0 (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< 3 ~N~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ ~counter~0 2147483648)))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (< 2 ~N~0)) (< (+ ~counter~0 2147483648) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) ~counter~0) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (not (<= ~counter~0 (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< 3 ~N~0) (not (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ ~counter~0 2147483648))) (< (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ ~counter~0 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))))), 13056#(and (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 2147483648))) (< (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (not (<= ~counter~0 (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (not (< (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 2147483648))) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (not (<= ~counter~0 (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (< (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0)))), 13055#(and (or (not (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= ~counter~0 (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 2147483648))) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0)) (or (not (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0)) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= ~counter~0 (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 2147483648))) (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (< (+ |thread2Thread1of1ForFork1_~i~1#1| 1) ~N~0))), 13057#(and (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 2147483648))) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (< (+ 3 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (+ ~counter~0 2147483648) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (not (<= ~counter~0 (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (not (< (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0)) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0)) (or (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 2147483648))) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= ~N~0 |thread1Thread1of1ForFork0_~i~0#1|) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (< (+ 3 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (not (<= ~counter~0 (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (not (< (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0)) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0))), 13050#(and (or (< 0 (+ ~counter~0 1)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (<= ~counter~0 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 13053#(and (or (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= ~counter~0 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (< 0 (+ ~counter~0 1)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)))] [2022-03-15 19:06:59,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 19:06:59,495 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:06:59,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 19:06:59,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1831, Unknown=2, NotChecked=178, Total=2256 [2022-03-15 19:06:59,496 INFO L87 Difference]: Start difference. First operand 165 states and 401 transitions. Second operand has 26 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:05,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:07:05,883 INFO L93 Difference]: Finished difference Result 501 states and 1168 transitions. [2022-03-15 19:07:05,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-03-15 19:07:05,884 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 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) Word has length 23 [2022-03-15 19:07:05,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:07:05,885 INFO L225 Difference]: With dead ends: 501 [2022-03-15 19:07:05,886 INFO L226 Difference]: Without dead ends: 496 [2022-03-15 19:07:05,888 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2413 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1230, Invalid=7518, Unknown=2, NotChecked=370, Total=9120 [2022-03-15 19:07:05,888 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 267 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 19:07:05,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 62 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 19:07:05,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-03-15 19:07:05,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 192. [2022-03-15 19:07:05,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 2.5706806282722514) internal successors, (491), 191 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-03-15 19:07:05,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 491 transitions. [2022-03-15 19:07:05,894 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 491 transitions. Word has length 23 [2022-03-15 19:07:05,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:07:05,894 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 491 transitions. [2022-03-15 19:07:05,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:05,894 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 491 transitions. [2022-03-15 19:07:05,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:07:05,895 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:07:05,895 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:07:05,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 19:07:06,111 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,SelfDestructingSolverStorable23 [2022-03-15 19:07:06,111 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:07:06,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:07:06,112 INFO L85 PathProgramCache]: Analyzing trace with hash 961570803, now seen corresponding path program 20 times [2022-03-15 19:07:06,113 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:07:06,113 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737634758] [2022-03-15 19:07:06,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:07:06,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:07:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:06,646 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:06,646 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:07:06,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737634758] [2022-03-15 19:07:06,646 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737634758] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:07:06,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440148651] [2022-03-15 19:07:06,646 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 19:07:06,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:06,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:07:06,647 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-03-15 19:07:06,648 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-03-15 19:07:06,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 19:07:06,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:07:06,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 104 conjunts are in the unsatisfiable core [2022-03-15 19:07:06,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:07:06,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:07:06,904 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-03-15 19:07:07,088 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 19:07:07,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 19:07:07,271 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_788 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_788) c_~A~0.base))) (< (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 (+ c_~A~0.offset 4))) (+ c_~counter~0 (select .cse0 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) 1)))) (forall ((v_ArrVal_788 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_788) c_~A~0.base))) (<= (+ c_~counter~0 (select .cse1 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4)))) (+ (select .cse1 c_~A~0.offset) (select .cse1 (+ c_~A~0.offset 8)) (select .cse1 (+ c_~A~0.offset 4))))))) is different from false [2022-03-15 19:07:07,279 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_788 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_788) c_~A~0.base))) (<= (let ((.cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ (select .cse0 (+ c_~A~0.offset .cse1 4)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse1)) c_~counter~0)) (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset 8)) (select .cse0 (+ c_~A~0.offset 4)))))) (forall ((v_ArrVal_788 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_788) c_~A~0.base))) (< (+ (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset 8)) (select .cse2 (+ c_~A~0.offset 4))) (let ((.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ (select .cse2 (+ c_~A~0.offset .cse3 4)) (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse3)) c_~counter~0 1)))))) is different from false [2022-03-15 19:07:07,349 INFO L353 Elim1Store]: treesize reduction 114, result has 46.0 percent of original size [2022-03-15 19:07:07,350 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 106 treesize of output 143 [2022-03-15 19:07:07,375 INFO L353 Elim1Store]: treesize reduction 41, result has 46.1 percent of original size [2022-03-15 19:07:07,375 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 49 [2022-03-15 19:07:07,682 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 19:07:07,706 INFO L353 Elim1Store]: treesize reduction 198, result has 6.2 percent of original size [2022-03-15 19:07:07,707 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 53 treesize of output 24 [2022-03-15 19:07:07,803 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 3 not checked. [2022-03-15 19:07:07,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440148651] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 19:07:07,804 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 19:07:07,804 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 35 [2022-03-15 19:07:07,804 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [121589229] [2022-03-15 19:07:07,804 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 19:07:07,806 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 19:07:07,812 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 55 transitions. [2022-03-15 19:07:07,812 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 19:07:08,889 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [14210#(and (or (< 0 (+ ~counter~0 1)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (<= ~counter~0 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 14214#(and (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (<= ~N~0 (+ |thread2Thread1of1ForFork1_~i~1#1| 1)) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (<= (+ 3 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (<= ~N~0 (+ |thread2Thread1of1ForFork1_~i~1#1| 1)) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0) (<= (+ 3 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))))), 14209#(and (or (<= ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0)) (or (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 1)) (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0))), 14215#(and (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (< (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (<= (+ 4 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (+ ~counter~0 2147483648) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork1_~i~1#1|)) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0)) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)))) (<= (+ 4 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0) (<= ~N~0 (+ 2 |thread2Thread1of1ForFork1_~i~1#1|)) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset 4)) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0))), 14216#(and (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (< (+ ~counter~0 2147483648) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) ~counter~0) (<= 4 ~N~0) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (<= ~N~0 2) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))) (< (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ ~counter~0 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (or (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 8)) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4)))) (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (not (<= (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) ~counter~0) (<= 4 ~N~0) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))) ~counter~0) (<= ~N~0 2) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (+ 2147483647 (select (select |#memory_int| ~A~0.base) ~A~0.offset) (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset 4))))))), 14211#(and (or (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (<= ~counter~0 0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (or (< |thread2Thread1of1ForFork1_~i~1#1| ~N~0) (< 0 (+ ~counter~0 1)) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0))), 14213#(and (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (< (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (not (<= 0 (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 1 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647))) (or (< (+ |thread1Thread1of1ForFork0_~i~0#1| 1) ~N~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))) (not (<= 0 (+ ~counter~0 2147483648 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))))) (not (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)) (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (not (<= (+ ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) 2147483647)))), 14212#(and (or (<= ~counter~0 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0) (< (+ 2147483647 (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) ~counter~0)) (or (< (+ ~counter~0 2147483648) (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset))) (< (select (select |#memory_int| ~A~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~A~0.offset)) (+ ~counter~0 1)) (<= ~N~0 |thread2Thread1of1ForFork1_~i~1#1|) (<= (+ 2 |thread2Thread1of1ForFork1_~i~1#1|) ~N~0) (< |thread1Thread1of1ForFork0_~i~0#1| ~N~0)))] [2022-03-15 19:07:08,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 19:07:08,889 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 19:07:08,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 19:07:08,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1556, Unknown=2, NotChecked=166, Total=1980 [2022-03-15 19:07:08,890 INFO L87 Difference]: Start difference. First operand 192 states and 491 transitions. Second operand has 25 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:14,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 19:07:14,383 INFO L93 Difference]: Finished difference Result 498 states and 1164 transitions. [2022-03-15 19:07:14,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-03-15 19:07:14,384 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 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) Word has length 23 [2022-03-15 19:07:14,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 19:07:14,385 INFO L225 Difference]: With dead ends: 498 [2022-03-15 19:07:14,385 INFO L226 Difference]: Without dead ends: 488 [2022-03-15 19:07:14,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 83 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1918 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1170, Invalid=5642, Unknown=2, NotChecked=326, Total=7140 [2022-03-15 19:07:14,387 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 264 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 19:07:14,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 41 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 19:07:14,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-03-15 19:07:14,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 192. [2022-03-15 19:07:14,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 2.5706806282722514) internal successors, (491), 191 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-03-15 19:07:14,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 491 transitions. [2022-03-15 19:07:14,392 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 491 transitions. Word has length 23 [2022-03-15 19:07:14,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 19:07:14,393 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 491 transitions. [2022-03-15 19:07:14,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 19:07:14,393 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 491 transitions. [2022-03-15 19:07:14,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 19:07:14,393 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 19:07:14,394 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 19:07:14,416 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-03-15 19:07:14,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:14,615 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-15 19:07:14,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 19:07:14,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1184599957, now seen corresponding path program 21 times [2022-03-15 19:07:14,616 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 19:07:14,616 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443394362] [2022-03-15 19:07:14,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 19:07:14,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 19:07:14,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 19:07:15,110 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 19:07:15,110 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 19:07:15,110 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443394362] [2022-03-15 19:07:15,110 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443394362] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 19:07:15,110 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545038160] [2022-03-15 19:07:15,110 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 19:07:15,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:07:15,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 19:07:15,112 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-03-15 19:07:15,113 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-03-15 19:07:15,209 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 19:07:15,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 19:07:15,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 116 conjunts are in the unsatisfiable core [2022-03-15 19:07:15,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 19:07:15,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 19:07:15,477 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 22 treesize of output 22 [2022-03-15 19:07:15,685 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 19:07:15,685 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 17 treesize of output 18 Received shutdown request... [2022-03-15 19:17:57,540 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-03-15 19:17:57,541 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-03-15 19:17:57,553 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:17:57,557 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 19:17:57,560 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-03-15 19:17:57,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 19:17:57,742 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 3ms.. [2022-03-15 19:17:57,743 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-15 19:17:57,743 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-15 19:17:57,745 INFO L732 BasicCegarLoop]: Path program histogram: [21, 1, 1, 1, 1, 1] [2022-03-15 19:17:57,746 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 19:17:57,746 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 19:17:57,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 07:17:57 BasicIcfg [2022-03-15 19:17:57,748 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 19:17:57,748 INFO L158 Benchmark]: Toolchain (without parser) took 723629.69ms. Allocated memory was 186.6MB in the beginning and 426.8MB in the end (delta: 240.1MB). Free memory was 128.8MB in the beginning and 308.9MB in the end (delta: -180.1MB). Peak memory consumption was 243.3MB. Max. memory is 8.0GB. [2022-03-15 19:17:57,748 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 186.6MB. Free memory is still 145.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 19:17:57,749 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.68ms. Allocated memory was 186.6MB in the beginning and 246.4MB in the end (delta: 59.8MB). Free memory was 128.7MB in the beginning and 214.6MB in the end (delta: -86.0MB). Peak memory consumption was 14.4MB. Max. memory is 8.0GB. [2022-03-15 19:17:57,749 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.95ms. Allocated memory is still 246.4MB. Free memory was 214.6MB in the beginning and 212.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 19:17:57,749 INFO L158 Benchmark]: Boogie Preprocessor took 41.54ms. Allocated memory is still 246.4MB. Free memory was 212.6MB in the beginning and 211.5MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 19:17:57,749 INFO L158 Benchmark]: RCFGBuilder took 511.25ms. Allocated memory is still 246.4MB. Free memory was 211.0MB in the beginning and 189.0MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-03-15 19:17:57,749 INFO L158 Benchmark]: TraceAbstraction took 722690.13ms. Allocated memory was 246.4MB in the beginning and 426.8MB in the end (delta: 180.4MB). Free memory was 188.4MB in the beginning and 308.9MB in the end (delta: -120.4MB). Peak memory consumption was 243.1MB. Max. memory is 8.0GB. [2022-03-15 19:17:57,750 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 186.6MB. Free memory is still 145.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 325.68ms. Allocated memory was 186.6MB in the beginning and 246.4MB in the end (delta: 59.8MB). Free memory was 128.7MB in the beginning and 214.6MB in the end (delta: -86.0MB). Peak memory consumption was 14.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.95ms. Allocated memory is still 246.4MB. Free memory was 214.6MB in the beginning and 212.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.54ms. Allocated memory is still 246.4MB. Free memory was 212.6MB in the beginning and 211.5MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 511.25ms. Allocated memory is still 246.4MB. Free memory was 211.0MB in the beginning and 189.0MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 722690.13ms. Allocated memory was 246.4MB in the beginning and 426.8MB in the end (delta: 180.4MB). Free memory was 188.4MB in the beginning and 308.9MB in the end (delta: -120.4MB). Peak memory consumption was 243.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 115 PlacesBefore, 24 PlacesAfterwards, 117 TransitionsBefore, 20 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 7 FixpointIterations, 76 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 11 TrivialYvCompositions, 4 ConcurrentYvCompositions, 6 ChoiceCompositions, 114 TotalNumberOfCompositions, 596 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 567, positive: 551, positive conditional: 0, positive unconditional: 551, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 274, positive: 269, positive conditional: 0, positive unconditional: 269, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 567, positive: 282, positive conditional: 0, positive unconditional: 282, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 274, unknown conditional: 0, unknown unconditional: 274] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 20, Positive conditional cache size: 0, Positive unconditional cache size: 20, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - 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: 81]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 3ms.. - TimeoutResultAtElement [Line: 75]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 3ms.. - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 3ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 129 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 722.6s, OverallIterations: 26, TraceHistogramMax: 3, PathProgramHistogramMax: 21, EmptinessCheckTime: 0.0s, AutomataDifference: 34.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2302 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2302 mSDsluCounter, 586 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2263 mSDsCounter, 792 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8732 IncrementalHoareTripleChecker+Invalid, 9524 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 792 mSolverCounterUnsat, 118 mSDtfsCounter, 8732 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1847 GetRequests, 902 SyntacticMatches, 93 SemanticMatches, 852 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 14068 ImplicationChecksByTransitivity, 37.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred in iteration=19, InterpolantAutomatonStates: 480, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 1640 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 14.6s InterpolantComputationTime, 908 NumberOfCodeBlocks, 908 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 1271 ConstructedInterpolants, 22 QuantifiedInterpolants, 15608 SizeOfPredicates, 387 NumberOfNonLiveVariables, 5268 ConjunctsInSsa, 982 ConjunctsInUnsatCore, 69 InterpolantComputations, 5 PerfectInterpolantSequences, 222/599 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