/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/pthread-ext/02_inc_cas.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 14:51:30,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 14:51:30,370 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 14:51:30,387 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 14:51:30,387 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 14:51:30,388 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 14:51:30,388 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 14:51:30,388 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 14:51:30,389 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 14:51:30,392 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 14:51:30,392 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 14:51:30,392 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 14:51:30,393 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 14:51:30,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 14:51:30,394 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 14:51:30,394 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 14:51:30,394 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 14:51:30,394 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 14:51:30,394 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 14:51:30,395 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 14:51:30,395 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 14:51:30,395 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 14:51:30,396 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 14:51:30,396 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 14:51:30,396 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 14:51:30,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 14:51:30,396 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 14:51:30,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 14:51:30,397 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 14:51:30,397 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 14:51:30,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 14:51:30,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 14:51:30,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 14:51:30,398 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 14:51:30,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 14:51:30,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 14:51:30,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 14:51:30,604 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 14:51:30,606 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 14:51:30,606 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2023-12-09 14:51:31,638 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 14:51:31,830 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 14:51:31,830 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2023-12-09 14:51:31,842 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/222658985/a59b110a07554c10a10beadf09f35720/FLAG0c93cd72d [2023-12-09 14:51:31,852 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/222658985/a59b110a07554c10a10beadf09f35720 [2023-12-09 14:51:31,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 14:51:31,855 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 14:51:31,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 14:51:31,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 14:51:31,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 14:51:31,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:51:31" (1/1) ... [2023-12-09 14:51:31,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65f68406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:31, skipping insertion in model container [2023-12-09 14:51:31,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:51:31" (1/1) ... [2023-12-09 14:51:31,907 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 14:51:32,150 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i[30873,30886] [2023-12-09 14:51:32,158 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 14:51:32,169 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 14:51:32,210 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i[30873,30886] [2023-12-09 14:51:32,212 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 14:51:32,236 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 14:51:32,237 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 14:51:32,242 INFO L206 MainTranslator]: Completed translation [2023-12-09 14:51:32,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:32 WrapperNode [2023-12-09 14:51:32,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 14:51:32,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 14:51:32,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 14:51:32,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 14:51:32,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:32" (1/1) ... [2023-12-09 14:51:32,261 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:32" (1/1) ... [2023-12-09 14:51:32,279 INFO L138 Inliner]: procedures = 170, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2023-12-09 14:51:32,280 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 14:51:32,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 14:51:32,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 14:51:32,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 14:51:32,286 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:32" (1/1) ... [2023-12-09 14:51:32,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:32" (1/1) ... [2023-12-09 14:51:32,288 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:32" (1/1) ... [2023-12-09 14:51:32,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:32" (1/1) ... [2023-12-09 14:51:32,291 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:32" (1/1) ... [2023-12-09 14:51:32,293 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:32" (1/1) ... [2023-12-09 14:51:32,294 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:32" (1/1) ... [2023-12-09 14:51:32,295 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:32" (1/1) ... [2023-12-09 14:51:32,296 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 14:51:32,297 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 14:51:32,297 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 14:51:32,297 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 14:51:32,298 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:32" (1/1) ... [2023-12-09 14:51:32,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 14:51:32,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:51:32,318 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 14:51:32,327 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 14:51:32,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 14:51:32,336 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-12-09 14:51:32,336 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-12-09 14:51:32,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 14:51:32,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-09 14:51:32,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 14:51:32,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 14:51:32,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 14:51:32,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 14:51:32,337 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-09 14:51:32,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 14:51:32,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 14:51:32,338 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 14:51:32,415 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 14:51:32,416 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 14:51:32,584 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 14:51:32,667 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 14:51:32,667 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-09 14:51:32,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:51:32 BoogieIcfgContainer [2023-12-09 14:51:32,668 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 14:51:32,670 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 14:51:32,670 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 14:51:32,672 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 14:51:32,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 02:51:31" (1/3) ... [2023-12-09 14:51:32,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d851cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:51:32, skipping insertion in model container [2023-12-09 14:51:32,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:51:32" (2/3) ... [2023-12-09 14:51:32,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d851cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:51:32, skipping insertion in model container [2023-12-09 14:51:32,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:51:32" (3/3) ... [2023-12-09 14:51:32,674 INFO L112 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2023-12-09 14:51:32,686 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 14:51:32,686 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 14:51:32,686 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 14:51:32,717 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:51:32,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 51 transitions, 106 flow [2023-12-09 14:51:32,765 INFO L124 PetriNetUnfolderBase]: 5/62 cut-off events. [2023-12-09 14:51:32,765 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 14:51:32,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 62 events. 5/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 106 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 37. Up to 4 conditions per place. [2023-12-09 14:51:32,769 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 51 transitions, 106 flow [2023-12-09 14:51:32,771 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 51 transitions, 106 flow [2023-12-09 14:51:32,778 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:51:32,782 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;@2056acf2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:51:32,782 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-09 14:51:32,795 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:51:32,795 INFO L124 PetriNetUnfolderBase]: 2/43 cut-off events. [2023-12-09 14:51:32,795 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 14:51:32,796 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:32,796 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] [2023-12-09 14:51:32,796 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-09 14:51:32,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:32,800 INFO L85 PathProgramCache]: Analyzing trace with hash -951130015, now seen corresponding path program 1 times [2023-12-09 14:51:32,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:32,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939597764] [2023-12-09 14:51:32,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:32,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:32,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:32,934 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 14:51:32,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:32,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939597764] [2023-12-09 14:51:32,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939597764] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:51:32,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:51:32,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-09 14:51:32,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198224333] [2023-12-09 14:51:32,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:51:32,945 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-09 14:51:32,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:32,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-09 14:51:32,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-09 14:51:32,974 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 51 [2023-12-09 14:51:32,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 51 transitions, 106 flow. Second operand has 2 states, 2 states have (on average 44.5) internal successors, (89), 2 states have internal predecessors, (89), 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 14:51:32,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:32,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 51 [2023-12-09 14:51:32,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:33,005 INFO L124 PetriNetUnfolderBase]: 2/47 cut-off events. [2023-12-09 14:51:33,005 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-09 14:51:33,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 47 events. 2/47 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 31 event pairs, 0 based on Foata normal form. 6/50 useless extension candidates. Maximal degree in co-relation 33. Up to 6 conditions per place. [2023-12-09 14:51:33,006 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 5 selfloop transitions, 0 changer transitions 0/43 dead transitions. [2023-12-09 14:51:33,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 100 flow [2023-12-09 14:51:33,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-09 14:51:33,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-12-09 14:51:33,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 94 transitions. [2023-12-09 14:51:33,016 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9215686274509803 [2023-12-09 14:51:33,017 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 94 transitions. [2023-12-09 14:51:33,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 94 transitions. [2023-12-09 14:51:33,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:33,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 94 transitions. [2023-12-09 14:51:33,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:51:33,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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 14:51:33,027 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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 14:51:33,030 INFO L308 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2023-12-09 14:51:33,030 INFO L500 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 100 flow [2023-12-09 14:51:33,031 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.5) internal successors, (89), 2 states have internal predecessors, (89), 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 14:51:33,031 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:33,031 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:51:33,031 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 14:51:33,031 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-09 14:51:33,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:33,032 INFO L85 PathProgramCache]: Analyzing trace with hash 892154132, now seen corresponding path program 1 times [2023-12-09 14:51:33,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:33,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470854980] [2023-12-09 14:51:33,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:33,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:51:33,072 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 14:51:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:51:33,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 14:51:33,098 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 14:51:33,099 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-09 14:51:33,100 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-12-09 14:51:33,100 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-12-09 14:51:33,100 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 14:51:33,101 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-09 14:51:33,103 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 14:51:33,103 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-09 14:51:33,135 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:51:33,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 76 transitions, 162 flow [2023-12-09 14:51:33,149 INFO L124 PetriNetUnfolderBase]: 9/100 cut-off events. [2023-12-09 14:51:33,150 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 14:51:33,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 100 events. 9/100 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 249 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 63. Up to 6 conditions per place. [2023-12-09 14:51:33,150 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 76 transitions, 162 flow [2023-12-09 14:51:33,151 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 76 transitions, 162 flow [2023-12-09 14:51:33,153 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:51:33,153 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;@2056acf2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:51:33,154 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-09 14:51:33,163 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:51:33,163 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2023-12-09 14:51:33,163 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-09 14:51:33,163 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:33,163 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] [2023-12-09 14:51:33,164 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-12-09 14:51:33,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:33,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1418692421, now seen corresponding path program 1 times [2023-12-09 14:51:33,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:33,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983599222] [2023-12-09 14:51:33,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:33,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:33,217 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 14:51:33,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:33,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983599222] [2023-12-09 14:51:33,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983599222] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:51:33,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:51:33,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-09 14:51:33,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671906356] [2023-12-09 14:51:33,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:51:33,219 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-09 14:51:33,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:33,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-09 14:51:33,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-09 14:51:33,225 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 76 [2023-12-09 14:51:33,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 76 transitions, 162 flow. Second operand has 2 states, 2 states have (on average 63.5) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:51:33,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:33,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 76 [2023-12-09 14:51:33,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:33,292 INFO L124 PetriNetUnfolderBase]: 34/197 cut-off events. [2023-12-09 14:51:33,292 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-12-09 14:51:33,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 197 events. 34/197 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 780 event pairs, 20 based on Foata normal form. 31/202 useless extension candidates. Maximal degree in co-relation 194. Up to 56 conditions per place. [2023-12-09 14:51:33,297 INFO L140 encePairwiseOnDemand]: 72/76 looper letters, 10 selfloop transitions, 0 changer transitions 0/67 dead transitions. [2023-12-09 14:51:33,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 67 transitions, 164 flow [2023-12-09 14:51:33,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-09 14:51:33,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-12-09 14:51:33,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 138 transitions. [2023-12-09 14:51:33,301 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9078947368421053 [2023-12-09 14:51:33,302 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 138 transitions. [2023-12-09 14:51:33,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 138 transitions. [2023-12-09 14:51:33,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:33,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 138 transitions. [2023-12-09 14:51:33,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 69.0) internal successors, (138), 2 states have internal predecessors, (138), 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 14:51:33,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:51:33,312 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:51:33,312 INFO L308 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2023-12-09 14:51:33,312 INFO L500 AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 164 flow [2023-12-09 14:51:33,312 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 63.5) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:51:33,312 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:33,313 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] [2023-12-09 14:51:33,313 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 14:51:33,313 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-12-09 14:51:33,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:33,314 INFO L85 PathProgramCache]: Analyzing trace with hash 722556284, now seen corresponding path program 1 times [2023-12-09 14:51:33,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:33,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972636661] [2023-12-09 14:51:33,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:33,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:33,945 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 14:51:33,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:33,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972636661] [2023-12-09 14:51:33,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972636661] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:51:33,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:51:33,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-09 14:51:33,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172772437] [2023-12-09 14:51:33,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:51:33,947 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-09 14:51:33,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:33,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-09 14:51:33,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-12-09 14:51:33,950 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 76 [2023-12-09 14:51:33,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 164 flow. Second operand has 12 states, 12 states have (on average 30.916666666666668) internal successors, (371), 12 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:51:33,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:33,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 76 [2023-12-09 14:51:33,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:34,715 INFO L124 PetriNetUnfolderBase]: 1286/2802 cut-off events. [2023-12-09 14:51:34,716 INFO L125 PetriNetUnfolderBase]: For 538/572 co-relation queries the response was YES. [2023-12-09 14:51:34,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5653 conditions, 2802 events. 1286/2802 cut-off events. For 538/572 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 22257 event pairs, 101 based on Foata normal form. 0/2505 useless extension candidates. Maximal degree in co-relation 4388. Up to 658 conditions per place. [2023-12-09 14:51:34,738 INFO L140 encePairwiseOnDemand]: 56/76 looper letters, 149 selfloop transitions, 70 changer transitions 0/246 dead transitions. [2023-12-09 14:51:34,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 246 transitions, 1132 flow [2023-12-09 14:51:34,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-09 14:51:34,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-12-09 14:51:34,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 921 transitions. [2023-12-09 14:51:34,742 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5049342105263158 [2023-12-09 14:51:34,742 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 921 transitions. [2023-12-09 14:51:34,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 921 transitions. [2023-12-09 14:51:34,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:34,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 921 transitions. [2023-12-09 14:51:34,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 38.375) internal successors, (921), 24 states have internal predecessors, (921), 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 14:51:34,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 76.0) internal successors, (1900), 25 states have internal predecessors, (1900), 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 14:51:34,785 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 76.0) internal successors, (1900), 25 states have internal predecessors, (1900), 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 14:51:34,787 INFO L308 CegarLoopForPetriNet]: 74 programPoint places, 18 predicate places. [2023-12-09 14:51:34,787 INFO L500 AbstractCegarLoop]: Abstraction has has 92 places, 246 transitions, 1132 flow [2023-12-09 14:51:34,787 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 30.916666666666668) internal successors, (371), 12 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 14:51:34,788 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:34,788 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:51:34,788 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 14:51:34,788 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-12-09 14:51:34,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:34,788 INFO L85 PathProgramCache]: Analyzing trace with hash 180033407, now seen corresponding path program 1 times [2023-12-09 14:51:34,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:34,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703681956] [2023-12-09 14:51:34,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:34,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:34,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:51:34,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 14:51:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:51:34,816 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 14:51:34,816 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 14:51:34,816 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2023-12-09 14:51:34,816 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-12-09 14:51:34,817 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-12-09 14:51:34,817 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-12-09 14:51:34,817 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-09 14:51:34,817 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-09 14:51:34,817 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 14:51:34,817 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-09 14:51:34,849 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:51:34,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 101 transitions, 220 flow [2023-12-09 14:51:34,864 INFO L124 PetriNetUnfolderBase]: 13/138 cut-off events. [2023-12-09 14:51:34,864 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-12-09 14:51:34,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 13/138 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 384 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 104. Up to 8 conditions per place. [2023-12-09 14:51:34,865 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 101 transitions, 220 flow [2023-12-09 14:51:34,866 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 101 transitions, 220 flow [2023-12-09 14:51:34,868 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:51:34,872 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;@2056acf2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:51:34,872 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-09 14:51:34,874 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:51:34,874 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2023-12-09 14:51:34,874 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-09 14:51:34,875 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:34,875 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] [2023-12-09 14:51:34,875 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-09 14:51:34,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:34,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1591017186, now seen corresponding path program 1 times [2023-12-09 14:51:34,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:34,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225210568] [2023-12-09 14:51:34,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:34,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:34,899 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 14:51:34,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:34,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225210568] [2023-12-09 14:51:34,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225210568] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:51:34,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:51:34,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-09 14:51:34,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38931099] [2023-12-09 14:51:34,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:51:34,900 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-09 14:51:34,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:34,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-09 14:51:34,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-09 14:51:34,901 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 101 [2023-12-09 14:51:34,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 101 transitions, 220 flow. Second operand has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 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 14:51:34,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:34,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 101 [2023-12-09 14:51:34,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:34,997 INFO L124 PetriNetUnfolderBase]: 316/1047 cut-off events. [2023-12-09 14:51:34,998 INFO L125 PetriNetUnfolderBase]: For 169/169 co-relation queries the response was YES. [2023-12-09 14:51:35,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1599 conditions, 1047 events. 316/1047 cut-off events. For 169/169 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 7117 event pairs, 220 based on Foata normal form. 156/1038 useless extension candidates. Maximal degree in co-relation 1183. Up to 431 conditions per place. [2023-12-09 14:51:35,006 INFO L140 encePairwiseOnDemand]: 96/101 looper letters, 15 selfloop transitions, 0 changer transitions 0/91 dead transitions. [2023-12-09 14:51:35,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 91 transitions, 230 flow [2023-12-09 14:51:35,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-09 14:51:35,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-12-09 14:51:35,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 182 transitions. [2023-12-09 14:51:35,007 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.900990099009901 [2023-12-09 14:51:35,010 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 182 transitions. [2023-12-09 14:51:35,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 182 transitions. [2023-12-09 14:51:35,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:35,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 182 transitions. [2023-12-09 14:51:35,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 91.0) internal successors, (182), 2 states have internal predecessors, (182), 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 14:51:35,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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 14:51:35,013 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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 14:51:35,014 INFO L308 CegarLoopForPetriNet]: 98 programPoint places, -5 predicate places. [2023-12-09 14:51:35,014 INFO L500 AbstractCegarLoop]: Abstraction has has 93 places, 91 transitions, 230 flow [2023-12-09 14:51:35,014 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 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 14:51:35,014 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:35,015 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] [2023-12-09 14:51:35,015 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-09 14:51:35,015 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-09 14:51:35,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:35,015 INFO L85 PathProgramCache]: Analyzing trace with hash -697560775, now seen corresponding path program 1 times [2023-12-09 14:51:35,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:35,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827192733] [2023-12-09 14:51:35,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:35,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:35,388 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 14:51:35,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:35,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827192733] [2023-12-09 14:51:35,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827192733] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:51:35,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:51:35,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-09 14:51:35,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321501426] [2023-12-09 14:51:35,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:51:35,389 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-09 14:51:35,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:35,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-09 14:51:35,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-12-09 14:51:35,391 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 101 [2023-12-09 14:51:35,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 91 transitions, 230 flow. Second operand has 11 states, 11 states have (on average 46.09090909090909) internal successors, (507), 11 states have internal predecessors, (507), 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 14:51:35,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:35,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 101 [2023-12-09 14:51:35,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:39,077 INFO L124 PetriNetUnfolderBase]: 16518/29102 cut-off events. [2023-12-09 14:51:39,077 INFO L125 PetriNetUnfolderBase]: For 7305/7492 co-relation queries the response was YES. [2023-12-09 14:51:39,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60349 conditions, 29102 events. 16518/29102 cut-off events. For 7305/7492 co-relation queries the response was YES. Maximal size of possible extension queue 1560. Compared 270062 event pairs, 1093 based on Foata normal form. 0/26051 useless extension candidates. Maximal degree in co-relation 21082. Up to 7558 conditions per place. [2023-12-09 14:51:39,323 INFO L140 encePairwiseOnDemand]: 78/101 looper letters, 414 selfloop transitions, 131 changer transitions 0/587 dead transitions. [2023-12-09 14:51:39,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 587 transitions, 2996 flow [2023-12-09 14:51:39,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-09 14:51:39,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-12-09 14:51:39,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1737 transitions. [2023-12-09 14:51:39,327 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.636963696369637 [2023-12-09 14:51:39,327 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 1737 transitions. [2023-12-09 14:51:39,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 1737 transitions. [2023-12-09 14:51:39,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:51:39,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 1737 transitions. [2023-12-09 14:51:39,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 64.33333333333333) internal successors, (1737), 27 states have internal predecessors, (1737), 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 14:51:39,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 101.0) internal successors, (2828), 28 states have internal predecessors, (2828), 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 14:51:39,335 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 101.0) internal successors, (2828), 28 states have internal predecessors, (2828), 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 14:51:39,337 INFO L308 CegarLoopForPetriNet]: 98 programPoint places, 21 predicate places. [2023-12-09 14:51:39,337 INFO L500 AbstractCegarLoop]: Abstraction has has 119 places, 587 transitions, 2996 flow [2023-12-09 14:51:39,338 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 46.09090909090909) internal successors, (507), 11 states have internal predecessors, (507), 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 14:51:39,338 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:51:39,338 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 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 14:51:39,338 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-09 14:51:39,338 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-09 14:51:39,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:51:39,339 INFO L85 PathProgramCache]: Analyzing trace with hash 2086016697, now seen corresponding path program 1 times [2023-12-09 14:51:39,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:51:39,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556168919] [2023-12-09 14:51:39,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:39,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:51:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:39,801 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 14:51:39,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:51:39,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556168919] [2023-12-09 14:51:39,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556168919] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:51:39,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727663771] [2023-12-09 14:51:39,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:51:39,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:51:39,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:51:39,804 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 14:51:39,833 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 14:51:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:51:39,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-09 14:51:39,885 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:51:39,968 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-09 14:51:39,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-09 14:51:40,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-09 14:51:40,078 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-12-09 14:51:40,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-12-09 14:51:40,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2023-12-09 14:51:40,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-12-09 14:51:40,417 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 14:51:40,417 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 14:51:42,685 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 14:51:42,686 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2023-12-09 14:51:42,702 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#value~0.base|)) (.cse1 (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296))) (let ((.cse2 (= (mod (select .cse5 |c_~#value~0.offset|) 4294967296) .cse1))) (and (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_90 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_90))) (or (= (mod (select (select .cse0 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse1 (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) .cse2) (or (forall ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_90 (Array Int Int))) (let ((.cse3 (store (let ((.cse4 (store |c_#memory_int| |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| |c_thr1Thread1of3ForFork0_~vn~0#1|)))) (store .cse4 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select .cse4 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_90))) (or (= (mod (select (select .cse3 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse1 (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (not .cse2))))) is different from false [2023-12-09 14:51:42,887 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296))) (or (= 4294967295 .cse0) (let ((.cse3 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse4 (= (mod (select .cse3 |c_~#value~0.offset|) 4294967296) .cse0))) (and (or (forall ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_90 (Array Int Int))) (let ((.cse1 (store (let ((.cse2 (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| (+ |c_thr1Thread1of3ForFork0_~v~0#1| 1))))) (store .cse2 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select .cse2 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_90))) (or (= (mod (select (select .cse1 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse0 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (not .cse4)) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_90 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_90))) (or (= (mod (select (select .cse5 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse0 (mod (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) .cse4)))))) is different from false [2023-12-09 14:51:43,421 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-09 14:51:43,447 INFO L349 Elim1Store]: treesize reduction 30, result has 40.0 percent of original size [2023-12-09 14:51:43,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 376 treesize of output 349 [2023-12-09 14:51:43,481 INFO L349 Elim1Store]: treesize reduction 15, result has 58.3 percent of original size [2023-12-09 14:51:43,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 72 treesize of output 91 [2023-12-09 14:51:43,513 INFO L349 Elim1Store]: treesize reduction 26, result has 38.1 percent of original size [2023-12-09 14:51:43,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 204 treesize of output 199 [2023-12-09 14:51:43,534 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-09 14:51:43,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 58 [2023-12-09 14:51:43,544 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 43 treesize of output 37 [2023-12-09 14:51:43,551 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 32 treesize of output 28 [2023-12-09 14:51:43,614 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-09 14:51:43,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 14:51:43,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 535 treesize of output 501 [2023-12-09 14:51:43,640 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 52 treesize of output 46 [2023-12-09 14:51:43,691 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 36 treesize of output 32 [2023-12-09 14:51:43,715 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 75 treesize of output 63 [2023-12-09 14:51:43,841 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 14:51:43,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727663771] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 14:51:43,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 14:51:43,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 31 [2023-12-09 14:51:43,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344484988] [2023-12-09 14:51:43,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 14:51:43,842 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-09 14:51:43,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:51:43,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-09 14:51:43,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=706, Unknown=23, NotChecked=114, Total=992 [2023-12-09 14:51:43,844 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 101 [2023-12-09 14:51:43,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 587 transitions, 2996 flow. Second operand has 32 states, 32 states have (on average 45.65625) internal successors, (1461), 32 states have internal predecessors, (1461), 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 14:51:43,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:51:43,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 101 [2023-12-09 14:51:43,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:51:47,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-09 14:51:50,952 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse17 (select .cse3 |c_~#value~0.offset|))) (let ((.cse6 (mod .cse17 4294967296)) (.cse1 (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296))) (let ((.cse4 (= .cse6 .cse1)) (.cse8 (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| (+ 1 .cse17)))) (.cse5 (= .cse6 4294967295))) (and (= (select |c_#valid| 3) 1) (or (forall ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_90 (Array Int Int))) (let ((.cse0 (store (let ((.cse2 (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| (+ |c_thr1Thread1of3ForFork0_~v~0#1| 1))))) (store .cse2 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select .cse2 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_90))) (or (= (mod (select (select .cse0 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse1 (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (not .cse4)) (or .cse5 (forall ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_90 (Array Int Int))) (let ((.cse7 (store (store .cse8 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select .cse8 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_90))) (or (< .cse6 (mod (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse7 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0))))) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_90 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_90))) (or (= (mod (select (select .cse9 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse1 (mod (select (select .cse9 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) .cse4) (forall ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_17| Int) (v_ArrVal_86 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_90 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_86))) (let ((.cse14 (select .cse13 |c_~#value~0.base|))) (let ((.cse15 (select .cse14 |c_~#value~0.offset|))) (let ((.cse10 (mod .cse15 4294967296)) (.cse11 (store (let ((.cse12 (store .cse14 |c_~#value~0.offset| (+ .cse15 1)))) (store (store |c_#memory_int| |c_~#value~0.base| .cse12) |v_thr1Thread1of3ForFork0_~#casret~0#1.base_17| (store (select (store .cse13 |c_~#value~0.base| .cse12) |v_thr1Thread1of3ForFork0_~#casret~0#1.base_17|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_90))) (or (= 4294967295 .cse10) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_17|) 0)) (= (mod (select (select .cse11 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_17|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse10 (mod (select (select .cse11 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))))) (= |c_~#value~0.base| 3) (or (forall ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_17| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_90 (Array Int Int))) (let ((.cse16 (store (store .cse8 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_17| (store (select .cse8 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_17|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_90))) (or (= (mod (select (select .cse16 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_17|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_17|) 0)) (< .cse6 (mod (select (select .cse16 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) .cse5)))))) is different from false [2023-12-09 14:51:53,623 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 14:51:53,649 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse11 (select .cse3 |c_~#value~0.offset|))) (let ((.cse6 (mod .cse11 4294967296)) (.cse1 (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296))) (let ((.cse4 (= .cse6 .cse1)) (.cse8 (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| (+ 1 .cse11)))) (.cse5 (= .cse6 4294967295))) (and (= (select |c_#valid| 3) 1) (or (forall ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_90 (Array Int Int))) (let ((.cse0 (store (let ((.cse2 (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| (+ |c_thr1Thread1of3ForFork0_~v~0#1| 1))))) (store .cse2 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select .cse2 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_90))) (or (= (mod (select (select .cse0 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse1 (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (not .cse4)) (or .cse5 (forall ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_90 (Array Int Int))) (let ((.cse7 (store (store .cse8 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select .cse8 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_90))) (or (< .cse6 (mod (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select (select .cse7 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0))))) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_90 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_90))) (or (= (mod (select (select .cse9 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< .cse1 (mod (select (select .cse9 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) .cse4) (= |c_~#value~0.base| 3) (or (forall ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_17| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_90 (Array Int Int))) (let ((.cse10 (store (store .cse8 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_17| (store (select .cse8 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_17|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_90))) (or (= (mod (select (select .cse10 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_17|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_17|) 0)) (< .cse6 (mod (select (select .cse10 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) .cse5)))))) is different from false [2023-12-09 14:51:57,741 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 14:52:03,005 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 14:52:05,386 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 14:52:07,930 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 14:52:10,025 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 14:52:16,925 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 14:52:18,975 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 14:52:25,116 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 14:52:27,187 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 14:52:29,662 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 14:52:35,363 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 14:52:37,721 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 14:52:41,686 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 14:52:49,973 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 14:52:52,011 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 14:52:54,254 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 [0, 1] [2023-12-09 14:52:56,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 14:52:58,924 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 14:53:02,083 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 14:53:04,134 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 14:53:06,572 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 14:53:08,870 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 14:53:10,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 14:53:13,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 14:53:15,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 14:53:18,147 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 14:53:21,556 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 14:53:25,203 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 14:53:29,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 14:53:32,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 14:53:35,459 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 14:53:38,965 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 14:53:45,655 INFO L124 PetriNetUnfolderBase]: 60715/107483 cut-off events. [2023-12-09 14:53:45,655 INFO L125 PetriNetUnfolderBase]: For 44659/52040 co-relation queries the response was YES. [2023-12-09 14:53:46,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308911 conditions, 107483 events. 60715/107483 cut-off events. For 44659/52040 co-relation queries the response was YES. Maximal size of possible extension queue 5746. Compared 1156421 event pairs, 1224 based on Foata normal form. 1164/97742 useless extension candidates. Maximal degree in co-relation 186538. Up to 31066 conditions per place. [2023-12-09 14:53:47,326 INFO L140 encePairwiseOnDemand]: 62/101 looper letters, 2717 selfloop transitions, 1075 changer transitions 0/3834 dead transitions. [2023-12-09 14:53:47,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 3834 transitions, 27894 flow [2023-12-09 14:53:47,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-12-09 14:53:47,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2023-12-09 14:53:47,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 4561 transitions. [2023-12-09 14:53:47,348 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6186084361860844 [2023-12-09 14:53:47,348 INFO L72 ComplementDD]: Start complementDD. Operand 73 states and 4561 transitions. [2023-12-09 14:53:47,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 4561 transitions. [2023-12-09 14:53:47,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:53:47,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 73 states and 4561 transitions. [2023-12-09 14:53:47,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 74 states, 73 states have (on average 62.47945205479452) internal successors, (4561), 73 states have internal predecessors, (4561), 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 14:53:47,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 74 states, 74 states have (on average 101.0) internal successors, (7474), 74 states have internal predecessors, (7474), 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 14:53:47,405 INFO L81 ComplementDD]: Finished complementDD. Result has 74 states, 74 states have (on average 101.0) internal successors, (7474), 74 states have internal predecessors, (7474), 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 14:53:47,406 INFO L308 CegarLoopForPetriNet]: 98 programPoint places, 93 predicate places. [2023-12-09 14:53:47,406 INFO L500 AbstractCegarLoop]: Abstraction has has 191 places, 3834 transitions, 27894 flow [2023-12-09 14:53:47,407 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 45.65625) internal successors, (1461), 32 states have internal predecessors, (1461), 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 14:53:47,407 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:53:47,407 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 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 14:53:47,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-09 14:53:47,626 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:53:47,627 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-09 14:53:47,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:53:47,627 INFO L85 PathProgramCache]: Analyzing trace with hash -713604303, now seen corresponding path program 1 times [2023-12-09 14:53:47,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:53:47,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529630809] [2023-12-09 14:53:47,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:53:47,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:53:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:53:48,096 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-09 14:53:48,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:53:48,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529630809] [2023-12-09 14:53:48,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529630809] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:53:48,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282950272] [2023-12-09 14:53:48,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:53:48,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:53:48,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:53:48,144 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 14:53:48,198 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 14:53:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:53:48,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-09 14:53:48,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:53:48,385 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-09 14:53:48,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-12-09 14:53:48,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-09 14:53:48,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-09 14:53:48,654 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-09 14:53:48,654 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 14:53:48,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-12-09 14:53:48,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-09 14:53:48,824 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-09 14:53:48,824 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 14:53:48,889 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 14:53:48,889 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2023-12-09 14:53:48,899 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 14:53:48,900 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2023-12-09 14:53:49,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 97 [2023-12-09 14:53:49,666 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 54 treesize of output 46 [2023-12-09 14:53:49,671 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 54 treesize of output 50 [2023-12-09 14:53:49,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 93 [2023-12-09 14:53:49,758 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 80 treesize of output 76 [2023-12-09 14:53:49,765 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 52 treesize of output 44 [2023-12-09 14:53:49,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-09 14:53:49,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282950272] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 14:53:49,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 14:53:49,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 26 [2023-12-09 14:53:49,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995466231] [2023-12-09 14:53:49,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 14:53:49,822 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-09 14:53:49,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:53:49,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-09 14:53:49,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=577, Unknown=4, NotChecked=0, Total=702 [2023-12-09 14:53:49,824 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 101 [2023-12-09 14:53:49,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 3834 transitions, 27894 flow. Second operand has 27 states, 27 states have (on average 46.333333333333336) internal successors, (1251), 27 states have internal predecessors, (1251), 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 14:53:49,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:53:49,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 101 [2023-12-09 14:53:49,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:53:57,660 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 14:53:59,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 14:54:06,586 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 14:54:08,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 14:54:15,041 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L718-1-->L721: Formula: (= |v_thr1Thread3of3ForFork0_~v~0#1_3| (select (select |v_#memory_int_24| |v_~#value~0.base_16|) |v_~#value~0.offset_16|)) InVars {#memory_int=|v_#memory_int_24|, ~#value~0.base=|v_~#value~0.base_16|, ~#value~0.offset=|v_~#value~0.offset_16|} OutVars{#memory_int=|v_#memory_int_24|, thr1Thread3of3ForFork0_~v~0#1=|v_thr1Thread3of3ForFork0_~v~0#1_3|, ~#value~0.base=|v_~#value~0.base_16|, thr1Thread3of3ForFork0_#t~mem6#1=|v_thr1Thread3of3ForFork0_#t~mem6#1_1|, ~#value~0.offset=|v_~#value~0.offset_16|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~mem6#1, thr1Thread3of3ForFork0_~v~0#1][5371], [120#(and (= (+ |thr1Thread1of3ForFork0_~v~0#1| 1) |thr1Thread1of3ForFork0_~vn~0#1|) (not (= |thr1Thread1of3ForFork0_~#casret~0#1.base| 3)) (<= |thr1Thread1of3ForFork0_~v~0#1| (+ 4294967294 (* (div |thr1Thread1of3ForFork0_~v~0#1| 4294967296) 4294967296))) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#value~0.base| 3)), 40#L723true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 101#true, 759#(and (or (= (mod (select (select |#memory_int| 3) |~#value~0.offset|) 4294967296) (mod |thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (forall ((v_DerPreprocessor_3 (Array Int Int))) (< (mod |thr1Thread2of3ForFork0_~v~0#1| 4294967296) (mod (select (select (store |#memory_int| |thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) 3) |~#value~0.offset|) 4294967296))) (= 4294967295 (mod |thr1Thread2of3ForFork0_~v~0#1| 4294967296))) (= (select |#valid| 3) 1) (= |~#value~0.base| 3) (not (= |thr1Thread2of3ForFork0_~#casret~0#1.base| 3))), 66#L726true, 91#L721true, 415#(and (or (= (mod (select (select |#memory_int| 3) |~#value~0.offset|) 4294967296) 4294967295) (forall ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_90 (Array Int Int))) (or (< (mod (select (select |#memory_int| 3) |~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |#memory_int| 3 (store (select |#memory_int| 3) |~#value~0.offset| (+ (select (select |#memory_int| 3) |~#value~0.offset|) 1))) |thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select (store |#memory_int| 3 (store (select |#memory_int| 3) |~#value~0.offset| (+ (select (select |#memory_int| 3) |~#value~0.offset|) 1))) |thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1)) |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_90) 3) |~#value~0.offset|) 4294967296)) (= (mod (select (select (store (store (store |#memory_int| 3 (store (select |#memory_int| 3) |~#value~0.offset| (+ (select (select |#memory_int| 3) |~#value~0.offset|) 1))) |thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select (store |#memory_int| 3 (store (select |#memory_int| 3) |~#value~0.offset| (+ (select (select |#memory_int| 3) |~#value~0.offset|) 1))) |thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1)) |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_90) |thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)))) (or (= (mod (select (select |#memory_int| 3) |~#value~0.offset|) 4294967296) 4294967295) (forall ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_17| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_90 (Array Int Int))) (or (not (= (select |#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_17|) 0)) (< (mod (select (select |#memory_int| 3) |~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |#memory_int| 3 (store (select |#memory_int| 3) |~#value~0.offset| (+ (select (select |#memory_int| 3) |~#value~0.offset|) 1))) |v_thr1Thread1of3ForFork0_~#casret~0#1.base_17| (store (select (store |#memory_int| 3 (store (select |#memory_int| 3) |~#value~0.offset| (+ (select (select |#memory_int| 3) |~#value~0.offset|) 1))) |v_thr1Thread1of3ForFork0_~#casret~0#1.base_17|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1)) |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_90) 3) |~#value~0.offset|) 4294967296))))) (= (select |#valid| 3) 1) (= |~#value~0.base| 3)), thr1Thread1of3ForFork0InUse, 55#L736-5true]) [2023-12-09 14:54:15,041 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-12-09 14:54:15,041 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-12-09 14:54:15,042 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-12-09 14:54:15,042 INFO L297 olderBase$Statistics]: existing Event has 56 ancestors and is cut-off event [2023-12-09 14:54:29,307 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L718-1-->L721: Formula: (= |v_thr1Thread3of3ForFork0_~v~0#1_3| (select (select |v_#memory_int_24| |v_~#value~0.base_16|) |v_~#value~0.offset_16|)) InVars {#memory_int=|v_#memory_int_24|, ~#value~0.base=|v_~#value~0.base_16|, ~#value~0.offset=|v_~#value~0.offset_16|} OutVars{#memory_int=|v_#memory_int_24|, thr1Thread3of3ForFork0_~v~0#1=|v_thr1Thread3of3ForFork0_~v~0#1_3|, ~#value~0.base=|v_~#value~0.base_16|, thr1Thread3of3ForFork0_#t~mem6#1=|v_thr1Thread3of3ForFork0_#t~mem6#1_1|, ~#value~0.offset=|v_~#value~0.offset_16|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~mem6#1, thr1Thread3of3ForFork0_~v~0#1][10085], [120#(and (= (+ |thr1Thread1of3ForFork0_~v~0#1| 1) |thr1Thread1of3ForFork0_~vn~0#1|) (not (= |thr1Thread1of3ForFork0_~#casret~0#1.base| 3)) (<= |thr1Thread1of3ForFork0_~v~0#1| (+ 4294967294 (* (div |thr1Thread1of3ForFork0_~v~0#1| 4294967296) 4294967296))) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#value~0.base| 3)), thr1Thread2of3ForFork0InUse, 452#(and (not (= |thr1Thread1of3ForFork0_~#casret~0#1.base| 3)) (or (< 0 (mod (select (select |#memory_int| 3) |~#value~0.offset|) 4294967296)) (= (mod |thr1Thread1of3ForFork0_#t~mem5#1| 4294967296) 0)) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread1of3ForFork0_~#casret~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#value~0.base| 3) (= |thr1Thread1of3ForFork0_~v~0#1| 0) (= |thr1Thread1of3ForFork0_~vn~0#1| 1)), 101#true, thr1Thread3of3ForFork0InUse, 44#L728-2true, 76#L726true, 91#L721true, 753#(and (or (= (mod (select (select |#memory_int| 3) |~#value~0.offset|) 4294967296) (mod |thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (forall ((v_DerPreprocessor_3 (Array Int Int))) (< (mod |thr1Thread2of3ForFork0_~v~0#1| 4294967296) (mod (select (select (store |#memory_int| |thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) 3) |~#value~0.offset|) 4294967296)))) (<= |thr1Thread2of3ForFork0_~v~0#1| (+ (* 4294967296 (div |thr1Thread2of3ForFork0_~v~0#1| 4294967296)) 4294967294)) (= (select |#valid| 3) 1) (= |~#value~0.base| 3) (not (= |thr1Thread2of3ForFork0_~#casret~0#1.base| 3)) (= (+ |thr1Thread2of3ForFork0_~v~0#1| 1) |thr1Thread2of3ForFork0_~vn~0#1|)), 55#L736-5true, thr1Thread1of3ForFork0InUse]) [2023-12-09 14:54:29,307 INFO L294 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2023-12-09 14:54:29,307 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-12-09 14:54:29,307 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-12-09 14:54:29,307 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2023-12-09 14:54:39,407 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L718-1-->L721: Formula: (= |v_thr1Thread3of3ForFork0_~v~0#1_3| (select (select |v_#memory_int_24| |v_~#value~0.base_16|) |v_~#value~0.offset_16|)) InVars {#memory_int=|v_#memory_int_24|, ~#value~0.base=|v_~#value~0.base_16|, ~#value~0.offset=|v_~#value~0.offset_16|} OutVars{#memory_int=|v_#memory_int_24|, thr1Thread3of3ForFork0_~v~0#1=|v_thr1Thread3of3ForFork0_~v~0#1_3|, ~#value~0.base=|v_~#value~0.base_16|, thr1Thread3of3ForFork0_#t~mem6#1=|v_thr1Thread3of3ForFork0_#t~mem6#1_1|, ~#value~0.offset=|v_~#value~0.offset_16|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~mem6#1, thr1Thread3of3ForFork0_~v~0#1][5371], [120#(and (= (+ |thr1Thread1of3ForFork0_~v~0#1| 1) |thr1Thread1of3ForFork0_~vn~0#1|) (not (= |thr1Thread1of3ForFork0_~#casret~0#1.base| 3)) (<= |thr1Thread1of3ForFork0_~v~0#1| (+ 4294967294 (* (div |thr1Thread1of3ForFork0_~v~0#1| 4294967296) 4294967296))) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#value~0.base| 3)), 40#L723true, thr1Thread2of3ForFork0InUse, 101#true, thr1Thread3of3ForFork0InUse, 759#(and (or (= (mod (select (select |#memory_int| 3) |~#value~0.offset|) 4294967296) (mod |thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (forall ((v_DerPreprocessor_3 (Array Int Int))) (< (mod |thr1Thread2of3ForFork0_~v~0#1| 4294967296) (mod (select (select (store |#memory_int| |thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) 3) |~#value~0.offset|) 4294967296))) (= 4294967295 (mod |thr1Thread2of3ForFork0_~v~0#1| 4294967296))) (= (select |#valid| 3) 1) (= |~#value~0.base| 3) (not (= |thr1Thread2of3ForFork0_~#casret~0#1.base| 3))), 91#L721true, 66#L726true, 415#(and (or (= (mod (select (select |#memory_int| 3) |~#value~0.offset|) 4294967296) 4294967295) (forall ((|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_90 (Array Int Int))) (or (< (mod (select (select |#memory_int| 3) |~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |#memory_int| 3 (store (select |#memory_int| 3) |~#value~0.offset| (+ (select (select |#memory_int| 3) |~#value~0.offset|) 1))) |thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select (store |#memory_int| 3 (store (select |#memory_int| 3) |~#value~0.offset| (+ (select (select |#memory_int| 3) |~#value~0.offset|) 1))) |thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1)) |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_90) 3) |~#value~0.offset|) 4294967296)) (= (mod (select (select (store (store (store |#memory_int| 3 (store (select |#memory_int| 3) |~#value~0.offset| (+ (select (select |#memory_int| 3) |~#value~0.offset|) 1))) |thr1Thread1of3ForFork0_~#casret~0#1.base| (store (select (store |#memory_int| 3 (store (select |#memory_int| 3) |~#value~0.offset| (+ (select (select |#memory_int| 3) |~#value~0.offset|) 1))) |thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1)) |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_90) |thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)))) (or (= (mod (select (select |#memory_int| 3) |~#value~0.offset|) 4294967296) 4294967295) (forall ((|v_thr1Thread1of3ForFork0_~#casret~0#1.base_17| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_90 (Array Int Int))) (or (not (= (select |#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_17|) 0)) (< (mod (select (select |#memory_int| 3) |~#value~0.offset|) 4294967296) (mod (select (select (store (store (store |#memory_int| 3 (store (select |#memory_int| 3) |~#value~0.offset| (+ (select (select |#memory_int| 3) |~#value~0.offset|) 1))) |v_thr1Thread1of3ForFork0_~#casret~0#1.base_17| (store (select (store |#memory_int| 3 (store (select |#memory_int| 3) |~#value~0.offset| (+ (select (select |#memory_int| 3) |~#value~0.offset|) 1))) |v_thr1Thread1of3ForFork0_~#casret~0#1.base_17|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1)) |ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_90) 3) |~#value~0.offset|) 4294967296))))) (= (select |#valid| 3) 1) (= |~#value~0.base| 3)), 23#L736-4true, thr1Thread1of3ForFork0InUse]) [2023-12-09 14:54:39,407 INFO L294 olderBase$Statistics]: this new event has 62 ancestors and is cut-off event [2023-12-09 14:54:39,407 INFO L297 olderBase$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-12-09 14:54:39,407 INFO L297 olderBase$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-12-09 14:54:39,407 INFO L297 olderBase$Statistics]: existing Event has 62 ancestors and is cut-off event [2023-12-09 14:55:00,902 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L718-1-->L721: Formula: (= |v_thr1Thread3of3ForFork0_~v~0#1_3| (select (select |v_#memory_int_24| |v_~#value~0.base_16|) |v_~#value~0.offset_16|)) InVars {#memory_int=|v_#memory_int_24|, ~#value~0.base=|v_~#value~0.base_16|, ~#value~0.offset=|v_~#value~0.offset_16|} OutVars{#memory_int=|v_#memory_int_24|, thr1Thread3of3ForFork0_~v~0#1=|v_thr1Thread3of3ForFork0_~v~0#1_3|, ~#value~0.base=|v_~#value~0.base_16|, thr1Thread3of3ForFork0_#t~mem6#1=|v_thr1Thread3of3ForFork0_#t~mem6#1_1|, ~#value~0.offset=|v_~#value~0.offset_16|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~mem6#1, thr1Thread3of3ForFork0_~v~0#1][10085], [120#(and (= (+ |thr1Thread1of3ForFork0_~v~0#1| 1) |thr1Thread1of3ForFork0_~vn~0#1|) (not (= |thr1Thread1of3ForFork0_~#casret~0#1.base| 3)) (<= |thr1Thread1of3ForFork0_~v~0#1| (+ 4294967294 (* (div |thr1Thread1of3ForFork0_~v~0#1| 4294967296) 4294967296))) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#value~0.base| 3)), thr1Thread2of3ForFork0InUse, 452#(and (not (= |thr1Thread1of3ForFork0_~#casret~0#1.base| 3)) (or (< 0 (mod (select (select |#memory_int| 3) |~#value~0.offset|) 4294967296)) (= (mod |thr1Thread1of3ForFork0_#t~mem5#1| 4294967296) 0)) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread1of3ForFork0_~#casret~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#value~0.base| 3) (= |thr1Thread1of3ForFork0_~v~0#1| 0) (= |thr1Thread1of3ForFork0_~vn~0#1| 1)), 101#true, thr1Thread3of3ForFork0InUse, 44#L728-2true, 76#L726true, 91#L721true, 753#(and (or (= (mod (select (select |#memory_int| 3) |~#value~0.offset|) 4294967296) (mod |thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (forall ((v_DerPreprocessor_3 (Array Int Int))) (< (mod |thr1Thread2of3ForFork0_~v~0#1| 4294967296) (mod (select (select (store |#memory_int| |thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) 3) |~#value~0.offset|) 4294967296)))) (<= |thr1Thread2of3ForFork0_~v~0#1| (+ (* 4294967296 (div |thr1Thread2of3ForFork0_~v~0#1| 4294967296)) 4294967294)) (= (select |#valid| 3) 1) (= |~#value~0.base| 3) (not (= |thr1Thread2of3ForFork0_~#casret~0#1.base| 3)) (= (+ |thr1Thread2of3ForFork0_~v~0#1| 1) |thr1Thread2of3ForFork0_~vn~0#1|)), 23#L736-4true, thr1Thread1of3ForFork0InUse]) [2023-12-09 14:55:00,903 INFO L294 olderBase$Statistics]: this new event has 66 ancestors and is cut-off event [2023-12-09 14:55:00,903 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-12-09 14:55:00,903 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-12-09 14:55:00,903 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-12-09 14:55:13,888 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L718-1-->L721: Formula: (= |v_thr1Thread3of3ForFork0_~v~0#1_3| (select (select |v_#memory_int_24| |v_~#value~0.base_16|) |v_~#value~0.offset_16|)) InVars {#memory_int=|v_#memory_int_24|, ~#value~0.base=|v_~#value~0.base_16|, ~#value~0.offset=|v_~#value~0.offset_16|} OutVars{#memory_int=|v_#memory_int_24|, thr1Thread3of3ForFork0_~v~0#1=|v_thr1Thread3of3ForFork0_~v~0#1_3|, ~#value~0.base=|v_~#value~0.base_16|, thr1Thread3of3ForFork0_#t~mem6#1=|v_thr1Thread3of3ForFork0_#t~mem6#1_1|, ~#value~0.offset=|v_~#value~0.offset_16|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~mem6#1, thr1Thread3of3ForFork0_~v~0#1][13857], [thr1Thread2of3ForFork0InUse, 101#true, thr1Thread3of3ForFork0InUse, 76#L726true, 47#L718-2true, 91#L721true, 134#(and (= (+ |thr1Thread1of3ForFork0_~v~0#1| 1) |thr1Thread1of3ForFork0_~vn~0#1|) (not (= |thr1Thread1of3ForFork0_~#casret~0#1.base| 3)) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#value~0.base| 3) (<= (+ |thr1Thread1of3ForFork0_~v~0#1| (* (div (select (select |#memory_int| 3) |~#value~0.offset|) 4294967296) 4294967296) 1) (+ (select (select |#memory_int| 3) |~#value~0.offset|) (* (div |thr1Thread1of3ForFork0_~v~0#1| 4294967296) 4294967296)))), 454#(and (= (select (select |#memory_int| 3) |~#value~0.offset|) 1) (not (= |thr1Thread1of3ForFork0_~#casret~0#1.base| 3)) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (not (= |thr1Thread1of3ForFork0_~#casret~0#1.base| |ULTIMATE.start_main_~#t~0#1.base|)) (= |~#value~0.base| 3) (= |thr1Thread1of3ForFork0_~v~0#1| 0) (= |thr1Thread1of3ForFork0_~vn~0#1| 1)), 753#(and (or (= (mod (select (select |#memory_int| 3) |~#value~0.offset|) 4294967296) (mod |thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (forall ((v_DerPreprocessor_3 (Array Int Int))) (< (mod |thr1Thread2of3ForFork0_~v~0#1| 4294967296) (mod (select (select (store |#memory_int| |thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) 3) |~#value~0.offset|) 4294967296)))) (<= |thr1Thread2of3ForFork0_~v~0#1| (+ (* 4294967296 (div |thr1Thread2of3ForFork0_~v~0#1| 4294967296)) 4294967294)) (= (select |#valid| 3) 1) (= |~#value~0.base| 3) (not (= |thr1Thread2of3ForFork0_~#casret~0#1.base| 3)) (= (+ |thr1Thread2of3ForFork0_~v~0#1| 1) |thr1Thread2of3ForFork0_~vn~0#1|)), 23#L736-4true, thr1Thread1of3ForFork0InUse]) [2023-12-09 14:55:13,889 INFO L294 olderBase$Statistics]: this new event has 67 ancestors and is not cut-off event [2023-12-09 14:55:13,889 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is not cut-off event [2023-12-09 14:55:13,889 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is not cut-off event [2023-12-09 14:55:13,889 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is not cut-off event [2023-12-09 14:55:14,327 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L718-1-->L721: Formula: (= |v_thr1Thread3of3ForFork0_~v~0#1_3| (select (select |v_#memory_int_24| |v_~#value~0.base_16|) |v_~#value~0.offset_16|)) InVars {#memory_int=|v_#memory_int_24|, ~#value~0.base=|v_~#value~0.base_16|, ~#value~0.offset=|v_~#value~0.offset_16|} OutVars{#memory_int=|v_#memory_int_24|, thr1Thread3of3ForFork0_~v~0#1=|v_thr1Thread3of3ForFork0_~v~0#1_3|, ~#value~0.base=|v_~#value~0.base_16|, thr1Thread3of3ForFork0_#t~mem6#1=|v_thr1Thread3of3ForFork0_#t~mem6#1_1|, ~#value~0.offset=|v_~#value~0.offset_16|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~mem6#1, thr1Thread3of3ForFork0_~v~0#1][14086], [thr1Thread2of3ForFork0InUse, 101#true, thr1Thread3of3ForFork0InUse, 76#L726true, 47#L718-2true, 91#L721true, 134#(and (= (+ |thr1Thread1of3ForFork0_~v~0#1| 1) |thr1Thread1of3ForFork0_~vn~0#1|) (not (= |thr1Thread1of3ForFork0_~#casret~0#1.base| 3)) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#value~0.base| 3) (<= (+ |thr1Thread1of3ForFork0_~v~0#1| (* (div (select (select |#memory_int| 3) |~#value~0.offset|) 4294967296) 4294967296) 1) (+ (select (select |#memory_int| 3) |~#value~0.offset|) (* (div |thr1Thread1of3ForFork0_~v~0#1| 4294967296) 4294967296)))), 152#true, 753#(and (or (= (mod (select (select |#memory_int| 3) |~#value~0.offset|) 4294967296) (mod |thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (forall ((v_DerPreprocessor_3 (Array Int Int))) (< (mod |thr1Thread2of3ForFork0_~v~0#1| 4294967296) (mod (select (select (store |#memory_int| |thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) 3) |~#value~0.offset|) 4294967296)))) (<= |thr1Thread2of3ForFork0_~v~0#1| (+ (* 4294967296 (div |thr1Thread2of3ForFork0_~v~0#1| 4294967296)) 4294967294)) (= (select |#valid| 3) 1) (= |~#value~0.base| 3) (not (= |thr1Thread2of3ForFork0_~#casret~0#1.base| 3)) (= (+ |thr1Thread2of3ForFork0_~v~0#1| 1) |thr1Thread2of3ForFork0_~vn~0#1|)), 23#L736-4true, thr1Thread1of3ForFork0InUse]) [2023-12-09 14:55:14,328 INFO L294 olderBase$Statistics]: this new event has 67 ancestors and is not cut-off event [2023-12-09 14:55:14,328 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is not cut-off event [2023-12-09 14:55:14,328 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is not cut-off event [2023-12-09 14:55:14,328 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is not cut-off event [2023-12-09 14:55:14,331 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([367] L718-1-->L721: Formula: (= |v_thr1Thread3of3ForFork0_~v~0#1_3| (select (select |v_#memory_int_24| |v_~#value~0.base_16|) |v_~#value~0.offset_16|)) InVars {#memory_int=|v_#memory_int_24|, ~#value~0.base=|v_~#value~0.base_16|, ~#value~0.offset=|v_~#value~0.offset_16|} OutVars{#memory_int=|v_#memory_int_24|, thr1Thread3of3ForFork0_~v~0#1=|v_thr1Thread3of3ForFork0_~v~0#1_3|, ~#value~0.base=|v_~#value~0.base_16|, thr1Thread3of3ForFork0_#t~mem6#1=|v_thr1Thread3of3ForFork0_#t~mem6#1_1|, ~#value~0.offset=|v_~#value~0.offset_16|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~mem6#1, thr1Thread3of3ForFork0_~v~0#1][14099], [thr1Thread2of3ForFork0InUse, 101#true, thr1Thread3of3ForFork0InUse, 76#L726true, 47#L718-2true, 91#L721true, 134#(and (= (+ |thr1Thread1of3ForFork0_~v~0#1| 1) |thr1Thread1of3ForFork0_~vn~0#1|) (not (= |thr1Thread1of3ForFork0_~#casret~0#1.base| 3)) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|)) (= (select |#valid| 3) 1) (= |~#value~0.base| 3) (<= (+ |thr1Thread1of3ForFork0_~v~0#1| (* (div (select (select |#memory_int| 3) |~#value~0.offset|) 4294967296) 4294967296) 1) (+ (select (select |#memory_int| 3) |~#value~0.offset|) (* (div |thr1Thread1of3ForFork0_~v~0#1| 4294967296) 4294967296)))), 155#(and (= (select |#valid| 3) 1) (= |~#value~0.base| 3)), 753#(and (or (= (mod (select (select |#memory_int| 3) |~#value~0.offset|) 4294967296) (mod |thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (forall ((v_DerPreprocessor_3 (Array Int Int))) (< (mod |thr1Thread2of3ForFork0_~v~0#1| 4294967296) (mod (select (select (store |#memory_int| |thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_3) 3) |~#value~0.offset|) 4294967296)))) (<= |thr1Thread2of3ForFork0_~v~0#1| (+ (* 4294967296 (div |thr1Thread2of3ForFork0_~v~0#1| 4294967296)) 4294967294)) (= (select |#valid| 3) 1) (= |~#value~0.base| 3) (not (= |thr1Thread2of3ForFork0_~#casret~0#1.base| 3)) (= (+ |thr1Thread2of3ForFork0_~v~0#1| 1) |thr1Thread2of3ForFork0_~vn~0#1|)), 23#L736-4true, thr1Thread1of3ForFork0InUse]) [2023-12-09 14:55:14,331 INFO L294 olderBase$Statistics]: this new event has 67 ancestors and is not cut-off event [2023-12-09 14:55:14,331 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is not cut-off event [2023-12-09 14:55:14,331 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is not cut-off event [2023-12-09 14:55:14,332 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is not cut-off event Received shutdown request... [2023-12-09 14:55:21,630 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 14:55:21,631 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-09 14:55:22,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-09 14:55:22,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2023-12-09 14:55:23,356 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-12-09 14:55:23,356 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-09 14:55:23,356 WARN L624 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-12-09 14:55:23,356 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-12-09 14:55:23,356 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-12-09 14:55:23,356 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-12-09 14:55:23,356 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-12-09 14:55:23,357 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-09 14:55:23,359 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2023-12-09 14:55:23,360 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-09 14:55:23,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 02:55:23 BasicIcfg [2023-12-09 14:55:23,363 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-09 14:55:23,363 INFO L158 Benchmark]: Toolchain (without parser) took 231508.81ms. Allocated memory was 225.4MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 171.9MB in the beginning and 4.8GB in the end (delta: -4.6GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. [2023-12-09 14:55:23,363 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 225.4MB. Free memory was 175.4MB in the beginning and 175.2MB in the end (delta: 178.3kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-09 14:55:23,364 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.12ms. Allocated memory is still 225.4MB. Free memory was 171.6MB in the beginning and 152.0MB in the end (delta: 19.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-09 14:55:23,364 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.57ms. Allocated memory is still 225.4MB. Free memory was 152.0MB in the beginning and 149.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-09 14:55:23,364 INFO L158 Benchmark]: Boogie Preprocessor took 15.93ms. Allocated memory is still 225.4MB. Free memory was 149.9MB in the beginning and 148.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-09 14:55:23,364 INFO L158 Benchmark]: RCFGBuilder took 371.56ms. Allocated memory was 225.4MB in the beginning and 287.3MB in the end (delta: 61.9MB). Free memory was 148.5MB in the beginning and 253.2MB in the end (delta: -104.7MB). Peak memory consumption was 26.0MB. Max. memory is 8.0GB. [2023-12-09 14:55:23,364 INFO L158 Benchmark]: TraceAbstraction took 230693.15ms. Allocated memory was 287.3MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 252.7MB in the beginning and 4.8GB in the end (delta: -4.5GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. [2023-12-09 14:55:23,365 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.11ms. Allocated memory is still 225.4MB. Free memory was 175.4MB in the beginning and 175.2MB in the end (delta: 178.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 388.12ms. Allocated memory is still 225.4MB. Free memory was 171.6MB in the beginning and 152.0MB in the end (delta: 19.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.57ms. Allocated memory is still 225.4MB. Free memory was 152.0MB in the beginning and 149.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 15.93ms. Allocated memory is still 225.4MB. Free memory was 149.9MB in the beginning and 148.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 371.56ms. Allocated memory was 225.4MB in the beginning and 287.3MB in the end (delta: 61.9MB). Free memory was 148.5MB in the beginning and 253.2MB in the end (delta: -104.7MB). Peak memory consumption was 26.0MB. Max. memory is 8.0GB. * TraceAbstraction took 230693.15ms. Allocated memory was 287.3MB in the beginning and 8.0GB in the end (delta: 7.7GB). Free memory was 252.7MB in the beginning and 4.8GB in the end (delta: -4.5GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 730]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 736]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 70 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 0 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 22 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 92 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.7s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 214 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 214 mSDsluCounter, 126 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 106 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 512 IncrementalHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 20 mSDtfsCounter, 512 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1132occurred in iteration=2, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 83 NumberOfCodeBlocks, 83 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 50 ConstructedInterpolants, 0 QuantifiedInterpolants, 345 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 114 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 228.5s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 221.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 715 mSolverCounterUnknown, 3489 SdHoareTripleChecker+Valid, 96.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3489 mSDsluCounter, 653 SdHoareTripleChecker+Invalid, 94.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4266 IncrementalHoareTripleChecker+Unchecked, 584 mSDsCounter, 380 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5549 IncrementalHoareTripleChecker+Invalid, 10910 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 380 mSolverCounterUnsat, 69 mSDtfsCounter, 5549 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 715 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 113 SyntacticMatches, 8 SemanticMatches, 165 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3396 ImplicationChecksByTransitivity, 30.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27894occurred in iteration=3, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 257 ConstructedInterpolants, 52 QuantifiedInterpolants, 6603 SizeOfPredicates, 17 NumberOfNonLiveVariables, 222 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 12/27 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