/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:26:37,328 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:26:37,414 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-09 15:26:37,446 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:26:37,447 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:26:37,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:26:37,448 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:26:37,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:26:37,449 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:26:37,456 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:26:37,456 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:26:37,457 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:26:37,457 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:26:37,458 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:26:37,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:26:37,459 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:26:37,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:26:37,459 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:26:37,459 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:26:37,459 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:26:37,460 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:26:37,460 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:26:37,461 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:26:37,461 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:26:37,461 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:26:37,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:26:37,461 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:26:37,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:26:37,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:26:37,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:26:37,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:26:37,464 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:26:37,464 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:26:37,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true [2023-12-09 15:26:37,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:26:37,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:26:37,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:26:37,738 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:26:37,738 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:26:37,739 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c [2023-12-09 15:26:38,936 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:26:39,129 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:26:39,129 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c [2023-12-09 15:26:39,138 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/463b27821/40fa83c004a248e9bc24721f944ce330/FLAG78f7169c9 [2023-12-09 15:26:39,155 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/463b27821/40fa83c004a248e9bc24721f944ce330 [2023-12-09 15:26:39,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:26:39,159 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:26:39,162 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:26:39,162 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:26:39,166 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:26:39,167 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:26:39" (1/1) ... [2023-12-09 15:26:39,168 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b770c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:39, skipping insertion in model container [2023-12-09 15:26:39,168 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:26:39" (1/1) ... [2023-12-09 15:26:39,192 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:26:39,371 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c[2638,2651] [2023-12-09 15:26:39,381 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:26:39,394 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:26:39,418 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c[2638,2651] [2023-12-09 15:26:39,423 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:26:39,430 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:26:39,430 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:26:39,437 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:26:39,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:39 WrapperNode [2023-12-09 15:26:39,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:26:39,438 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:26:39,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:26:39,438 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:26:39,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:39" (1/1) ... [2023-12-09 15:26:39,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:39" (1/1) ... [2023-12-09 15:26:39,484 INFO L138 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 282 [2023-12-09 15:26:39,485 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:26:39,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:26:39,486 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:26:39,486 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:26:39,494 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:39" (1/1) ... [2023-12-09 15:26:39,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:39" (1/1) ... [2023-12-09 15:26:39,498 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:39" (1/1) ... [2023-12-09 15:26:39,499 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:39" (1/1) ... [2023-12-09 15:26:39,508 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:39" (1/1) ... [2023-12-09 15:26:39,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:39" (1/1) ... [2023-12-09 15:26:39,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:39" (1/1) ... [2023-12-09 15:26:39,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:39" (1/1) ... [2023-12-09 15:26:39,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:26:39,524 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:26:39,524 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:26:39,524 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:26:39,525 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:39" (1/1) ... [2023-12-09 15:26:39,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:26:39,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:26:39,552 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) [2023-12-09 15:26:39,572 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 [2023-12-09 15:26:39,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:26:39,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:26:39,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:26:39,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:26:39,587 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-09 15:26:39,587 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-09 15:26:39,587 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-09 15:26:39,587 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-09 15:26:39,587 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-09 15:26:39,587 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-09 15:26:39,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:26:39,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-09 15:26:39,588 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-09 15:26:39,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-09 15:26:39,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:26:39,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:26:39,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:26:39,590 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-09 15:26:39,691 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:26:39,693 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:26:40,115 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:26:40,344 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:26:40,345 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-12-09 15:26:40,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:26:40 BoogieIcfgContainer [2023-12-09 15:26:40,346 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:26:40,349 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:26:40,349 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:26:40,351 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:26:40,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:26:39" (1/3) ... [2023-12-09 15:26:40,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f152b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:26:40, skipping insertion in model container [2023-12-09 15:26:40,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:39" (2/3) ... [2023-12-09 15:26:40,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f152b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:26:40, skipping insertion in model container [2023-12-09 15:26:40,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:26:40" (3/3) ... [2023-12-09 15:26:40,354 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum2.wvr.c [2023-12-09 15:26:40,370 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:26:40,371 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:26:40,371 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:26:40,439 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-09 15:26:40,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 201 transitions, 423 flow [2023-12-09 15:26:40,581 INFO L124 PetriNetUnfolderBase]: 16/198 cut-off events. [2023-12-09 15:26:40,582 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-09 15:26:40,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 198 events. 16/198 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 123 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 158. Up to 2 conditions per place. [2023-12-09 15:26:40,588 INFO L82 GeneralOperation]: Start removeDead. Operand has 195 places, 201 transitions, 423 flow [2023-12-09 15:26:40,598 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 181 places, 187 transitions, 392 flow [2023-12-09 15:26:40,613 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:26:40,620 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@18214615, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:26:40,620 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-09 15:26:40,679 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:26:40,679 INFO L124 PetriNetUnfolderBase]: 16/186 cut-off events. [2023-12-09 15:26:40,679 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-09 15:26:40,680 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:26:40,680 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:26:40,681 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:26:40,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:26:40,685 INFO L85 PathProgramCache]: Analyzing trace with hash 996282290, now seen corresponding path program 1 times [2023-12-09 15:26:40,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:26:40,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928158900] [2023-12-09 15:26:40,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:26:40,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:26:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:26:41,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:26:41,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:26:41,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928158900] [2023-12-09 15:26:41,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928158900] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:26:41,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:26:41,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-09 15:26:41,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275130106] [2023-12-09 15:26:41,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:26:41,403 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:26:41,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:26:41,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:26:41,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-09 15:26:41,441 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 201 [2023-12-09 15:26:41,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 187 transitions, 392 flow. Second operand has 6 states, 6 states have (on average 143.33333333333334) internal successors, (860), 6 states have internal predecessors, (860), 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) [2023-12-09 15:26:41,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:26:41,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 201 [2023-12-09 15:26:41,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:26:41,746 INFO L124 PetriNetUnfolderBase]: 55/413 cut-off events. [2023-12-09 15:26:41,746 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2023-12-09 15:26:41,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 413 events. 55/413 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1331 event pairs, 6 based on Foata normal form. 65/442 useless extension candidates. Maximal degree in co-relation 297. Up to 54 conditions per place. [2023-12-09 15:26:41,755 INFO L140 encePairwiseOnDemand]: 176/201 looper letters, 61 selfloop transitions, 6 changer transitions 12/202 dead transitions. [2023-12-09 15:26:41,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 202 transitions, 607 flow [2023-12-09 15:26:41,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:26:41,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:26:41,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1323 transitions. [2023-12-09 15:26:41,775 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7313432835820896 [2023-12-09 15:26:41,776 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1323 transitions. [2023-12-09 15:26:41,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1323 transitions. [2023-12-09 15:26:41,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:26:41,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1323 transitions. [2023-12-09 15:26:41,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 147.0) internal successors, (1323), 9 states have internal predecessors, (1323), 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) [2023-12-09 15:26:41,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 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) [2023-12-09 15:26:41,796 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 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) [2023-12-09 15:26:41,800 INFO L308 CegarLoopForPetriNet]: 181 programPoint places, 8 predicate places. [2023-12-09 15:26:41,800 INFO L500 AbstractCegarLoop]: Abstraction has has 189 places, 202 transitions, 607 flow [2023-12-09 15:26:41,801 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 143.33333333333334) internal successors, (860), 6 states have internal predecessors, (860), 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) [2023-12-09 15:26:41,802 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:26:41,802 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:26:41,802 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:26:41,802 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:26:41,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:26:41,803 INFO L85 PathProgramCache]: Analyzing trace with hash -103208311, now seen corresponding path program 1 times [2023-12-09 15:26:41,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:26:41,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129459032] [2023-12-09 15:26:41,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:26:41,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:26:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:26:42,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:26:42,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:26:42,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129459032] [2023-12-09 15:26:42,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129459032] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:26:42,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:26:42,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-09 15:26:42,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011780699] [2023-12-09 15:26:42,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:26:42,078 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-09 15:26:42,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:26:42,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-09 15:26:42,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-09 15:26:42,081 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 201 [2023-12-09 15:26:42,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 202 transitions, 607 flow. Second operand has 7 states, 7 states have (on average 144.57142857142858) internal successors, (1012), 7 states have internal predecessors, (1012), 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) [2023-12-09 15:26:42,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:26:42,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 201 [2023-12-09 15:26:42,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:26:42,573 INFO L124 PetriNetUnfolderBase]: 450/1455 cut-off events. [2023-12-09 15:26:42,573 INFO L125 PetriNetUnfolderBase]: For 658/721 co-relation queries the response was YES. [2023-12-09 15:26:42,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2827 conditions, 1455 events. 450/1455 cut-off events. For 658/721 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 8444 event pairs, 160 based on Foata normal form. 1/1268 useless extension candidates. Maximal degree in co-relation 1557. Up to 492 conditions per place. [2023-12-09 15:26:42,585 INFO L140 encePairwiseOnDemand]: 180/201 looper letters, 98 selfloop transitions, 28 changer transitions 13/265 dead transitions. [2023-12-09 15:26:42,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 265 transitions, 1076 flow [2023-12-09 15:26:42,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-09 15:26:42,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-09 15:26:42,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1495 transitions. [2023-12-09 15:26:42,589 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7437810945273632 [2023-12-09 15:26:42,589 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1495 transitions. [2023-12-09 15:26:42,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1495 transitions. [2023-12-09 15:26:42,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:26:42,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1495 transitions. [2023-12-09 15:26:42,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 149.5) internal successors, (1495), 10 states have internal predecessors, (1495), 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) [2023-12-09 15:26:42,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 201.0) internal successors, (2211), 11 states have internal predecessors, (2211), 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) [2023-12-09 15:26:42,597 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 201.0) internal successors, (2211), 11 states have internal predecessors, (2211), 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) [2023-12-09 15:26:42,598 INFO L308 CegarLoopForPetriNet]: 181 programPoint places, 17 predicate places. [2023-12-09 15:26:42,599 INFO L500 AbstractCegarLoop]: Abstraction has has 198 places, 265 transitions, 1076 flow [2023-12-09 15:26:42,600 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 144.57142857142858) internal successors, (1012), 7 states have internal predecessors, (1012), 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) [2023-12-09 15:26:42,600 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:26:42,600 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:26:42,600 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:26:42,601 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:26:42,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:26:42,601 INFO L85 PathProgramCache]: Analyzing trace with hash 657219121, now seen corresponding path program 1 times [2023-12-09 15:26:42,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:26:42,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773264074] [2023-12-09 15:26:42,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:26:42,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:26:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:26:43,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:26:43,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:26:43,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773264074] [2023-12-09 15:26:43,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773264074] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:26:43,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:26:43,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-09 15:26:43,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288383848] [2023-12-09 15:26:43,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:26:43,073 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:26:43,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:26:43,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:26:43,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:26:43,077 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 201 [2023-12-09 15:26:43,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 265 transitions, 1076 flow. Second operand has 8 states, 8 states have (on average 109.75) internal successors, (878), 8 states have internal predecessors, (878), 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) [2023-12-09 15:26:43,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:26:43,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 201 [2023-12-09 15:26:43,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:26:43,529 INFO L124 PetriNetUnfolderBase]: 791/1922 cut-off events. [2023-12-09 15:26:43,530 INFO L125 PetriNetUnfolderBase]: For 1356/1646 co-relation queries the response was YES. [2023-12-09 15:26:43,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4625 conditions, 1922 events. 791/1922 cut-off events. For 1356/1646 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12193 event pairs, 446 based on Foata normal form. 0/1541 useless extension candidates. Maximal degree in co-relation 3880. Up to 1045 conditions per place. [2023-12-09 15:26:43,548 INFO L140 encePairwiseOnDemand]: 180/201 looper letters, 96 selfloop transitions, 14 changer transitions 54/252 dead transitions. [2023-12-09 15:26:43,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 252 transitions, 1271 flow [2023-12-09 15:26:43,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:26:43,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:26:43,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1042 transitions. [2023-12-09 15:26:43,552 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5760088446655611 [2023-12-09 15:26:43,552 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1042 transitions. [2023-12-09 15:26:43,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1042 transitions. [2023-12-09 15:26:43,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:26:43,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1042 transitions. [2023-12-09 15:26:43,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 115.77777777777777) internal successors, (1042), 9 states have internal predecessors, (1042), 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) [2023-12-09 15:26:43,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 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) [2023-12-09 15:26:43,558 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 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) [2023-12-09 15:26:43,559 INFO L308 CegarLoopForPetriNet]: 181 programPoint places, 24 predicate places. [2023-12-09 15:26:43,559 INFO L500 AbstractCegarLoop]: Abstraction has has 205 places, 252 transitions, 1271 flow [2023-12-09 15:26:43,560 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.75) internal successors, (878), 8 states have internal predecessors, (878), 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) [2023-12-09 15:26:43,560 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:26:43,560 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:26:43,560 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 15:26:43,561 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:26:43,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:26:43,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1530771031, now seen corresponding path program 1 times [2023-12-09 15:26:43,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:26:43,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9874264] [2023-12-09 15:26:43,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:26:43,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:26:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:26:43,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:26:43,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:26:43,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9874264] [2023-12-09 15:26:43,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9874264] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:26:43,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183036188] [2023-12-09 15:26:43,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:26:43,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:26:43,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:26:43,892 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) [2023-12-09 15:26:43,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-09 15:26:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:26:44,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-09 15:26:44,057 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:26:44,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:26:44,361 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:26:44,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:26:44,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183036188] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-09 15:26:44,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-09 15:26:44,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2023-12-09 15:26:44,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090177383] [2023-12-09 15:26:44,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:26:44,622 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-09 15:26:44,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:26:44,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-09 15:26:44,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2023-12-09 15:26:44,627 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 201 [2023-12-09 15:26:44,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 252 transitions, 1271 flow. Second operand has 9 states, 9 states have (on average 136.55555555555554) internal successors, (1229), 9 states have internal predecessors, (1229), 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) [2023-12-09 15:26:44,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:26:44,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 201 [2023-12-09 15:26:44,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:26:45,358 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([903] L68-5-->L69: Formula: (< |v_thread3Thread1of1ForFork0_~i~2#1_3| v_~N~0_4) InVars {thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_3|, ~N~0=v_~N~0_4} OutVars{thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_3|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][241], [thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, 1233#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork2_~i~1#1| 1) ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), thread2Thread1of1ForFork2InUse, 85#L69true, 164#L48-4true, 233#true, 13#L59true, 198#true, 19#L91-4true, 215#true]) [2023-12-09 15:26:45,359 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2023-12-09 15:26:45,359 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-12-09 15:26:45,359 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-12-09 15:26:45,359 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-12-09 15:26:45,359 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([904] L68-5-->L68-6: Formula: (<= v_~N~0_3 |v_thread3Thread1of1ForFork0_~i~2#1_5|) InVars {thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_5|, ~N~0=v_~N~0_3} OutVars{thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_5|, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][242], [thread1Thread1of1ForFork1InUse, 183#L68-6true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 164#L48-4true, 233#true, 13#L59true, 198#true, 19#L91-4true, 1225#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork2_~i~1#1| 1) ~N~0)), 215#true]) [2023-12-09 15:26:45,359 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2023-12-09 15:26:45,360 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-12-09 15:26:45,360 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-12-09 15:26:45,360 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-12-09 15:26:45,782 INFO L124 PetriNetUnfolderBase]: 3046/5724 cut-off events. [2023-12-09 15:26:45,782 INFO L125 PetriNetUnfolderBase]: For 9418/10699 co-relation queries the response was YES. [2023-12-09 15:26:45,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18102 conditions, 5724 events. 3046/5724 cut-off events. For 9418/10699 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 42218 event pairs, 837 based on Foata normal form. 10/4607 useless extension candidates. Maximal degree in co-relation 16936. Up to 3099 conditions per place. [2023-12-09 15:26:45,835 INFO L140 encePairwiseOnDemand]: 179/201 looper letters, 182 selfloop transitions, 22 changer transitions 58/380 dead transitions. [2023-12-09 15:26:45,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 380 transitions, 2678 flow [2023-12-09 15:26:45,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-09 15:26:45,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-12-09 15:26:45,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1858 transitions. [2023-12-09 15:26:45,840 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7110600841944126 [2023-12-09 15:26:45,840 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1858 transitions. [2023-12-09 15:26:45,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1858 transitions. [2023-12-09 15:26:45,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:26:45,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1858 transitions. [2023-12-09 15:26:45,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 142.92307692307693) internal successors, (1858), 13 states have internal predecessors, (1858), 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) [2023-12-09 15:26:45,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 201.0) internal successors, (2814), 14 states have internal predecessors, (2814), 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) [2023-12-09 15:26:45,850 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 201.0) internal successors, (2814), 14 states have internal predecessors, (2814), 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) [2023-12-09 15:26:45,851 INFO L308 CegarLoopForPetriNet]: 181 programPoint places, 36 predicate places. [2023-12-09 15:26:45,851 INFO L500 AbstractCegarLoop]: Abstraction has has 217 places, 380 transitions, 2678 flow [2023-12-09 15:26:45,851 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 136.55555555555554) internal successors, (1229), 9 states have internal predecessors, (1229), 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) [2023-12-09 15:26:45,851 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:26:45,852 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:26:45,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-09 15:26:46,057 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:26:46,058 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:26:46,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:26:46,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1117846033, now seen corresponding path program 2 times [2023-12-09 15:26:46,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:26:46,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875075360] [2023-12-09 15:26:46,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:26:46,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:26:46,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:26:46,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:26:46,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:26:46,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875075360] [2023-12-09 15:26:46,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875075360] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:26:46,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38221471] [2023-12-09 15:26:46,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:26:46,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:26:46,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:26:46,309 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) [2023-12-09 15:26:46,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-09 15:26:46,438 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-09 15:26:46,438 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:26:46,440 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-09 15:26:46,452 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:26:46,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-09 15:26:46,642 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-09 15:26:46,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38221471] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:26:46,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-09 15:26:46,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2023-12-09 15:26:46,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948511873] [2023-12-09 15:26:46,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:26:46,647 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:26:46,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:26:46,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:26:46,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2023-12-09 15:26:46,653 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 201 [2023-12-09 15:26:46,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 380 transitions, 2678 flow. Second operand has 6 states, 6 states have (on average 131.16666666666666) internal successors, (787), 6 states have internal predecessors, (787), 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) [2023-12-09 15:26:46,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:26:46,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 201 [2023-12-09 15:26:46,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:26:47,674 INFO L124 PetriNetUnfolderBase]: 2950/5509 cut-off events. [2023-12-09 15:26:47,674 INFO L125 PetriNetUnfolderBase]: For 12620/14119 co-relation queries the response was YES. [2023-12-09 15:26:47,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21250 conditions, 5509 events. 2950/5509 cut-off events. For 12620/14119 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 38781 event pairs, 662 based on Foata normal form. 17/4566 useless extension candidates. Maximal degree in co-relation 19923. Up to 3047 conditions per place. [2023-12-09 15:26:47,729 INFO L140 encePairwiseOnDemand]: 192/201 looper letters, 222 selfloop transitions, 17 changer transitions 53/419 dead transitions. [2023-12-09 15:26:47,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 419 transitions, 3615 flow [2023-12-09 15:26:47,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-09 15:26:47,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-09 15:26:47,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1053 transitions. [2023-12-09 15:26:47,732 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6548507462686567 [2023-12-09 15:26:47,732 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1053 transitions. [2023-12-09 15:26:47,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1053 transitions. [2023-12-09 15:26:47,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:26:47,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1053 transitions. [2023-12-09 15:26:47,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 131.625) internal successors, (1053), 8 states have internal predecessors, (1053), 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) [2023-12-09 15:26:47,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 201.0) internal successors, (1809), 9 states have internal predecessors, (1809), 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) [2023-12-09 15:26:47,738 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 201.0) internal successors, (1809), 9 states have internal predecessors, (1809), 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) [2023-12-09 15:26:47,739 INFO L308 CegarLoopForPetriNet]: 181 programPoint places, 41 predicate places. [2023-12-09 15:26:47,739 INFO L500 AbstractCegarLoop]: Abstraction has has 222 places, 419 transitions, 3615 flow [2023-12-09 15:26:47,739 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.16666666666666) internal successors, (787), 6 states have internal predecessors, (787), 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) [2023-12-09 15:26:47,739 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:26:47,740 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:26:47,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-09 15:26:47,944 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:26:47,945 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:26:47,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:26:47,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1757443019, now seen corresponding path program 1 times [2023-12-09 15:26:47,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:26:47,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492955446] [2023-12-09 15:26:47,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:26:47,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:26:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:26:48,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:26:48,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:26:48,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492955446] [2023-12-09 15:26:48,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492955446] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:26:48,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668540792] [2023-12-09 15:26:48,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:26:48,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:26:48,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:26:48,101 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) [2023-12-09 15:26:48,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-09 15:26:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:26:48,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-09 15:26:48,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:26:48,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:26:48,352 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:26:48,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:26:48,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668540792] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-09 15:26:48,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-09 15:26:48,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-12-09 15:26:48,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225535006] [2023-12-09 15:26:48,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:26:48,531 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-09 15:26:48,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:26:48,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-09 15:26:48,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-12-09 15:26:48,532 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 201 [2023-12-09 15:26:48,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 419 transitions, 3615 flow. Second operand has 7 states, 7 states have (on average 145.42857142857142) internal successors, (1018), 7 states have internal predecessors, (1018), 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) [2023-12-09 15:26:48,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:26:48,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 201 [2023-12-09 15:26:48,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:26:49,375 INFO L124 PetriNetUnfolderBase]: 2209/4254 cut-off events. [2023-12-09 15:26:49,375 INFO L125 PetriNetUnfolderBase]: For 13228/16832 co-relation queries the response was YES. [2023-12-09 15:26:49,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17998 conditions, 4254 events. 2209/4254 cut-off events. For 13228/16832 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 28125 event pairs, 440 based on Foata normal form. 66/3713 useless extension candidates. Maximal degree in co-relation 15569. Up to 2249 conditions per place. [2023-12-09 15:26:49,426 INFO L140 encePairwiseOnDemand]: 183/201 looper letters, 222 selfloop transitions, 18 changer transitions 52/444 dead transitions. [2023-12-09 15:26:49,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 444 transitions, 4373 flow [2023-12-09 15:26:49,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-09 15:26:49,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-09 15:26:49,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1049 transitions. [2023-12-09 15:26:49,430 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7455579246624022 [2023-12-09 15:26:49,430 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1049 transitions. [2023-12-09 15:26:49,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1049 transitions. [2023-12-09 15:26:49,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:26:49,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1049 transitions. [2023-12-09 15:26:49,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 149.85714285714286) internal successors, (1049), 7 states have internal predecessors, (1049), 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) [2023-12-09 15:26:49,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 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) [2023-12-09 15:26:49,436 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 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) [2023-12-09 15:26:49,436 INFO L308 CegarLoopForPetriNet]: 181 programPoint places, 46 predicate places. [2023-12-09 15:26:49,437 INFO L500 AbstractCegarLoop]: Abstraction has has 227 places, 444 transitions, 4373 flow [2023-12-09 15:26:49,437 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 145.42857142857142) internal successors, (1018), 7 states have internal predecessors, (1018), 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) [2023-12-09 15:26:49,437 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:26:49,437 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:26:49,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-09 15:26:49,643 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:26:49,644 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:26:49,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:26:49,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1801504142, now seen corresponding path program 1 times [2023-12-09 15:26:49,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:26:49,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656777409] [2023-12-09 15:26:49,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:26:49,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:26:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:26:53,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:26:53,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:26:53,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656777409] [2023-12-09 15:26:53,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656777409] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:26:53,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732481894] [2023-12-09 15:26:53,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:26:53,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:26:53,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:26:53,334 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) [2023-12-09 15:26:53,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-09 15:26:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:26:53,488 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 84 conjunts are in the unsatisfiable core [2023-12-09 15:26:53,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:26:53,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-09 15:26:53,998 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-09 15:26:53,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-09 15:26:55,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-09 15:26:56,031 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-12-09 15:26:56,279 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-12-09 15:26:56,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:26:56,720 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-09 15:26:56,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 20 [2023-12-09 15:26:56,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:26:56,914 INFO L378 Elim1Store]: Elim1 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 33 treesize of output 81 [2023-12-09 15:26:57,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:26:57,175 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:27:01,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:01,162 INFO L378 Elim1Store]: Elim1 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 111 treesize of output 76 [2023-12-09 15:27:01,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:01,326 INFO L378 Elim1Store]: Elim1 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 149494 treesize of output 133178 [2023-12-09 15:27:01,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:01,641 INFO L378 Elim1Store]: Elim1 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 2070 treesize of output 1694 [2023-12-09 15:27:01,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:01,725 INFO L378 Elim1Store]: Elim1 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 1686 treesize of output 1422 [2023-12-09 15:27:01,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:01,810 INFO L378 Elim1Store]: Elim1 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 1366 treesize of output 1262 [2023-12-09 15:27:35,442 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:27:35,491 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:27:35,526 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:27:39,848 INFO L378 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-12-09 15:27:39,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:27:39,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732481894] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:27:39,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:27:39,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 36] total 95 [2023-12-09 15:27:39,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513514650] [2023-12-09 15:27:39,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:27:39,860 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2023-12-09 15:27:39,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:39,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2023-12-09 15:27:39,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=497, Invalid=8315, Unknown=118, NotChecked=0, Total=8930 [2023-12-09 15:27:39,868 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 201 [2023-12-09 15:27:39,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 444 transitions, 4373 flow. Second operand has 95 states, 95 states have (on average 49.37894736842105) internal successors, (4691), 95 states have internal predecessors, (4691), 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) [2023-12-09 15:27:39,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:39,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 201 [2023-12-09 15:27:39,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:52,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:27:55,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:28:06,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:28:09,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:28:13,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:28:19,375 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (= c_~res2~0 c_~res1~0))) (and (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (or (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_212))) (= (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213)) (.cse1 (* ~M~0 4))) (+ (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)) c_~res2~0 (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)))) (+ c_~res1~0 (select (select .cse2 c_~A~0.base) c_~A~0.offset) (select (select .cse2 c_~B~0.base) c_~B~0.offset)))) (< 0 ~M~0) (< (+ ~M~0 1) c_~N~0))) .cse3 (<= |c_thread3Thread1of1ForFork0_~i~2#1| 0) (= c_~N~0 1) (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int)) (v_ArrVal_211 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (or (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_211) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_212))) (= (let ((.cse4 (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213)) (.cse5 (* ~M~0 4))) (+ (select (select .cse4 c_~B~0.base) (+ .cse5 c_~B~0.offset)) c_~res2~0 (select (select .cse4 c_~A~0.base) (+ c_~A~0.offset .cse5)))) (+ (select (select .cse6 c_~B~0.base) c_~B~0.offset) (select (select .cse6 c_~A~0.base) c_~A~0.offset) c_~res1~0))) (< 0 ~M~0) (< (+ ~M~0 1) c_~N~0))) (or .cse3 (not (= 0 |c_thread3Thread1of1ForFork0_~i~2#1|))))) is different from false [2023-12-09 15:28:29,391 INFO L124 PetriNetUnfolderBase]: 15254/24566 cut-off events. [2023-12-09 15:28:29,391 INFO L125 PetriNetUnfolderBase]: For 59676/59749 co-relation queries the response was YES. [2023-12-09 15:28:29,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113749 conditions, 24566 events. 15254/24566 cut-off events. For 59676/59749 co-relation queries the response was YES. Maximal size of possible extension queue 1124. Compared 186877 event pairs, 1577 based on Foata normal form. 10/22196 useless extension candidates. Maximal degree in co-relation 78637. Up to 11076 conditions per place. [2023-12-09 15:28:29,690 INFO L140 encePairwiseOnDemand]: 121/201 looper letters, 1446 selfloop transitions, 823 changer transitions 106/2415 dead transitions. [2023-12-09 15:28:29,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 2415 transitions, 29211 flow [2023-12-09 15:28:29,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2023-12-09 15:28:29,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2023-12-09 15:28:29,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 9495 transitions. [2023-12-09 15:28:29,718 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.26390394396731426 [2023-12-09 15:28:29,718 INFO L72 ComplementDD]: Start complementDD. Operand 179 states and 9495 transitions. [2023-12-09 15:28:29,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179 states and 9495 transitions. [2023-12-09 15:28:29,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:28:29,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 179 states and 9495 transitions. [2023-12-09 15:28:29,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 180 states, 179 states have (on average 53.04469273743017) internal successors, (9495), 179 states have internal predecessors, (9495), 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) [2023-12-09 15:28:29,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 180 states, 180 states have (on average 201.0) internal successors, (36180), 180 states have internal predecessors, (36180), 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) [2023-12-09 15:28:29,826 INFO L81 ComplementDD]: Finished complementDD. Result has 180 states, 180 states have (on average 201.0) internal successors, (36180), 180 states have internal predecessors, (36180), 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) [2023-12-09 15:28:29,827 INFO L308 CegarLoopForPetriNet]: 181 programPoint places, 224 predicate places. [2023-12-09 15:28:29,827 INFO L500 AbstractCegarLoop]: Abstraction has has 405 places, 2415 transitions, 29211 flow [2023-12-09 15:28:29,829 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 95 states have (on average 49.37894736842105) internal successors, (4691), 95 states have internal predecessors, (4691), 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) [2023-12-09 15:28:29,829 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:28:29,830 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:28:29,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-09 15:28:30,039 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:28:30,040 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:28:30,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:28:30,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1975067556, now seen corresponding path program 2 times [2023-12-09 15:28:30,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:28:30,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355242275] [2023-12-09 15:28:30,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:28:30,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:28:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:28:33,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:28:33,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:28:33,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355242275] [2023-12-09 15:28:33,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355242275] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:28:33,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186235817] [2023-12-09 15:28:33,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:28:33,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:28:33,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:28:33,853 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) [2023-12-09 15:28:33,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-09 15:28:34,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:28:34,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:28:34,076 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 75 conjunts are in the unsatisfiable core [2023-12-09 15:28:34,081 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:28:35,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-09 15:28:36,171 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 1 [2023-12-09 15:28:36,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:28:36,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:28:36,560 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-09 15:28:36,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 20 [2023-12-09 15:28:36,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:28:36,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:28:36,692 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-09 15:28:36,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 20 [2023-12-09 15:28:36,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:28:36,919 INFO L378 Elim1Store]: Elim1 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 33 treesize of output 81 [2023-12-09 15:28:37,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:28:37,235 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:28:38,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:28:38,987 INFO L378 Elim1Store]: Elim1 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 105 treesize of output 70 [2023-12-09 15:28:39,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:28:39,081 INFO L378 Elim1Store]: Elim1 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 19190 treesize of output 16186 [2023-12-09 15:28:39,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:28:39,175 INFO L378 Elim1Store]: Elim1 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 2006 treesize of output 1822 [2023-12-09 15:28:39,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:28:39,221 INFO L378 Elim1Store]: Elim1 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 1814 treesize of output 1438 [2023-12-09 15:28:39,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:28:39,308 INFO L378 Elim1Store]: Elim1 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 1430 treesize of output 1262 [2023-12-09 15:28:45,637 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:28:45,668 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:46,258 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:48,170 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:28:48,205 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:48,218 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:28:48,297 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:48,415 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:48,444 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:28:48,622 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:48,905 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:28:48,938 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:48,950 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:28:49,006 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:49,124 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:49,153 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:28:49,305 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:49,534 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:49,552 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:28:52,466 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:52,639 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:28:52,683 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:28:52,739 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:52,748 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:28:53,008 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:53,231 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:28:53,244 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:28:53,276 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:28:53,370 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-09 15:28:53,384 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:28:53,455 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:53,475 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:28:53,493 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:28:53,519 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:28:53,526 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:53,566 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:53,592 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:28:53,604 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:53,654 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:53,678 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:28:53,740 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-09 15:28:53,759 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:28:53,818 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:28:53,824 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:53,880 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:53,963 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:28:54,008 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:28:54,066 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:54,075 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:28:55,391 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:28:55,422 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:28:55,472 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:28:55,500 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:56,262 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:56,430 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-09 15:28:56,437 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:28:56,515 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:28:56,535 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:28:56,567 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:28:56,636 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-09 15:28:56,725 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:56,734 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:28:56,740 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:28:56,791 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:28:56,798 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:56,853 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:56,997 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:28:57,028 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:28:57,086 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:28:57,108 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:57,154 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:57,370 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:57,398 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:28:57,428 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:28:57,606 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:28:57,635 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:28:57,650 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:28:57,713 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:28:57,726 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:28:57,808 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:28:58,359 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:28:58,432 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:58,496 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:28:58,518 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:28:58,592 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:58,637 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:28:58,720 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:28:58,967 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-12-09 15:28:58,986 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-09 15:28:59,020 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-09 15:28:59,074 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:28:59,088 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:28:59,380 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:00,128 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:00,165 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:00,621 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:00,932 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:01,772 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:01,798 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:02,022 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:02,050 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:02,089 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:02,118 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:29:02,210 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-09 15:29:02,333 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-09 15:29:02,621 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-09 15:29:02,758 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:29:02,837 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:02,887 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:29:02,938 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:03,095 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-12-09 15:29:04,658 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-09 15:29:05,322 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-09 15:29:05,660 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-09 15:29:05,776 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:05,846 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:05,991 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:06,026 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:06,655 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:06,694 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:06,740 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:06,769 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:29:06,826 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:06,925 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:06,944 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:06,983 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:07,005 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:09,731 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:09,780 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:29:09,861 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:09,881 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:09,909 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:10,257 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:10,269 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:10,655 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:10,880 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:10,908 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:29:10,957 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:10,964 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:11,002 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:13,208 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:15,280 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:15,403 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:15,543 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:15,657 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:29:15,686 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-09 15:29:15,744 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:15,765 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:29:15,782 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:15,920 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:15,946 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:15,958 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:16,016 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:16,027 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:16,275 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:16,326 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:16,476 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:16,810 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:16,900 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:17,009 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:17,169 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:17,209 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:17,375 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:17,410 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:17,603 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:17,629 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:17,736 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:17,792 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:29:17,853 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:29:18,014 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:29:18,217 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:18,442 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:18,798 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:18,822 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:29:18,889 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:18,897 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:23,797 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:23,826 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:24,006 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:24,272 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:24,408 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:25,252 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:25,631 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:25,681 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:25,691 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:25,765 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:25,909 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:25,949 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:26,154 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:27,423 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:27,444 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:27,465 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:27,953 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:27,978 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:28,065 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:28,075 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:28,695 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:29:28,709 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:28,774 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:29:28,833 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-09 15:29:28,876 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-09 15:29:28,971 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:28,983 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:28,989 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:29,102 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:29,205 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:29,217 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:29,241 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:29:29,249 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:29,666 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:30,066 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:29:30,147 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:30,160 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:30,177 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-09 15:29:30,219 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:30,348 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:30,357 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:30,469 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:30,615 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:30,720 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:36,087 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:36,131 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:36,198 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:29:36,265 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:36,298 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:36,335 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:37,051 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:37,127 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:37,290 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:37,326 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:37,343 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:37,358 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:39,875 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:39,947 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:40,499 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:40,562 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:40,669 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:40,694 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:40,785 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:40,953 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:42,150 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:42,179 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:42,259 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:42,298 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:42,380 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:42,458 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:29:42,607 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:42,713 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-09 15:29:42,853 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:29:42,984 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:29:43,094 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:43,228 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:43,314 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:43,400 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:43,419 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:29:43,618 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:43,706 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:43,743 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:43,780 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:43,832 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:43,918 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:29:44,093 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:44,199 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:44,294 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:29:44,363 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-09 15:29:44,487 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-09 15:29:44,605 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:29:44,674 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:29:44,783 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:44,856 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:44,950 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:29:45,058 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:29:45,112 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-09 15:29:45,229 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:45,256 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:45,315 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:45,392 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:45,495 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:45,566 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:45,582 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:45,664 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:45,746 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:46,134 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:46,205 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:46,294 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:46,474 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:46,551 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:46,728 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:46,754 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:46,930 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:29:47,040 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-09 15:29:47,151 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:47,202 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:47,306 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:47,345 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:47,357 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:47,372 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:47,386 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:47,465 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:47,559 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:29:47,678 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:47,722 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:49,164 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:49,177 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:49,214 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:49,245 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:49,278 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:49,307 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:29:49,399 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:49,440 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:49,542 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:49,601 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:49,623 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:49,635 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:49,782 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:49,989 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:50,061 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:50,075 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:50,190 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:50,348 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:50,432 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:50,582 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:50,688 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:50,802 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:50,880 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:50,924 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:50,941 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:51,035 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:51,064 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:29:51,280 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:51,556 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:51,622 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:51,701 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:52,118 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:52,463 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:52,698 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:52,784 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:53,001 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:53,241 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:53,488 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-09 15:29:53,555 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:53,721 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:53,747 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:53,840 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:54,111 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:54,461 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:54,801 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:54,943 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:54,955 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:54,979 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:55,002 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-09 15:29:55,135 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:29:55,162 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-09 15:29:55,282 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-09 15:30:18,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:30:18,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186235817] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:30:18,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:30:18,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 36, 34] total 94 [2023-12-09 15:30:18,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454046304] [2023-12-09 15:30:18,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:30:18,247 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2023-12-09 15:30:18,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:30:18,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2023-12-09 15:30:18,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=984, Invalid=7714, Unknown=44, NotChecked=0, Total=8742 [2023-12-09 15:30:18,254 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 201 [2023-12-09 15:30:18,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 2415 transitions, 29211 flow. Second operand has 94 states, 94 states have (on average 49.52127659574468) internal successors, (4655), 94 states have internal predecessors, (4655), 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) [2023-12-09 15:30:18,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:30:18,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 201 [2023-12-09 15:30:18,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-12-09 15:30:42,186 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 [2023-12-09 15:30:42,186 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-09 15:30:42,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2023-12-09 15:30:42,208 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-12-09 15:30:42,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-09 15:30:42,409 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:30:42,409 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (94states, 46/201 universal loopers) in iteration 8,while PetriNetUnfolder was constructing finite prefix that currently has 134407 conditions, 23632 events (15204/23631 cut-off events. For 55600/57369 co-relation queries the response was YES. Maximal size of possible extension queue 2022. Compared 192761 event pairs, 546 based on Foata normal form. 90/23021 useless extension candidates. Maximal degree in co-relation 117162. Up to 11368 conditions per place.). [2023-12-09 15:30:42,411 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-12-09 15:30:42,411 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-12-09 15:30:42,411 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-12-09 15:30:42,411 INFO L457 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2023-12-09 15:30:42,414 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-09 15:30:42,414 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-09 15:30:42,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:30:42 BasicIcfg [2023-12-09 15:30:42,418 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-09 15:30:42,418 INFO L158 Benchmark]: Toolchain (without parser) took 243259.17ms. Allocated memory was 197.1MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 147.5MB in the beginning and 949.8MB in the end (delta: -802.3MB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2023-12-09 15:30:42,418 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 197.1MB. Free memory is still 151.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-09 15:30:42,418 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.76ms. Allocated memory is still 197.1MB. Free memory was 147.5MB in the beginning and 135.3MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-09 15:30:42,419 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.93ms. Allocated memory is still 197.1MB. Free memory was 135.3MB in the beginning and 132.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-09 15:30:42,419 INFO L158 Benchmark]: Boogie Preprocessor took 37.39ms. Allocated memory is still 197.1MB. Free memory was 132.5MB in the beginning and 130.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-09 15:30:42,419 INFO L158 Benchmark]: RCFGBuilder took 822.86ms. Allocated memory was 197.1MB in the beginning and 274.7MB in the end (delta: 77.6MB). Free memory was 130.4MB in the beginning and 202.6MB in the end (delta: -72.1MB). Peak memory consumption was 31.7MB. Max. memory is 8.0GB. [2023-12-09 15:30:42,419 INFO L158 Benchmark]: TraceAbstraction took 242068.98ms. Allocated memory was 274.7MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 202.0MB in the beginning and 949.8MB in the end (delta: -747.8MB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2023-12-09 15:30:42,420 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 197.1MB. Free memory is still 151.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 275.76ms. Allocated memory is still 197.1MB. Free memory was 147.5MB in the beginning and 135.3MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.93ms. Allocated memory is still 197.1MB. Free memory was 135.3MB in the beginning and 132.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.39ms. Allocated memory is still 197.1MB. Free memory was 132.5MB in the beginning and 130.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 822.86ms. Allocated memory was 197.1MB in the beginning and 274.7MB in the end (delta: 77.6MB). Free memory was 130.4MB in the beginning and 202.6MB in the end (delta: -72.1MB). Peak memory consumption was 31.7MB. Max. memory is 8.0GB. * TraceAbstraction took 242068.98ms. Allocated memory was 274.7MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 202.0MB in the beginning and 949.8MB in the end (delta: -747.8MB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (94states, 46/201 universal loopers) in iteration 8,while PetriNetUnfolder was constructing finite prefix that currently has 134407 conditions, 23632 events (15204/23631 cut-off events. For 55600/57369 co-relation queries the response was YES. Maximal size of possible extension queue 2022. Compared 192761 event pairs, 546 based on Foata normal form. 90/23021 useless extension candidates. Maximal degree in co-relation 117162. Up to 11368 conditions per place.). - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (94states, 46/201 universal loopers) in iteration 8,while PetriNetUnfolder was constructing finite prefix that currently has 134407 conditions, 23632 events (15204/23631 cut-off events. For 55600/57369 co-relation queries the response was YES. Maximal size of possible extension queue 2022. Compared 192761 event pairs, 546 based on Foata normal form. 90/23021 useless extension candidates. Maximal degree in co-relation 117162. Up to 11368 conditions per place.). - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (94states, 46/201 universal loopers) in iteration 8,while PetriNetUnfolder was constructing finite prefix that currently has 134407 conditions, 23632 events (15204/23631 cut-off events. For 55600/57369 co-relation queries the response was YES. Maximal size of possible extension queue 2022. Compared 192761 event pairs, 546 based on Foata normal form. 90/23021 useless extension candidates. Maximal degree in co-relation 117162. Up to 11368 conditions per place.). - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (94states, 46/201 universal loopers) in iteration 8,while PetriNetUnfolder was constructing finite prefix that currently has 134407 conditions, 23632 events (15204/23631 cut-off events. For 55600/57369 co-relation queries the response was YES. Maximal size of possible extension queue 2022. Compared 192761 event pairs, 546 based on Foata normal form. 90/23021 useless extension candidates. Maximal degree in co-relation 117162. Up to 11368 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 222 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 241.9s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 78.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 393 mSolverCounterUnknown, 5628 SdHoareTripleChecker+Valid, 25.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5628 mSDsluCounter, 16312 SdHoareTripleChecker+Invalid, 23.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1031 IncrementalHoareTripleChecker+Unchecked, 15666 mSDsCounter, 292 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20583 IncrementalHoareTripleChecker+Invalid, 22299 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 292 mSolverCounterUnsat, 646 mSDtfsCounter, 20583 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 393 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1920 GetRequests, 1343 SyntacticMatches, 5 SemanticMatches, 572 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 38305 ImplicationChecksByTransitivity, 50.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29211occurred in iteration=7, InterpolantAutomatonStates: 235, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 160.6s InterpolantComputationTime, 2047 NumberOfCodeBlocks, 2026 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2680 ConstructedInterpolants, 113 QuantifiedInterpolants, 32362 SizeOfPredicates, 111 NumberOfNonLiveVariables, 1930 ConjunctsInSsa, 180 ConjunctsInUnsatCore, 17 InterpolantComputations, 6 PerfectInterpolantSequences, 23/50 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