/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 10:08:35,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 10:08:35,593 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-VariableLbe.epf [2023-08-24 10:08:35,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 10:08:35,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 10:08:35,636 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 10:08:35,637 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 10:08:35,637 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 10:08:35,638 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 10:08:35,638 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 10:08:35,639 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 10:08:35,639 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 10:08:35,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 10:08:35,645 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 10:08:35,645 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 10:08:35,645 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 10:08:35,646 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 10:08:35,647 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 10:08:35,647 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 10:08:35,647 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 10:08:35,647 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 10:08:35,648 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 10:08:35,648 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 10:08:35,648 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 10:08:35,649 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 10:08:35,649 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 10:08:35,649 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 10:08:35,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 10:08:35,650 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 10:08:35,650 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 10:08:35,651 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 10:08:35,652 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 10:08:35,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 10:08:35,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 10:08:35,652 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 10:08:35,657 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-24 10:08:35,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 10:08:36,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 10:08:36,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 10:08:36,030 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 10:08:36,030 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 10:08:36,032 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2023-08-24 10:08:37,232 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 10:08:37,480 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 10:08:37,480 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2023-08-24 10:08:37,486 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80b9b030e/1d2a50ff301649d9864341200a0dc147/FLAGe45b55a97 [2023-08-24 10:08:37,498 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80b9b030e/1d2a50ff301649d9864341200a0dc147 [2023-08-24 10:08:37,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 10:08:37,501 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 10:08:37,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 10:08:37,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 10:08:37,504 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 10:08:37,505 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 10:08:37" (1/1) ... [2023-08-24 10:08:37,506 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cec17a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:08:37, skipping insertion in model container [2023-08-24 10:08:37,506 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 10:08:37" (1/1) ... [2023-08-24 10:08:37,527 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 10:08:37,706 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c[3107,3120] [2023-08-24 10:08:37,715 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 10:08:37,725 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 10:08:37,762 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c[3107,3120] [2023-08-24 10:08:37,765 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 10:08:37,777 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 10:08:37,777 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 10:08:37,783 INFO L206 MainTranslator]: Completed translation [2023-08-24 10:08:37,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:08:37 WrapperNode [2023-08-24 10:08:37,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 10:08:37,786 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 10:08:37,786 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 10:08:37,786 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 10:08:37,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:08:37" (1/1) ... [2023-08-24 10:08:37,809 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:08:37" (1/1) ... [2023-08-24 10:08:37,840 INFO L138 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 165 [2023-08-24 10:08:37,840 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 10:08:37,841 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 10:08:37,841 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 10:08:37,841 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 10:08:37,849 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:08:37" (1/1) ... [2023-08-24 10:08:37,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:08:37" (1/1) ... [2023-08-24 10:08:37,863 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:08:37" (1/1) ... [2023-08-24 10:08:37,864 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:08:37" (1/1) ... [2023-08-24 10:08:37,872 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:08:37" (1/1) ... [2023-08-24 10:08:37,875 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:08:37" (1/1) ... [2023-08-24 10:08:37,877 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:08:37" (1/1) ... [2023-08-24 10:08:37,878 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:08:37" (1/1) ... [2023-08-24 10:08:37,880 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 10:08:37,893 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 10:08:37,893 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 10:08:37,893 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 10:08:37,894 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:08:37" (1/1) ... [2023-08-24 10:08:37,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 10:08:37,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:08:37,926 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-08-24 10:08:37,947 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-08-24 10:08:37,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 10:08:37,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 10:08:37,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 10:08:37,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 10:08:37,967 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 10:08:37,967 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 10:08:37,967 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 10:08:37,967 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 10:08:37,967 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-24 10:08:37,967 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-24 10:08:37,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 10:08:37,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 10:08:37,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 10:08:37,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-24 10:08:37,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 10:08:37,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 10:08:37,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 10:08:37,970 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 10:08:38,083 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 10:08:38,085 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 10:08:38,347 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 10:08:38,413 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 10:08:38,414 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-24 10:08:38,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 10:08:38 BoogieIcfgContainer [2023-08-24 10:08:38,416 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 10:08:38,418 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 10:08:38,418 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 10:08:38,421 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 10:08:38,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 10:08:37" (1/3) ... [2023-08-24 10:08:38,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e9b300c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 10:08:38, skipping insertion in model container [2023-08-24 10:08:38,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:08:37" (2/3) ... [2023-08-24 10:08:38,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e9b300c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 10:08:38, skipping insertion in model container [2023-08-24 10:08:38,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 10:08:38" (3/3) ... [2023-08-24 10:08:38,424 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2023-08-24 10:08:38,439 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 10:08:38,439 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 10:08:38,439 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 10:08:38,497 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-24 10:08:38,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 136 transitions, 296 flow [2023-08-24 10:08:38,605 INFO L124 PetriNetUnfolderBase]: 10/133 cut-off events. [2023-08-24 10:08:38,605 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 10:08:38,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 10/133 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 111. Up to 2 conditions per place. [2023-08-24 10:08:38,610 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 136 transitions, 296 flow [2023-08-24 10:08:38,620 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 123 transitions, 264 flow [2023-08-24 10:08:38,624 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 10:08:38,632 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 123 transitions, 264 flow [2023-08-24 10:08:38,635 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 123 transitions, 264 flow [2023-08-24 10:08:38,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 123 transitions, 264 flow [2023-08-24 10:08:38,665 INFO L124 PetriNetUnfolderBase]: 10/123 cut-off events. [2023-08-24 10:08:38,666 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 10:08:38,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 123 events. 10/123 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 111. Up to 2 conditions per place. [2023-08-24 10:08:38,668 INFO L119 LiptonReduction]: Number of co-enabled transitions 1262 [2023-08-24 10:08:42,644 INFO L134 LiptonReduction]: Checked pairs total: 2063 [2023-08-24 10:08:42,644 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-08-24 10:08:42,657 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 10:08:42,663 INFO L357 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@cf2e712, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 10:08:42,663 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-24 10:08:42,670 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 10:08:42,670 INFO L124 PetriNetUnfolderBase]: 3/23 cut-off events. [2023-08-24 10:08:42,670 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 10:08:42,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:08:42,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:08:42,671 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 10:08:42,676 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:08:42,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1116037830, now seen corresponding path program 1 times [2023-08-24 10:08:42,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:08:42,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390852527] [2023-08-24 10:08:42,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:08:42,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:08:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:08:43,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:08:43,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:08:43,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390852527] [2023-08-24 10:08:43,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390852527] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 10:08:43,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 10:08:43,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 10:08:43,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822695670] [2023-08-24 10:08:43,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 10:08:43,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 10:08:43,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:08:43,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 10:08:43,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 10:08:43,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 248 [2023-08-24 10:08:43,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 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-08-24 10:08:43,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:08:43,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 248 [2023-08-24 10:08:43,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:08:43,220 INFO L124 PetriNetUnfolderBase]: 214/342 cut-off events. [2023-08-24 10:08:43,220 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-08-24 10:08:43,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 734 conditions, 342 events. 214/342 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1036 event pairs, 15 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 616. Up to 121 conditions per place. [2023-08-24 10:08:43,224 INFO L140 encePairwiseOnDemand]: 243/248 looper letters, 48 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2023-08-24 10:08:43,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 53 transitions, 242 flow [2023-08-24 10:08:43,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 10:08:43,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 10:08:43,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2023-08-24 10:08:43,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49193548387096775 [2023-08-24 10:08:43,245 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 610 transitions. [2023-08-24 10:08:43,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 610 transitions. [2023-08-24 10:08:43,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:08:43,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 610 transitions. [2023-08-24 10:08:43,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 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-08-24 10:08:43,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 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-08-24 10:08:43,263 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 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-08-24 10:08:43,265 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 66 flow. Second operand 5 states and 610 transitions. [2023-08-24 10:08:43,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 53 transitions, 242 flow [2023-08-24 10:08:43,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 53 transitions, 219 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-08-24 10:08:43,271 INFO L231 Difference]: Finished difference. Result has 31 places, 27 transitions, 82 flow [2023-08-24 10:08:43,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=31, PETRI_TRANSITIONS=27} [2023-08-24 10:08:43,279 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2023-08-24 10:08:43,279 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 27 transitions, 82 flow [2023-08-24 10:08:43,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 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-08-24 10:08:43,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:08:43,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:08:43,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 10:08:43,281 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 10:08:43,282 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:08:43,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1567348952, now seen corresponding path program 2 times [2023-08-24 10:08:43,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:08:43,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822432426] [2023-08-24 10:08:43,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:08:43,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:08:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:08:43,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:08:43,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:08:43,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822432426] [2023-08-24 10:08:43,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822432426] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 10:08:43,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 10:08:43,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 10:08:43,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368358594] [2023-08-24 10:08:43,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 10:08:43,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 10:08:43,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:08:43,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 10:08:43,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 10:08:43,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 248 [2023-08-24 10:08:43,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 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-08-24 10:08:43,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:08:43,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 248 [2023-08-24 10:08:43,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:08:43,601 INFO L124 PetriNetUnfolderBase]: 209/341 cut-off events. [2023-08-24 10:08:43,601 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2023-08-24 10:08:43,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 341 events. 209/341 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1074 event pairs, 30 based on Foata normal form. 0/328 useless extension candidates. Maximal degree in co-relation 452. Up to 167 conditions per place. [2023-08-24 10:08:43,606 INFO L140 encePairwiseOnDemand]: 243/248 looper letters, 44 selfloop transitions, 7 changer transitions 0/51 dead transitions. [2023-08-24 10:08:43,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 51 transitions, 258 flow [2023-08-24 10:08:43,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 10:08:43,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 10:08:43,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2023-08-24 10:08:43,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4870967741935484 [2023-08-24 10:08:43,610 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 604 transitions. [2023-08-24 10:08:43,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 604 transitions. [2023-08-24 10:08:43,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:08:43,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 604 transitions. [2023-08-24 10:08:43,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 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-08-24 10:08:43,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 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-08-24 10:08:43,615 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 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-08-24 10:08:43,616 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 82 flow. Second operand 5 states and 604 transitions. [2023-08-24 10:08:43,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 51 transitions, 258 flow [2023-08-24 10:08:43,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 51 transitions, 253 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 10:08:43,620 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 123 flow [2023-08-24 10:08:43,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2023-08-24 10:08:43,621 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2023-08-24 10:08:43,622 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 123 flow [2023-08-24 10:08:43,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 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-08-24 10:08:43,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:08:43,628 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:08:43,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 10:08:43,629 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 10:08:43,632 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:08:43,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1909084888, now seen corresponding path program 3 times [2023-08-24 10:08:43,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:08:43,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018574658] [2023-08-24 10:08:43,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:08:43,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:08:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:08:43,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:08:43,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:08:43,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018574658] [2023-08-24 10:08:43,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018574658] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 10:08:43,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 10:08:43,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 10:08:43,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692282529] [2023-08-24 10:08:43,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 10:08:43,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 10:08:43,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:08:43,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 10:08:43,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 10:08:43,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 248 [2023-08-24 10:08:43,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 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-08-24 10:08:43,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:08:43,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 248 [2023-08-24 10:08:43,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:08:44,004 INFO L124 PetriNetUnfolderBase]: 328/534 cut-off events. [2023-08-24 10:08:44,004 INFO L125 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES. [2023-08-24 10:08:44,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1478 conditions, 534 events. 328/534 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1999 event pairs, 14 based on Foata normal form. 24/557 useless extension candidates. Maximal degree in co-relation 781. Up to 202 conditions per place. [2023-08-24 10:08:44,008 INFO L140 encePairwiseOnDemand]: 242/248 looper letters, 51 selfloop transitions, 6 changer transitions 15/72 dead transitions. [2023-08-24 10:08:44,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 72 transitions, 418 flow [2023-08-24 10:08:44,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 10:08:44,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 10:08:44,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 721 transitions. [2023-08-24 10:08:44,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845430107526882 [2023-08-24 10:08:44,010 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 721 transitions. [2023-08-24 10:08:44,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 721 transitions. [2023-08-24 10:08:44,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:08:44,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 721 transitions. [2023-08-24 10:08:44,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.16666666666667) internal successors, (721), 6 states have internal predecessors, (721), 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-08-24 10:08:44,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 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-08-24 10:08:44,016 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 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-08-24 10:08:44,016 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 123 flow. Second operand 6 states and 721 transitions. [2023-08-24 10:08:44,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 72 transitions, 418 flow [2023-08-24 10:08:44,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 72 transitions, 413 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 10:08:44,020 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 128 flow [2023-08-24 10:08:44,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=128, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2023-08-24 10:08:44,021 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2023-08-24 10:08:44,024 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 128 flow [2023-08-24 10:08:44,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 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-08-24 10:08:44,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:08:44,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:08:44,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 10:08:44,025 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 10:08:44,025 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:08:44,025 INFO L85 PathProgramCache]: Analyzing trace with hash -957600211, now seen corresponding path program 1 times [2023-08-24 10:08:44,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:08:44,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511852747] [2023-08-24 10:08:44,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:08:44,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:08:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:08:44,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:08:44,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:08:44,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511852747] [2023-08-24 10:08:44,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511852747] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 10:08:44,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 10:08:44,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 10:08:44,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530474406] [2023-08-24 10:08:44,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 10:08:44,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 10:08:44,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:08:44,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 10:08:44,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 10:08:44,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 248 [2023-08-24 10:08:44,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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-08-24 10:08:44,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:08:44,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 248 [2023-08-24 10:08:44,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:08:44,205 INFO L124 PetriNetUnfolderBase]: 80/163 cut-off events. [2023-08-24 10:08:44,205 INFO L125 PetriNetUnfolderBase]: For 349/375 co-relation queries the response was YES. [2023-08-24 10:08:44,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 163 events. 80/163 cut-off events. For 349/375 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 464 event pairs, 15 based on Foata normal form. 36/194 useless extension candidates. Maximal degree in co-relation 463. Up to 121 conditions per place. [2023-08-24 10:08:44,208 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 24 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2023-08-24 10:08:44,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 175 flow [2023-08-24 10:08:44,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 10:08:44,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 10:08:44,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-08-24 10:08:44,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48655913978494625 [2023-08-24 10:08:44,210 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-08-24 10:08:44,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-08-24 10:08:44,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:08:44,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-08-24 10:08:44,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:08:44,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 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-08-24 10:08:44,213 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 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-08-24 10:08:44,213 INFO L175 Difference]: Start difference. First operand has 43 places, 29 transitions, 128 flow. Second operand 3 states and 362 transitions. [2023-08-24 10:08:44,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 175 flow [2023-08-24 10:08:44,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 153 flow, removed 1 selfloop flow, removed 10 redundant places. [2023-08-24 10:08:44,216 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 104 flow [2023-08-24 10:08:44,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2023-08-24 10:08:44,218 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2023-08-24 10:08:44,218 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 104 flow [2023-08-24 10:08:44,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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-08-24 10:08:44,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:08:44,219 INFO L208 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-08-24 10:08:44,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 10:08:44,219 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 10:08:44,220 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:08:44,220 INFO L85 PathProgramCache]: Analyzing trace with hash -2068012950, now seen corresponding path program 1 times [2023-08-24 10:08:44,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:08:44,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442296828] [2023-08-24 10:08:44,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:08:44,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:08:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:08:44,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 10:08:44,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:08:44,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442296828] [2023-08-24 10:08:44,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442296828] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 10:08:44,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 10:08:44,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 10:08:44,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374420028] [2023-08-24 10:08:44,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 10:08:44,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 10:08:44,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:08:44,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 10:08:44,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 10:08:44,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 248 [2023-08-24 10:08:44,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 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-08-24 10:08:44,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:08:44,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 248 [2023-08-24 10:08:44,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:08:44,376 INFO L124 PetriNetUnfolderBase]: 83/178 cut-off events. [2023-08-24 10:08:44,376 INFO L125 PetriNetUnfolderBase]: For 245/289 co-relation queries the response was YES. [2023-08-24 10:08:44,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 178 events. 83/178 cut-off events. For 245/289 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 40 based on Foata normal form. 48/219 useless extension candidates. Maximal degree in co-relation 376. Up to 137 conditions per place. [2023-08-24 10:08:44,377 INFO L140 encePairwiseOnDemand]: 244/248 looper letters, 22 selfloop transitions, 2 changer transitions 8/37 dead transitions. [2023-08-24 10:08:44,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 37 transitions, 190 flow [2023-08-24 10:08:44,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 10:08:44,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 10:08:44,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 447 transitions. [2023-08-24 10:08:44,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45060483870967744 [2023-08-24 10:08:44,380 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 447 transitions. [2023-08-24 10:08:44,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 447 transitions. [2023-08-24 10:08:44,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:08:44,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 447 transitions. [2023-08-24 10:08:44,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 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-08-24 10:08:44,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 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-08-24 10:08:44,383 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 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-08-24 10:08:44,383 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 104 flow. Second operand 4 states and 447 transitions. [2023-08-24 10:08:44,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 37 transitions, 190 flow [2023-08-24 10:08:44,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 188 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 10:08:44,385 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 116 flow [2023-08-24 10:08:44,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2023-08-24 10:08:44,386 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2023-08-24 10:08:44,386 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 116 flow [2023-08-24 10:08:44,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 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-08-24 10:08:44,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:08:44,386 INFO L208 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] [2023-08-24 10:08:44,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 10:08:44,387 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 10:08:44,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:08:44,387 INFO L85 PathProgramCache]: Analyzing trace with hash 876728516, now seen corresponding path program 1 times [2023-08-24 10:08:44,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:08:44,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564617737] [2023-08-24 10:08:44,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:08:44,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:08:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:08:45,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:08:45,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:08:45,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564617737] [2023-08-24 10:08:45,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564617737] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:08:45,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29803230] [2023-08-24 10:08:45,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:08:45,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:08:45,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:08:45,085 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-08-24 10:08:45,106 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-08-24 10:08:45,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:08:45,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 47 conjunts are in the unsatisfiable core [2023-08-24 10:08:45,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:08:45,342 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-24 10:08:45,398 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 10:08:45,452 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 10:08:45,503 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 10:08:45,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:08:45,677 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:08:46,145 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< c_~back~0 0) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse1 (+ c_~queue~0.offset (* c_~back~0 4)))) (and (forall ((v_ArrVal_149 (Array Int Int)) (v_ArrVal_148 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base))) (or (not (= (select .cse0 .cse1) 1)) (<= (+ c_~sum~0 (select .cse0 .cse2)) 1)))) (forall ((v_ArrVal_149 (Array Int Int)) (v_ArrVal_148 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse3 .cse2))) (not (= (select .cse3 .cse1) 1)))))))) is different from false [2023-08-24 10:08:46,236 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse2 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_149 (Array Int Int)) (v_ArrVal_148 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse0 .cse1) 1)) (<= 0 (+ c_~sum~0 (select .cse0 .cse2)))))) (forall ((v_ArrVal_149 (Array Int Int)) (v_ArrVal_148 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (<= (+ c_~sum~0 (select .cse3 .cse2)) 1) (not (= (select .cse3 .cse1) 1))))))) (< c_~back~0 0)) is different from false [2023-08-24 10:08:46,274 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:08:46,274 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 56 [2023-08-24 10:08:46,291 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:08:46,291 INFO L351 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 644 treesize of output 620 [2023-08-24 10:08:46,318 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:08:46,318 INFO L351 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 296 treesize of output 280 [2023-08-24 10:08:46,338 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:08:46,339 INFO L351 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 205 treesize of output 201 [2023-08-24 10:08:46,360 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:08:46,363 INFO L351 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 260 treesize of output 220 [2023-08-24 10:08:47,038 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:08:47,038 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 56 [2023-08-24 10:08:47,053 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 10:08:47,054 INFO L351 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 644 treesize of output 616 [2023-08-24 10:08:47,080 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 10:08:47,080 INFO L351 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 296 treesize of output 252 [2023-08-24 10:08:47,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:08:47,098 INFO L351 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 170 [2023-08-24 10:08:47,145 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 10:08:47,145 INFO L351 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 181 treesize of output 161 [2023-08-24 10:08:47,300 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-24 10:08:47,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-24 10:08:47,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29803230] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 10:08:47,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 10:08:47,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 28 [2023-08-24 10:08:47,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114617522] [2023-08-24 10:08:47,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 10:08:47,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-24 10:08:47,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:08:47,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-24 10:08:47,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=568, Unknown=3, NotChecked=102, Total=812 [2023-08-24 10:08:47,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 248 [2023-08-24 10:08:47,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 116 flow. Second operand has 29 states, 29 states have (on average 63.89655172413793) internal successors, (1853), 29 states have internal predecessors, (1853), 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-08-24 10:08:47,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:08:47,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 248 [2023-08-24 10:08:47,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:08:47,466 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (* c_~back~0 4)) (.cse12 (* c_~front~0 4))) (let ((.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse1 (<= c_~n~0 c_~back~0)) (.cse4 (+ c_~queue~0.offset .cse12)) (.cse2 (< c_~back~0 0)) (.cse5 (+ c_~queue~0.offset .cse11))) (and (or .cse0 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= c_~back~0 c_~front~0)) .cse2) (<= c_~v_assert~0 1) (or (and (forall ((v_ArrVal_149 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse3 .cse4)) 1) (not (= (select .cse3 .cse5) 1))))) (forall ((v_ArrVal_149 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base))) (or (not (= (select .cse6 .cse5) 1)) (<= 0 (+ c_~sum~0 (select .cse6 .cse4))))))) .cse0 .cse1 .cse2) (or .cse0 .cse1 (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse9 (+ .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse8 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_149 (Array Int Int)) (v_ArrVal_148 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse7 .cse8) 1)) (<= 0 (+ c_~sum~0 (select .cse7 .cse9)))))) (forall ((v_ArrVal_149 (Array Int Int)) (v_ArrVal_148 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (<= (+ c_~sum~0 (select .cse10 .cse9)) 1) (not (= (select .cse10 .cse8) 1))))))) .cse2) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (let ((.cse14 (select |c_#memory_int| c_~queue~0.base))) (or .cse0 .cse1 (let ((.cse13 (+ c_~sum~0 (select .cse14 .cse4)))) (and (<= .cse13 1) (<= 0 .cse13))) .cse2 (not (= (select .cse14 .cse5) 1))))))) is different from false [2023-08-24 10:08:51,722 INFO L124 PetriNetUnfolderBase]: 1571/2606 cut-off events. [2023-08-24 10:08:51,723 INFO L125 PetriNetUnfolderBase]: For 2163/2163 co-relation queries the response was YES. [2023-08-24 10:08:51,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7835 conditions, 2606 events. 1571/2606 cut-off events. For 2163/2163 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 13456 event pairs, 70 based on Foata normal form. 94/2696 useless extension candidates. Maximal degree in co-relation 7816. Up to 483 conditions per place. [2023-08-24 10:08:51,738 INFO L140 encePairwiseOnDemand]: 234/248 looper letters, 245 selfloop transitions, 118 changer transitions 84/447 dead transitions. [2023-08-24 10:08:51,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 447 transitions, 2584 flow [2023-08-24 10:08:51,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-08-24 10:08:51,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2023-08-24 10:08:51,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 4702 transitions. [2023-08-24 10:08:51,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27477793361383823 [2023-08-24 10:08:51,753 INFO L72 ComplementDD]: Start complementDD. Operand 69 states and 4702 transitions. [2023-08-24 10:08:51,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 4702 transitions. [2023-08-24 10:08:51,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:08:51,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 69 states and 4702 transitions. [2023-08-24 10:08:51,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 70 states, 69 states have (on average 68.14492753623189) internal successors, (4702), 69 states have internal predecessors, (4702), 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-08-24 10:08:51,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 70 states, 70 states have (on average 248.0) internal successors, (17360), 70 states have internal predecessors, (17360), 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-08-24 10:08:51,794 INFO L81 ComplementDD]: Finished complementDD. Result has 70 states, 70 states have (on average 248.0) internal successors, (17360), 70 states have internal predecessors, (17360), 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-08-24 10:08:51,794 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 116 flow. Second operand 69 states and 4702 transitions. [2023-08-24 10:08:51,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 447 transitions, 2584 flow [2023-08-24 10:08:51,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 447 transitions, 2568 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-24 10:08:51,803 INFO L231 Difference]: Finished difference. Result has 137 places, 169 transitions, 1215 flow [2023-08-24 10:08:51,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=69, PETRI_FLOW=1215, PETRI_PLACES=137, PETRI_TRANSITIONS=169} [2023-08-24 10:08:51,804 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 106 predicate places. [2023-08-24 10:08:51,804 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 169 transitions, 1215 flow [2023-08-24 10:08:51,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 63.89655172413793) internal successors, (1853), 29 states have internal predecessors, (1853), 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-08-24 10:08:51,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:08:51,805 INFO L208 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] [2023-08-24 10:08:51,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-24 10:08:52,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-08-24 10:08:52,018 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 10:08:52,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:08:52,018 INFO L85 PathProgramCache]: Analyzing trace with hash -19731206, now seen corresponding path program 2 times [2023-08-24 10:08:52,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:08:52,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790221138] [2023-08-24 10:08:52,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:08:52,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:08:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:08:53,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:08:53,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:08:53,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790221138] [2023-08-24 10:08:53,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790221138] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:08:53,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924267804] [2023-08-24 10:08:53,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 10:08:53,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:08:53,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:08:53,181 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-08-24 10:08:53,184 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-08-24 10:08:53,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 10:08:53,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 10:08:53,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 44 conjunts are in the unsatisfiable core [2023-08-24 10:08:53,281 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:08:53,380 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-24 10:08:53,416 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 10:08:53,465 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 10:08:53,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:08:53,596 INFO L351 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 18 treesize of output 20 [2023-08-24 10:08:53,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:08:53,700 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:08:54,196 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (let ((.cse2 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse1 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_197 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_197))) (or (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse1)) 1)) (not (= (select (select .cse0 c_~queue~0.base) .cse2) 1))))) (forall ((v_ArrVal_197 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_197))) (or (not (= (select (select .cse3 c_~queue~0.base) .cse2) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse1))))))))) (< c_~back~0 0)) is different from false [2023-08-24 10:08:54,382 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:08:54,382 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 53 [2023-08-24 10:08:54,393 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:08:54,394 INFO L351 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 484 treesize of output 460 [2023-08-24 10:08:54,404 INFO L351 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 152 treesize of output 128 [2023-08-24 10:08:54,418 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:08:54,419 INFO L351 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 126 treesize of output 122 [2023-08-24 10:08:54,432 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:08:54,433 INFO L351 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 125 treesize of output 109 [2023-08-24 10:08:54,724 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:08:54,724 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 53 [2023-08-24 10:08:54,727 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 10:08:54,735 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 10:08:54,736 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 136 [2023-08-24 10:08:54,748 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 10:08:54,749 INFO L351 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 132 treesize of output 112 [2023-08-24 10:08:54,763 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 10:08:54,763 INFO L351 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 83 treesize of output 75 [2023-08-24 10:08:54,814 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-24 10:08:54,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:08:54,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924267804] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 10:08:54,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 10:08:54,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 31 [2023-08-24 10:08:54,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120751067] [2023-08-24 10:08:54,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 10:08:54,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-24 10:08:54,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:08:54,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-24 10:08:54,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=788, Unknown=9, NotChecked=58, Total=992 [2023-08-24 10:08:54,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 248 [2023-08-24 10:08:54,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 169 transitions, 1215 flow. Second operand has 32 states, 32 states have (on average 63.84375) internal successors, (2043), 32 states have internal predecessors, (2043), 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-08-24 10:08:54,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:08:54,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 248 [2023-08-24 10:08:54,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:08:55,367 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse6 (+ c_~queue~0.offset (* c_~front~0 4)))) (let ((.cse3 (and (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse6)) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse6)))))) (.cse4 (not (= (select (select |c_#memory_int| c_~queue~0.base) .cse7) 1))) (.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse1 (<= c_~n~0 c_~back~0)) (.cse2 (< c_~back~0 0))) (and (<= c_~v_assert~0 1) (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse1 (and (forall ((v_ArrVal_197 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_197))) (or (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse6)) 1)) (not (= (select (select .cse5 c_~queue~0.base) .cse7) 1))))) (forall ((v_ArrVal_197 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_197))) (or (not (= (select (select .cse8 c_~queue~0.base) .cse7) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse6)))))))) .cse2) (or .cse1 .cse2 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) .cse3 .cse4) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (or .cse0 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 .cse2 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~back~0 c_~front~0)))))) is different from false [2023-08-24 10:08:55,395 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (let ((.cse2 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse1 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_197 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_197))) (or (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse1)) 1)) (not (= (select (select .cse0 c_~queue~0.base) .cse2) 1))))) (forall ((v_ArrVal_197 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_197))) (or (not (= (select (select .cse3 c_~queue~0.base) .cse2) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse1))))))))) (< c_~back~0 0)) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2023-08-24 10:08:55,558 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~n~0 c_~back~0)) (.cse1 (< c_~back~0 0)) (.cse2 (let ((.cse4 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse4))))))) (.cse3 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)))) (and (or (= (mod c_~v_assert~0 256) 0) .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse1 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) .cse2 .cse3))) is different from false [2023-08-24 10:09:10,042 WARN L234 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 38 DAG size of output: 31 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 10:09:14,604 INFO L124 PetriNetUnfolderBase]: 1572/2591 cut-off events. [2023-08-24 10:09:14,605 INFO L125 PetriNetUnfolderBase]: For 30821/30821 co-relation queries the response was YES. [2023-08-24 10:09:14,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12215 conditions, 2591 events. 1572/2591 cut-off events. For 30821/30821 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 13002 event pairs, 104 based on Foata normal form. 142/2731 useless extension candidates. Maximal degree in co-relation 10937. Up to 563 conditions per place. [2023-08-24 10:09:14,623 INFO L140 encePairwiseOnDemand]: 232/248 looper letters, 233 selfloop transitions, 139 changer transitions 94/466 dead transitions. [2023-08-24 10:09:14,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 466 transitions, 4161 flow [2023-08-24 10:09:14,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-08-24 10:09:14,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2023-08-24 10:09:14,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 3652 transitions. [2023-08-24 10:09:14,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.272700119474313 [2023-08-24 10:09:14,633 INFO L72 ComplementDD]: Start complementDD. Operand 54 states and 3652 transitions. [2023-08-24 10:09:14,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 3652 transitions. [2023-08-24 10:09:14,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:09:14,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 54 states and 3652 transitions. [2023-08-24 10:09:14,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 55 states, 54 states have (on average 67.62962962962963) internal successors, (3652), 54 states have internal predecessors, (3652), 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-08-24 10:09:14,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 55 states, 55 states have (on average 248.0) internal successors, (13640), 55 states have internal predecessors, (13640), 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-08-24 10:09:14,659 INFO L81 ComplementDD]: Finished complementDD. Result has 55 states, 55 states have (on average 248.0) internal successors, (13640), 55 states have internal predecessors, (13640), 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-08-24 10:09:14,659 INFO L175 Difference]: Start difference. First operand has 137 places, 169 transitions, 1215 flow. Second operand 54 states and 3652 transitions. [2023-08-24 10:09:14,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 466 transitions, 4161 flow [2023-08-24 10:09:14,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 466 transitions, 3700 flow, removed 206 selfloop flow, removed 17 redundant places. [2023-08-24 10:09:14,733 INFO L231 Difference]: Finished difference. Result has 180 places, 218 transitions, 1864 flow [2023-08-24 10:09:14,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=1864, PETRI_PLACES=180, PETRI_TRANSITIONS=218} [2023-08-24 10:09:14,734 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 149 predicate places. [2023-08-24 10:09:14,734 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 218 transitions, 1864 flow [2023-08-24 10:09:14,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 63.84375) internal successors, (2043), 32 states have internal predecessors, (2043), 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-08-24 10:09:14,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:09:14,735 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:09:14,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-24 10:09:14,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-08-24 10:09:14,941 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 10:09:14,941 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:09:14,941 INFO L85 PathProgramCache]: Analyzing trace with hash 458145310, now seen corresponding path program 3 times [2023-08-24 10:09:14,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:09:14,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160690503] [2023-08-24 10:09:14,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:09:14,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:09:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:09:15,939 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:09:15,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:09:15,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160690503] [2023-08-24 10:09:15,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160690503] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:09:15,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044324630] [2023-08-24 10:09:15,940 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 10:09:15,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:09:15,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:09:15,949 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 10:09:15,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-24 10:09:16,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 10:09:16,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 10:09:16,076 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-24 10:09:16,078 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:09:16,258 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 10:09:16,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:09:16,362 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:09:16,363 INFO L351 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 68 treesize of output 44 [2023-08-24 10:09:16,602 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 10:09:16,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044324630] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 10:09:16,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 10:09:16,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 22 [2023-08-24 10:09:16,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744595962] [2023-08-24 10:09:16,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 10:09:16,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-24 10:09:16,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:09:16,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-24 10:09:16,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2023-08-24 10:09:16,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 248 [2023-08-24 10:09:16,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 218 transitions, 1864 flow. Second operand has 23 states, 23 states have (on average 74.65217391304348) internal successors, (1717), 23 states have internal predecessors, (1717), 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-08-24 10:09:16,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:09:16,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 248 [2023-08-24 10:09:16,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:09:17,944 INFO L124 PetriNetUnfolderBase]: 1490/2473 cut-off events. [2023-08-24 10:09:17,945 INFO L125 PetriNetUnfolderBase]: For 15876/15876 co-relation queries the response was YES. [2023-08-24 10:09:17,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12899 conditions, 2473 events. 1490/2473 cut-off events. For 15876/15876 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 12348 event pairs, 107 based on Foata normal form. 42/2514 useless extension candidates. Maximal degree in co-relation 12712. Up to 738 conditions per place. [2023-08-24 10:09:17,970 INFO L140 encePairwiseOnDemand]: 235/248 looper letters, 215 selfloop transitions, 183 changer transitions 24/422 dead transitions. [2023-08-24 10:09:17,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 422 transitions, 4489 flow [2023-08-24 10:09:17,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-08-24 10:09:17,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-08-24 10:09:17,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 2245 transitions. [2023-08-24 10:09:17,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3121523915461624 [2023-08-24 10:09:17,974 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 2245 transitions. [2023-08-24 10:09:17,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 2245 transitions. [2023-08-24 10:09:17,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:09:17,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 2245 transitions. [2023-08-24 10:09:17,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 77.41379310344827) internal successors, (2245), 29 states have internal predecessors, (2245), 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-08-24 10:09:17,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 248.0) internal successors, (7440), 30 states have internal predecessors, (7440), 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-08-24 10:09:17,987 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 248.0) internal successors, (7440), 30 states have internal predecessors, (7440), 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-08-24 10:09:17,988 INFO L175 Difference]: Start difference. First operand has 180 places, 218 transitions, 1864 flow. Second operand 29 states and 2245 transitions. [2023-08-24 10:09:17,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 422 transitions, 4489 flow [2023-08-24 10:09:18,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 422 transitions, 4092 flow, removed 175 selfloop flow, removed 17 redundant places. [2023-08-24 10:09:18,101 INFO L231 Difference]: Finished difference. Result has 187 places, 288 transitions, 2787 flow [2023-08-24 10:09:18,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=1626, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=2787, PETRI_PLACES=187, PETRI_TRANSITIONS=288} [2023-08-24 10:09:18,104 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 156 predicate places. [2023-08-24 10:09:18,104 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 288 transitions, 2787 flow [2023-08-24 10:09:18,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 74.65217391304348) internal successors, (1717), 23 states have internal predecessors, (1717), 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-08-24 10:09:18,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:09:18,105 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:09:18,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-24 10:09:18,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:09:18,311 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 10:09:18,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:09:18,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1536834318, now seen corresponding path program 4 times [2023-08-24 10:09:18,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:09:18,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874483050] [2023-08-24 10:09:18,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:09:18,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:09:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:09:19,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:09:19,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:09:19,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874483050] [2023-08-24 10:09:19,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874483050] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:09:19,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409090645] [2023-08-24 10:09:19,149 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 10:09:19,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:09:19,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:09:19,150 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 10:09:19,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-24 10:09:19,241 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 10:09:19,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 10:09:19,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 32 conjunts are in the unsatisfiable core [2023-08-24 10:09:19,246 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:09:19,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:09:19,437 INFO L351 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 18 treesize of output 20 [2023-08-24 10:09:19,504 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 10:09:19,504 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:09:19,621 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_295 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_295) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_295 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_295) c_~queue~0.base) .cse0)) 1)))) is different from false [2023-08-24 10:09:19,652 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:09:19,652 INFO L351 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 110 treesize of output 86 [2023-08-24 10:09:19,658 INFO L351 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 53 treesize of output 47 [2023-08-24 10:09:19,663 INFO L351 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 47 treesize of output 41 [2023-08-24 10:09:19,902 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 10:09:19,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409090645] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 10:09:19,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 10:09:19,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 25 [2023-08-24 10:09:19,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794977986] [2023-08-24 10:09:19,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 10:09:19,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-24 10:09:19,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:09:19,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-24 10:09:19,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=516, Unknown=1, NotChecked=46, Total=650 [2023-08-24 10:09:19,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 248 [2023-08-24 10:09:19,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 288 transitions, 2787 flow. Second operand has 26 states, 26 states have (on average 70.34615384615384) internal successors, (1829), 26 states have internal predecessors, (1829), 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-08-24 10:09:19,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:09:19,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 248 [2023-08-24 10:09:19,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:09:21,545 INFO L124 PetriNetUnfolderBase]: 1560/2585 cut-off events. [2023-08-24 10:09:21,545 INFO L125 PetriNetUnfolderBase]: For 18349/18349 co-relation queries the response was YES. [2023-08-24 10:09:21,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14011 conditions, 2585 events. 1560/2585 cut-off events. For 18349/18349 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 12898 event pairs, 109 based on Foata normal form. 42/2627 useless extension candidates. Maximal degree in co-relation 13350. Up to 705 conditions per place. [2023-08-24 10:09:21,569 INFO L140 encePairwiseOnDemand]: 236/248 looper letters, 230 selfloop transitions, 176 changer transitions 36/442 dead transitions. [2023-08-24 10:09:21,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 442 transitions, 5037 flow [2023-08-24 10:09:21,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-24 10:09:21,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-24 10:09:21,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1916 transitions. [2023-08-24 10:09:21,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29714640198511166 [2023-08-24 10:09:21,572 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 1916 transitions. [2023-08-24 10:09:21,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 1916 transitions. [2023-08-24 10:09:21,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:09:21,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1916 transitions. [2023-08-24 10:09:21,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 73.6923076923077) internal successors, (1916), 26 states have internal predecessors, (1916), 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-08-24 10:09:21,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 248.0) internal successors, (6696), 27 states have internal predecessors, (6696), 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-08-24 10:09:21,584 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 248.0) internal successors, (6696), 27 states have internal predecessors, (6696), 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-08-24 10:09:21,585 INFO L175 Difference]: Start difference. First operand has 187 places, 288 transitions, 2787 flow. Second operand 26 states and 1916 transitions. [2023-08-24 10:09:21,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 442 transitions, 5037 flow [2023-08-24 10:09:21,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 442 transitions, 4700 flow, removed 62 selfloop flow, removed 9 redundant places. [2023-08-24 10:09:21,685 INFO L231 Difference]: Finished difference. Result has 209 places, 303 transitions, 3196 flow [2023-08-24 10:09:21,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=2519, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=3196, PETRI_PLACES=209, PETRI_TRANSITIONS=303} [2023-08-24 10:09:21,686 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 178 predicate places. [2023-08-24 10:09:21,686 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 303 transitions, 3196 flow [2023-08-24 10:09:21,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 70.34615384615384) internal successors, (1829), 26 states have internal predecessors, (1829), 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-08-24 10:09:21,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:09:21,687 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:09:21,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-24 10:09:21,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:09:21,892 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 10:09:21,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:09:21,892 INFO L85 PathProgramCache]: Analyzing trace with hash 238598793, now seen corresponding path program 5 times [2023-08-24 10:09:21,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:09:21,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990102124] [2023-08-24 10:09:21,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:09:21,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:09:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:09:22,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:09:22,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:09:22,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990102124] [2023-08-24 10:09:22,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990102124] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:09:22,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599885379] [2023-08-24 10:09:22,049 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 10:09:22,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:09:22,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:09:22,050 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 10:09:22,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-24 10:09:22,141 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-08-24 10:09:22,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 10:09:22,143 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-24 10:09:22,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:09:22,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:09:22,223 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:09:22,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:09:22,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599885379] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 10:09:22,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 10:09:22,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2023-08-24 10:09:22,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555531652] [2023-08-24 10:09:22,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 10:09:22,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-24 10:09:22,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:09:22,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-24 10:09:22,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-08-24 10:09:22,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 248 [2023-08-24 10:09:22,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 303 transitions, 3196 flow. Second operand has 13 states, 13 states have (on average 103.0) internal successors, (1339), 13 states have internal predecessors, (1339), 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-08-24 10:09:22,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:09:22,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 248 [2023-08-24 10:09:22,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:09:22,657 INFO L124 PetriNetUnfolderBase]: 563/1117 cut-off events. [2023-08-24 10:09:22,657 INFO L125 PetriNetUnfolderBase]: For 13657/13721 co-relation queries the response was YES. [2023-08-24 10:09:22,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6855 conditions, 1117 events. 563/1117 cut-off events. For 13657/13721 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5905 event pairs, 57 based on Foata normal form. 71/1157 useless extension candidates. Maximal degree in co-relation 6799. Up to 579 conditions per place. [2023-08-24 10:09:22,670 INFO L140 encePairwiseOnDemand]: 243/248 looper letters, 98 selfloop transitions, 22 changer transitions 49/223 dead transitions. [2023-08-24 10:09:22,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 223 transitions, 2674 flow [2023-08-24 10:09:22,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 10:09:22,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 10:09:22,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 846 transitions. [2023-08-24 10:09:22,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4264112903225806 [2023-08-24 10:09:22,673 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 846 transitions. [2023-08-24 10:09:22,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 846 transitions. [2023-08-24 10:09:22,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:09:22,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 846 transitions. [2023-08-24 10:09:22,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 105.75) internal successors, (846), 8 states have internal predecessors, (846), 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-08-24 10:09:22,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 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-08-24 10:09:22,677 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 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-08-24 10:09:22,677 INFO L175 Difference]: Start difference. First operand has 209 places, 303 transitions, 3196 flow. Second operand 8 states and 846 transitions. [2023-08-24 10:09:22,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 223 transitions, 2674 flow [2023-08-24 10:09:22,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 223 transitions, 2388 flow, removed 67 selfloop flow, removed 29 redundant places. [2023-08-24 10:09:22,729 INFO L231 Difference]: Finished difference. Result has 165 places, 171 transitions, 1687 flow [2023-08-24 10:09:22,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=1978, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1687, PETRI_PLACES=165, PETRI_TRANSITIONS=171} [2023-08-24 10:09:22,731 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 134 predicate places. [2023-08-24 10:09:22,731 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 171 transitions, 1687 flow [2023-08-24 10:09:22,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 103.0) internal successors, (1339), 13 states have internal predecessors, (1339), 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-08-24 10:09:22,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:09:22,731 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:09:22,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-24 10:09:22,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-08-24 10:09:22,942 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 10:09:22,942 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:09:22,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1886288447, now seen corresponding path program 6 times [2023-08-24 10:09:22,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:09:22,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107566173] [2023-08-24 10:09:22,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:09:22,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:09:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:09:23,076 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 10:09:23,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:09:23,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107566173] [2023-08-24 10:09:23,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107566173] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 10:09:23,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 10:09:23,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 10:09:23,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142496983] [2023-08-24 10:09:23,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 10:09:23,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 10:09:23,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:09:23,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 10:09:23,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 10:09:23,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 248 [2023-08-24 10:09:23,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 171 transitions, 1687 flow. Second operand has 4 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:09:23,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:09:23,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 248 [2023-08-24 10:09:23,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:09:23,382 INFO L124 PetriNetUnfolderBase]: 949/1822 cut-off events. [2023-08-24 10:09:23,383 INFO L125 PetriNetUnfolderBase]: For 12020/12088 co-relation queries the response was YES. [2023-08-24 10:09:23,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9607 conditions, 1822 events. 949/1822 cut-off events. For 12020/12088 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 10025 event pairs, 107 based on Foata normal form. 73/1860 useless extension candidates. Maximal degree in co-relation 9565. Up to 636 conditions per place. [2023-08-24 10:09:23,401 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 140 selfloop transitions, 67 changer transitions 1/262 dead transitions. [2023-08-24 10:09:23,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 262 transitions, 2975 flow [2023-08-24 10:09:23,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 10:09:23,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 10:09:23,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 509 transitions. [2023-08-24 10:09:23,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5131048387096774 [2023-08-24 10:09:23,403 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 509 transitions. [2023-08-24 10:09:23,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 509 transitions. [2023-08-24 10:09:23,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:09:23,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 509 transitions. [2023-08-24 10:09:23,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 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-08-24 10:09:23,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 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-08-24 10:09:23,405 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 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-08-24 10:09:23,405 INFO L175 Difference]: Start difference. First operand has 165 places, 171 transitions, 1687 flow. Second operand 4 states and 509 transitions. [2023-08-24 10:09:23,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 262 transitions, 2975 flow [2023-08-24 10:09:23,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 262 transitions, 2677 flow, removed 28 selfloop flow, removed 15 redundant places. [2023-08-24 10:09:23,440 INFO L231 Difference]: Finished difference. Result has 127 places, 218 transitions, 2315 flow [2023-08-24 10:09:23,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=1497, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2315, PETRI_PLACES=127, PETRI_TRANSITIONS=218} [2023-08-24 10:09:23,440 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 96 predicate places. [2023-08-24 10:09:23,440 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 218 transitions, 2315 flow [2023-08-24 10:09:23,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:09:23,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:09:23,441 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:09:23,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 10:09:23,441 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 10:09:23,442 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:09:23,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1530240330, now seen corresponding path program 7 times [2023-08-24 10:09:23,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:09:23,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825683195] [2023-08-24 10:09:23,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:09:23,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:09:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:09:24,585 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:09:24,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:09:24,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825683195] [2023-08-24 10:09:24,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825683195] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:09:24,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463263552] [2023-08-24 10:09:24,585 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-24 10:09:24,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:09:24,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:09:24,586 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 10:09:24,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-24 10:09:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:09:24,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-24 10:09:24,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:09:25,163 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:09:25,164 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:09:25,541 INFO L322 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-08-24 10:09:25,541 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 178 [2023-08-24 10:09:26,490 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:09:26,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463263552] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 10:09:26,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 10:09:26,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 34 [2023-08-24 10:09:26,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146171862] [2023-08-24 10:09:26,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 10:09:26,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-24 10:09:26,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:09:26,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-24 10:09:26,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1000, Unknown=0, NotChecked=0, Total=1190 [2023-08-24 10:09:26,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 248 [2023-08-24 10:09:26,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 218 transitions, 2315 flow. Second operand has 35 states, 35 states have (on average 74.0) internal successors, (2590), 35 states have internal predecessors, (2590), 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-08-24 10:09:26,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:09:26,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 248 [2023-08-24 10:09:26,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:09:34,186 INFO L124 PetriNetUnfolderBase]: 6409/10849 cut-off events. [2023-08-24 10:09:34,186 INFO L125 PetriNetUnfolderBase]: For 61871/61871 co-relation queries the response was YES. [2023-08-24 10:09:34,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59137 conditions, 10849 events. 6409/10849 cut-off events. For 61871/61871 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 72317 event pairs, 171 based on Foata normal form. 334/11183 useless extension candidates. Maximal degree in co-relation 59103. Up to 2732 conditions per place. [2023-08-24 10:09:34,247 INFO L140 encePairwiseOnDemand]: 235/248 looper letters, 552 selfloop transitions, 502 changer transitions 445/1499 dead transitions. [2023-08-24 10:09:34,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 1499 transitions, 17398 flow [2023-08-24 10:09:34,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2023-08-24 10:09:34,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2023-08-24 10:09:34,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 7012 transitions. [2023-08-24 10:09:34,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31768756795940556 [2023-08-24 10:09:34,257 INFO L72 ComplementDD]: Start complementDD. Operand 89 states and 7012 transitions. [2023-08-24 10:09:34,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 7012 transitions. [2023-08-24 10:09:34,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:09:34,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 89 states and 7012 transitions. [2023-08-24 10:09:34,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 90 states, 89 states have (on average 78.78651685393258) internal successors, (7012), 89 states have internal predecessors, (7012), 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-08-24 10:09:34,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 90 states, 90 states have (on average 248.0) internal successors, (22320), 90 states have internal predecessors, (22320), 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-08-24 10:09:34,297 INFO L81 ComplementDD]: Finished complementDD. Result has 90 states, 90 states have (on average 248.0) internal successors, (22320), 90 states have internal predecessors, (22320), 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-08-24 10:09:34,297 INFO L175 Difference]: Start difference. First operand has 127 places, 218 transitions, 2315 flow. Second operand 89 states and 7012 transitions. [2023-08-24 10:09:34,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 1499 transitions, 17398 flow [2023-08-24 10:09:34,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 1499 transitions, 17318 flow, removed 40 selfloop flow, removed 0 redundant places. [2023-08-24 10:09:34,467 INFO L231 Difference]: Finished difference. Result has 266 places, 644 transitions, 9554 flow [2023-08-24 10:09:34,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=2293, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=89, PETRI_FLOW=9554, PETRI_PLACES=266, PETRI_TRANSITIONS=644} [2023-08-24 10:09:34,468 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 235 predicate places. [2023-08-24 10:09:34,468 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 644 transitions, 9554 flow [2023-08-24 10:09:34,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 74.0) internal successors, (2590), 35 states have internal predecessors, (2590), 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-08-24 10:09:34,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:09:34,469 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:09:34,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-24 10:09:34,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:09:34,675 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 10:09:34,675 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:09:34,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1405231144, now seen corresponding path program 8 times [2023-08-24 10:09:34,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:09:34,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050973756] [2023-08-24 10:09:34,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:09:34,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:09:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:09:36,069 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:09:36,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:09:36,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050973756] [2023-08-24 10:09:36,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050973756] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:09:36,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791209601] [2023-08-24 10:09:36,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 10:09:36,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:09:36,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:09:36,071 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 10:09:36,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-24 10:09:36,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 10:09:36,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 10:09:36,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-24 10:09:36,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:09:36,292 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-24 10:09:36,349 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 10:09:36,411 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 10:09:36,476 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 10:09:36,864 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:09:36,864 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:09:37,853 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_~front~0 1))) (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (<= (+ c_~back~0 1) c_~front~0) (let ((.cse7 (* c_~front~0 4)) (.cse6 (* c_~back~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse6 4)) (.cse2 (+ c_~queue~0.offset .cse7 4)) (.cse3 (+ c_~queue~0.offset .cse7)) (.cse4 (+ c_~queue~0.offset .cse6))) (and (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_463) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.base))) (or (not (= (+ 1 (select .cse0 .cse1)) 0)) (<= 0 (+ (select .cse0 .cse2) c_~sum~0 (select .cse0 .cse3))) (not (= (select .cse0 .cse4) 1))))) (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_463) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.base))) (or (not (= (+ 1 (select .cse5 .cse1)) 0)) (<= (+ (select .cse5 .cse2) c_~sum~0 (select .cse5 .cse3)) 1) (not (= (select .cse5 .cse4) 1)))))))) (< .cse8 0) (< c_~back~0 0) (<= c_~n~0 .cse8))) is different from false [2023-08-24 10:09:37,951 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_~front~0 1))) (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (<= (+ c_~back~0 1) c_~front~0) (let ((.cse7 (* c_~front~0 4)) (.cse6 (* c_~back~0 4))) (let ((.cse1 (+ .cse6 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse3 (+ .cse7 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_462) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_463) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (+ (select .cse0 .cse1) 1) 0)) (<= (+ c_~sum~0 (select .cse0 .cse2) (select .cse0 .cse3)) 1) (not (= (select .cse0 .cse4) 1))))) (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_462) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_463) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (+ (select .cse5 .cse1) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse5 .cse2) (select .cse5 .cse3))) (not (= (select .cse5 .cse4) 1)))))))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< .cse8 0) (< c_~back~0 0) (<= c_~n~0 .cse8))) is different from false [2023-08-24 10:09:37,980 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:09:37,980 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 99 [2023-08-24 10:09:38,021 INFO L322 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-24 10:09:38,022 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2306 treesize of output 2196 [2023-08-24 10:09:38,047 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 10:09:38,064 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:09:38,064 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 410 treesize of output 410 [2023-08-24 10:09:38,099 INFO L322 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-24 10:09:38,100 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 494 treesize of output 416 [2023-08-24 10:09:38,140 INFO L322 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-24 10:09:38,141 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 331 treesize of output 305 [2023-08-24 10:09:40,104 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:09:40,104 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 99 [2023-08-24 10:09:40,127 INFO L322 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-24 10:09:40,127 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1138 treesize of output 1078 [2023-08-24 10:09:40,162 INFO L322 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-24 10:09:40,162 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 520 treesize of output 424 [2023-08-24 10:09:40,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:09:40,180 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 10:09:40,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:09:40,181 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 332 treesize of output 306 [2023-08-24 10:09:40,205 INFO L322 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-24 10:09:40,206 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 331 treesize of output 287 [2023-08-24 10:09:40,494 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-24 10:09:40,667 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-24 10:09:40,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791209601] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 10:09:40,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 10:09:40,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 15] total 41 [2023-08-24 10:09:40,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144305167] [2023-08-24 10:09:40,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 10:09:40,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-08-24 10:09:40,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:09:40,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-08-24 10:09:40,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=1217, Unknown=5, NotChecked=154, Total=1722 [2023-08-24 10:09:40,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 248 [2023-08-24 10:09:40,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 644 transitions, 9554 flow. Second operand has 42 states, 42 states have (on average 63.714285714285715) internal successors, (2676), 42 states have internal predecessors, (2676), 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-08-24 10:09:40,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:09:40,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 248 [2023-08-24 10:09:40,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:09:40,789 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse31 (* c_~front~0 4)) (.cse30 (* c_~back~0 4))) (let ((.cse15 (+ c_~queue~0.offset .cse30 4)) (.cse16 (+ c_~queue~0.offset .cse31)) (.cse35 (select |c_#memory_int| c_~queue~0.base)) (.cse18 (+ c_~queue~0.offset .cse30))) (let ((.cse32 (+ c_~front~0 1)) (.cse17 (+ c_~queue~0.offset .cse31 4)) (.cse13 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse36 (select .cse35 .cse18)) (.cse34 (select .cse35 .cse16)) (.cse10 (select .cse35 .cse15))) (let ((.cse4 (not (= (+ .cse10 1) 0))) (.cse20 (<= c_~n~0 c_~front~0)) (.cse22 (let ((.cse37 (+ c_~sum~0 .cse34))) (and (<= .cse37 1) (<= 0 .cse37)))) (.cse23 (< c_~front~0 0)) (.cse9 (<= 0 c_~sum~0)) (.cse7 (not (= .cse36 1))) (.cse21 (<= c_~back~0 c_~front~0)) (.cse11 (not .cse13)) (.cse12 (not (= (+ .cse36 1) 0))) (.cse2 (<= c_~n~0 c_~back~0)) (.cse3 (<= (+ c_~back~0 1) c_~front~0)) (.cse6 (< c_~back~0 0)) (.cse0 (let ((.cse33 (+ c_~sum~0 .cse34 (select .cse35 .cse17)))) (and (<= .cse33 1) (<= 0 .cse33)))) (.cse1 (= (mod c_~v_assert~0 256) 0)) (.cse5 (< .cse32 0)) (.cse8 (<= c_~n~0 .cse32))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (<= c_~sum~0 0) (or .cse1 .cse2 .cse3 .cse5 (and (= c_~back~0 c_~front~0) .cse9 (<= c_~sum~0 1)) .cse6 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse8) (or .cse0 .cse1 .cse2 .cse5 .cse6 (and (or (not (= .cse10 1)) .cse3 .cse11 .cse12) (or .cse3 .cse4 .cse13 .cse7)) .cse8) (<= c_~v_assert~0 1) (or .cse1 .cse2 .cse3 (and (forall ((v_ArrVal_464 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.base))) (or (not (= (+ (select .cse14 .cse15) 1) 0)) (<= (+ c_~sum~0 (select .cse14 .cse16) (select .cse14 .cse17)) 1) (not (= (select .cse14 .cse18) 1))))) (forall ((v_ArrVal_464 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.base))) (or (not (= (+ (select .cse19 .cse15) 1) 0)) (not (= (select .cse19 .cse18) 1)) (<= 0 (+ c_~sum~0 (select .cse19 .cse16) (select .cse19 .cse17))))))) .cse5 .cse6 .cse8) (or .cse1 .cse20 .cse21 .cse22 .cse23) (or .cse20 .cse21 .cse22 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) .cse23) (<= 1 c_~v_assert~0) .cse9 (or .cse0 .cse1 (and (or .cse21 .cse13 .cse7) (or .cse21 .cse11 .cse12)) .cse5 .cse8) (or .cse1 .cse2 .cse3 (let ((.cse25 (+ .cse30 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse26 (+ .cse31 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse27 (+ .cse31 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse28 (+ .cse30 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (let ((.cse24 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_462) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_463) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (+ (select .cse24 .cse25) 1) 0)) (<= (+ c_~sum~0 (select .cse24 .cse26) (select .cse24 .cse27)) 1) (not (= (select .cse24 .cse28) 1))))) (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (let ((.cse29 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_462) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_463) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (+ (select .cse29 .cse25) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse29 .cse26) (select .cse29 .cse27))) (not (= (select .cse29 .cse28) 1))))))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5 .cse6 .cse8) (or .cse0 (<= c_~back~0 .cse32) .cse1 .cse5 .cse8)))))) is different from false [2023-08-24 10:09:40,802 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse14 (+ c_~front~0 1))) (let ((.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse1 (<= c_~n~0 c_~back~0)) (.cse2 (<= (+ c_~back~0 1) c_~front~0)) (.cse3 (< .cse14 0)) (.cse4 (< c_~back~0 0)) (.cse5 (<= c_~n~0 .cse14))) (and (or .cse0 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 .cse2 .cse3 (and (= c_~back~0 c_~front~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) .cse4 .cse5) (or .cse0 .cse1 .cse2 (let ((.cse13 (* c_~front~0 4)) (.cse12 (* c_~back~0 4))) (let ((.cse7 (+ .cse12 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse8 (+ .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse9 (+ .cse13 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse10 (+ .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_462) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_463) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (+ (select .cse6 .cse7) 1) 0)) (<= (+ c_~sum~0 (select .cse6 .cse8) (select .cse6 .cse9)) 1) (not (= (select .cse6 .cse10) 1))))) (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_462) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_463) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (+ (select .cse11 .cse7) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse11 .cse8) (select .cse11 .cse9))) (not (= (select .cse11 .cse10) 1)))))))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3 .cse4 .cse5)))) is different from false [2023-08-24 10:09:41,978 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse20 (+ c_~front~0 1)) (.cse5 (* c_~front~0 4)) (.cse4 (* c_~back~0 4)) (.cse7 (+ c_~back~0 1))) (let ((.cse3 (select |c_#memory_int| c_~queue~0.base)) (.cse11 (= (mod c_~v_assert~0 256) 0)) (.cse6 (<= c_~n~0 c_~back~0)) (.cse12 (<= .cse7 c_~front~0)) (.cse13 (+ c_~queue~0.offset .cse4 4)) (.cse16 (+ c_~queue~0.offset .cse4)) (.cse9 (+ c_~queue~0.offset .cse5)) (.cse10 (+ c_~queue~0.offset .cse5 4)) (.cse14 (< .cse20 0)) (.cse15 (< c_~back~0 0)) (.cse17 (<= c_~n~0 .cse20))) (and (or (let ((.cse0 (div |c_thread2Thread1of1ForFork0_~b~0#1| 256))) (and (< 0 (+ .cse0 1)) (or (let ((.cse2 (select .cse3 4)) (.cse1 (select .cse3 .cse4))) (and (<= .cse1 .cse2) (<= .cse2 .cse1))) (not (= (select .cse3 .cse5) 1))) (or .cse6 (= (select .cse3 0) 1)) (<= (+ c_~front~0 c_~n~0) .cse7) (<= 0 c_~front~0) (<= |c_thread2Thread1of1ForFork0_~b~0#1| (* .cse0 256)))) (and (not (= c_~back~0 1)) (< 0 c_~back~0) (<= c_~n~0 2))) (or (let ((.cse8 (+ c_~sum~0 (select .cse3 .cse9) (select .cse3 .cse10)))) (and (<= .cse8 1) (<= 0 .cse8))) .cse11 .cse6 .cse12 (not (= (+ (select .cse3 .cse13) 1) 0)) .cse14 .cse15 (not (= (select .cse3 .cse16) 1)) .cse17) (or .cse11 .cse6 .cse12 .cse14 (and (= c_~back~0 c_~front~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) .cse15 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse17) (<= c_~v_assert~0 1) (or .cse11 .cse6 .cse12 (and (forall ((v_ArrVal_464 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.base))) (or (not (= (+ (select .cse18 .cse13) 1) 0)) (<= (+ c_~sum~0 (select .cse18 .cse9) (select .cse18 .cse10)) 1) (not (= (select .cse18 .cse16) 1))))) (forall ((v_ArrVal_464 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.base))) (or (not (= (+ (select .cse19 .cse13) 1) 0)) (not (= (select .cse19 .cse16) 1)) (<= 0 (+ c_~sum~0 (select .cse19 .cse9) (select .cse19 .cse10))))))) .cse14 .cse15 .cse17) (= c_~queue~0.offset 0) (<= 1 c_~v_assert~0) (= c_~sum~0 0) (= c_~v_assert~0 |c_thread2Thread1of1ForFork0_~cond~1#1|)))) is different from false [2023-08-24 10:09:53,377 INFO L124 PetriNetUnfolderBase]: 7811/13204 cut-off events. [2023-08-24 10:09:53,377 INFO L125 PetriNetUnfolderBase]: For 454014/454014 co-relation queries the response was YES. [2023-08-24 10:09:53,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103769 conditions, 13204 events. 7811/13204 cut-off events. For 454014/454014 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 92143 event pairs, 600 based on Foata normal form. 312/13516 useless extension candidates. Maximal degree in co-relation 103683. Up to 3378 conditions per place. [2023-08-24 10:09:53,505 INFO L140 encePairwiseOnDemand]: 233/248 looper letters, 859 selfloop transitions, 671 changer transitions 537/2067 dead transitions. [2023-08-24 10:09:53,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 2067 transitions, 33117 flow [2023-08-24 10:09:53,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2023-08-24 10:09:53,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2023-08-24 10:09:53,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 6512 transitions. [2023-08-24 10:09:53,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2764006791171477 [2023-08-24 10:09:53,515 INFO L72 ComplementDD]: Start complementDD. Operand 95 states and 6512 transitions. [2023-08-24 10:09:53,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 6512 transitions. [2023-08-24 10:09:53,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:09:53,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 95 states and 6512 transitions. [2023-08-24 10:09:53,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 96 states, 95 states have (on average 68.54736842105264) internal successors, (6512), 95 states have internal predecessors, (6512), 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-08-24 10:09:53,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 96 states, 96 states have (on average 248.0) internal successors, (23808), 96 states have internal predecessors, (23808), 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-08-24 10:09:53,546 INFO L81 ComplementDD]: Finished complementDD. Result has 96 states, 96 states have (on average 248.0) internal successors, (23808), 96 states have internal predecessors, (23808), 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-08-24 10:09:53,546 INFO L175 Difference]: Start difference. First operand has 266 places, 644 transitions, 9554 flow. Second operand 95 states and 6512 transitions. [2023-08-24 10:09:53,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 2067 transitions, 33117 flow [2023-08-24 10:09:56,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 2067 transitions, 27815 flow, removed 2435 selfloop flow, removed 27 redundant places. [2023-08-24 10:09:56,947 INFO L231 Difference]: Finished difference. Result has 371 places, 1046 transitions, 16787 flow [2023-08-24 10:09:56,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=7448, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=291, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=95, PETRI_FLOW=16787, PETRI_PLACES=371, PETRI_TRANSITIONS=1046} [2023-08-24 10:09:56,948 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 340 predicate places. [2023-08-24 10:09:56,948 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 1046 transitions, 16787 flow [2023-08-24 10:09:56,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 63.714285714285715) internal successors, (2676), 42 states have internal predecessors, (2676), 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-08-24 10:09:56,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:09:56,949 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:09:56,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-24 10:09:57,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:09:57,150 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 10:09:57,150 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:09:57,150 INFO L85 PathProgramCache]: Analyzing trace with hash -2126548424, now seen corresponding path program 9 times [2023-08-24 10:09:57,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:09:57,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962636187] [2023-08-24 10:09:57,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:09:57,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:09:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:09:58,508 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:09:58,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:09:58,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962636187] [2023-08-24 10:09:58,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962636187] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:09:58,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655866322] [2023-08-24 10:09:58,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 10:09:58,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:09:58,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:09:58,510 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 10:09:58,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-24 10:09:58,651 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-24 10:09:58,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 10:09:58,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-24 10:09:58,656 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:09:58,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:09:58,984 INFO L351 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 32 treesize of output 32 [2023-08-24 10:09:59,073 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 10:09:59,073 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:09:59,193 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_513 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_513 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~queue~0.base) .cse0)) 1)))) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) is different from false [2023-08-24 10:09:59,298 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_513 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~queue~0.base) .cse2)))) (forall ((v_ArrVal_513 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~queue~0.base) .cse2)) 1))))) is different from false [2023-08-24 10:09:59,473 INFO L322 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-08-24 10:09:59,474 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 286 treesize of output 224 [2023-08-24 10:09:59,483 INFO L351 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 59 treesize of output 52 [2023-08-24 10:09:59,500 INFO L351 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 45 [2023-08-24 10:09:59,903 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2023-08-24 10:09:59,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655866322] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 10:09:59,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 10:09:59,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 33 [2023-08-24 10:09:59,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467348471] [2023-08-24 10:09:59,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 10:09:59,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-24 10:09:59,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:09:59,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-24 10:09:59,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=875, Unknown=5, NotChecked=122, Total=1122 [2023-08-24 10:09:59,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 248 [2023-08-24 10:09:59,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 1046 transitions, 16787 flow. Second operand has 34 states, 34 states have (on average 64.05882352941177) internal successors, (2178), 34 states have internal predecessors, (2178), 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-08-24 10:09:59,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:09:59,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 248 [2023-08-24 10:09:59,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:10:18,564 WARN L234 SmtUtils]: Spent 6.18s on a formula simplification. DAG size of input: 108 DAG size of output: 61 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 10:11:07,395 INFO L124 PetriNetUnfolderBase]: 14069/24543 cut-off events. [2023-08-24 10:11:07,395 INFO L125 PetriNetUnfolderBase]: For 713443/713443 co-relation queries the response was YES. [2023-08-24 10:11:07,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192858 conditions, 24543 events. 14069/24543 cut-off events. For 713443/713443 co-relation queries the response was YES. Maximal size of possible extension queue 752. Compared 190998 event pairs, 487 based on Foata normal form. 2060/26603 useless extension candidates. Maximal degree in co-relation 192742. Up to 5696 conditions per place. [2023-08-24 10:11:07,747 INFO L140 encePairwiseOnDemand]: 231/248 looper letters, 830 selfloop transitions, 1563 changer transitions 1396/3789 dead transitions. [2023-08-24 10:11:07,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 507 places, 3789 transitions, 60860 flow [2023-08-24 10:11:07,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2023-08-24 10:11:07,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2023-08-24 10:11:07,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 11815 transitions. [2023-08-24 10:11:07,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27538224874137607 [2023-08-24 10:11:07,764 INFO L72 ComplementDD]: Start complementDD. Operand 173 states and 11815 transitions. [2023-08-24 10:11:07,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 173 states and 11815 transitions. [2023-08-24 10:11:07,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:11:07,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 173 states and 11815 transitions. [2023-08-24 10:11:07,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 174 states, 173 states have (on average 68.29479768786128) internal successors, (11815), 173 states have internal predecessors, (11815), 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-08-24 10:11:07,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 174 states, 174 states have (on average 248.0) internal successors, (43152), 174 states have internal predecessors, (43152), 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-08-24 10:11:07,824 INFO L81 ComplementDD]: Finished complementDD. Result has 174 states, 174 states have (on average 248.0) internal successors, (43152), 174 states have internal predecessors, (43152), 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-08-24 10:11:07,824 INFO L175 Difference]: Start difference. First operand has 371 places, 1046 transitions, 16787 flow. Second operand 173 states and 11815 transitions. [2023-08-24 10:11:07,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 507 places, 3789 transitions, 60860 flow [2023-08-24 10:11:16,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 469 places, 3789 transitions, 54372 flow, removed 3034 selfloop flow, removed 38 redundant places. [2023-08-24 10:11:16,716 INFO L231 Difference]: Finished difference. Result has 557 places, 1884 transitions, 31285 flow [2023-08-24 10:11:16,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=9847, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=715, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=493, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=173, PETRI_FLOW=31285, PETRI_PLACES=557, PETRI_TRANSITIONS=1884} [2023-08-24 10:11:16,717 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 526 predicate places. [2023-08-24 10:11:16,717 INFO L495 AbstractCegarLoop]: Abstraction has has 557 places, 1884 transitions, 31285 flow [2023-08-24 10:11:16,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 64.05882352941177) internal successors, (2178), 34 states have internal predecessors, (2178), 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-08-24 10:11:16,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:11:16,718 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:11:16,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-24 10:11:16,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-24 10:11:16,926 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 10:11:16,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:11:16,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1061231246, now seen corresponding path program 10 times [2023-08-24 10:11:16,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:11:16,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075693011] [2023-08-24 10:11:16,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:11:16,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:11:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:11:18,231 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:11:18,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:11:18,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075693011] [2023-08-24 10:11:18,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075693011] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:11:18,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309136280] [2023-08-24 10:11:18,232 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 10:11:18,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:11:18,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:11:18,233 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 10:11:18,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-24 10:11:18,324 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 10:11:18,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 10:11:18,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-24 10:11:18,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:11:18,425 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-24 10:11:18,475 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 10:11:18,561 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 10:11:18,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:11:18,715 INFO L351 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 18 treesize of output 20 [2023-08-24 10:11:18,980 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:11:18,980 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:11:19,371 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (+ c_~front~0 1))) (or (let ((.cse10 (* c_~front~0 4)) (.cse5 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (let ((.cse6 (not .cse5)) (.cse4 (<= c_~back~0 c_~front~0)) (.cse3 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse1 (+ c_~queue~0.offset .cse10 4)) (.cse2 (+ c_~queue~0.offset .cse10))) (and (or (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2))) (not (= (select .cse0 .cse3) 1))))) .cse4 .cse5) (or .cse4 .cse6 (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (+ (select .cse7 .cse3) 1) 0)) (<= (+ c_~sum~0 (select .cse7 .cse1) (select .cse7 .cse2)) 1))))) (or (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse8 .cse1) (select .cse8 .cse2))) (not (= (+ (select .cse8 .cse3) 1) 0))))) .cse4 .cse6) (or .cse4 .cse5 (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (select .cse9 .cse3) 1)) (<= (+ c_~sum~0 (select .cse9 .cse1) (select .cse9 .cse2)) 1)))))))) (< .cse11 0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (<= c_~n~0 .cse11))) is different from false [2023-08-24 10:11:19,622 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse12 (+ c_~front~0 1))) (or (let ((.cse11 (* c_~front~0 4)) (.cse10 (* c_~back~0 4))) (let ((.cse6 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (+ c_~queue~0.offset .cse10 4)) (.cse2 (+ c_~queue~0.offset .cse11 4)) (.cse3 (+ c_~queue~0.offset .cse11)) (.cse4 (<= (+ c_~back~0 1) c_~front~0)) (.cse7 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse10)))) (and (or (and (or (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (select .cse0 .cse1) 1)) (<= (+ c_~sum~0 (select .cse0 .cse2) (select .cse0 .cse3)) 1)))) .cse4) (or (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse5 .cse2) (select .cse5 .cse3))) (not (= (select .cse5 .cse1) 1))))) .cse4)) (not .cse6) (not (= (+ .cse7 1) 0))) (or .cse6 (and (or (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (+ (select .cse8 .cse1) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse8 .cse2) (select .cse8 .cse3)))))) .cse4) (or (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (+ (select .cse9 .cse1) 1) 0)) (<= (+ c_~sum~0 (select .cse9 .cse2) (select .cse9 .cse3)) 1)))) .cse4)) (not (= .cse7 1)))))) (<= c_~n~0 c_~back~0) (< .cse12 0) (< c_~back~0 0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (<= c_~n~0 .cse12))) is different from false [2023-08-24 10:11:19,895 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (+ c_~front~0 1))) (or (let ((.cse9 (* c_~front~0 4)) (.cse10 (* c_~back~0 4))) (let ((.cse6 (<= (+ c_~back~0 1) c_~front~0)) (.cse1 (+ c_~queue~0.offset .cse10 4)) (.cse5 (+ c_~queue~0.offset .cse10)) (.cse2 (+ c_~queue~0.offset .cse9)) (.cse3 (+ c_~queue~0.offset .cse9 4))) (and (or (forall ((v_ArrVal_566 (Array Int Int)) (v_ArrVal_565 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_565))) (let ((.cse0 (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (+ (select .cse0 .cse1) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse0 .cse2) (select .cse0 .cse3))) (not (= (select (select .cse4 c_~queue~0.base) .cse5) 1)))))) .cse6) (or .cse6 (forall ((v_ArrVal_566 (Array Int Int)) (v_ArrVal_565 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_565))) (let ((.cse7 (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (+ (select .cse7 .cse1) 1) 0)) (not (= (select (select .cse8 c_~queue~0.base) .cse5) 1)) (<= (+ c_~sum~0 (select .cse7 .cse2) (select .cse7 .cse3)) 1))))))))) (<= c_~n~0 c_~back~0) (< .cse11 0) (< c_~back~0 0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (<= c_~n~0 .cse11))) is different from false [2023-08-24 10:11:19,937 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (+ c_~front~0 1))) (or (let ((.cse9 (* c_~front~0 4)) (.cse10 (* c_~back~0 4))) (let ((.cse6 (<= (+ c_~back~0 1) c_~front~0)) (.cse1 (+ c_~queue~0.offset .cse10 4)) (.cse5 (+ c_~queue~0.offset .cse10)) (.cse2 (+ c_~queue~0.offset .cse9)) (.cse3 (+ c_~queue~0.offset .cse9 4))) (and (or (forall ((v_ArrVal_566 (Array Int Int)) (v_ArrVal_565 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_565))) (let ((.cse0 (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (+ (select .cse0 .cse1) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse0 .cse2) (select .cse0 .cse3))) (not (= (select (select .cse4 c_~queue~0.base) .cse5) 1)))))) .cse6) (or .cse6 (forall ((v_ArrVal_566 (Array Int Int)) (v_ArrVal_565 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_565))) (let ((.cse7 (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (+ (select .cse7 .cse1) 1) 0)) (not (= (select (select .cse8 c_~queue~0.base) .cse5) 1)) (<= (+ c_~sum~0 (select .cse7 .cse2) (select .cse7 .cse3)) 1))))))))) (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< .cse11 0) (< c_~back~0 0) (<= c_~n~0 .cse11))) is different from false [2023-08-24 10:11:20,146 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:11:20,146 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 96 [2023-08-24 10:11:20,181 INFO L322 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-24 10:11:20,182 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 896 treesize of output 862 [2023-08-24 10:11:20,221 INFO L322 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-24 10:11:20,221 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 440 treesize of output 414 [2023-08-24 10:11:20,241 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 10:11:20,247 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:11:20,248 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 336 treesize of output 264 [2023-08-24 10:11:20,287 INFO L322 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-24 10:11:20,287 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 249 treesize of output 249 [2023-08-24 10:11:21,862 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:11:21,863 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 96 [2023-08-24 10:11:21,868 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 10:11:21,889 INFO L322 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-24 10:11:21,890 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 562 treesize of output 502 [2023-08-24 10:11:21,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:11:21,905 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 10:11:21,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:11:21,906 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 154 [2023-08-24 10:11:21,929 INFO L322 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-24 10:11:21,930 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 179 treesize of output 135 [2023-08-24 10:11:22,221 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 1 times theorem prover too weak. 0 trivial. 3 not checked. [2023-08-24 10:11:22,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309136280] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 10:11:22,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 10:11:22,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 15] total 41 [2023-08-24 10:11:22,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522240909] [2023-08-24 10:11:22,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 10:11:22,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-08-24 10:11:22,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:11:22,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-08-24 10:11:22,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=1159, Unknown=8, NotChecked=300, Total=1722 [2023-08-24 10:11:22,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 248 [2023-08-24 10:11:22,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 1884 transitions, 31285 flow. Second operand has 42 states, 42 states have (on average 63.785714285714285) internal successors, (2679), 42 states have internal predecessors, (2679), 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-08-24 10:11:22,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:11:22,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 248 [2023-08-24 10:11:22,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:11:27,097 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse16 (+ c_~front~0 1))) (let ((.cse0 (<= (+ c_~back~0 1) c_~front~0)) (.cse1 (= (mod c_~v_assert~0 256) 0)) (.cse2 (<= c_~n~0 c_~back~0)) (.cse3 (< .cse16 0)) (.cse4 (< c_~back~0 0)) (.cse5 (<= c_~n~0 .cse16))) (and (<= c_~v_assert~0 1) (or (and (or .cse0 (<= c_~sum~0 1)) (or .cse0 (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~back~0 c_~front~0) (<= 0 c_~sum~0)))) .cse1 .cse2 .cse3 .cse4 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5) (or (let ((.cse14 (* c_~front~0 4)) (.cse15 (* c_~back~0 4))) (let ((.cse7 (+ c_~queue~0.offset .cse15 4)) (.cse11 (+ c_~queue~0.offset .cse15)) (.cse8 (+ c_~queue~0.offset .cse14)) (.cse9 (+ c_~queue~0.offset .cse14 4))) (and (or (forall ((v_ArrVal_566 (Array Int Int)) (v_ArrVal_565 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_565))) (let ((.cse6 (select (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (+ (select .cse6 .cse7) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse6 .cse8) (select .cse6 .cse9))) (not (= (select (select .cse10 c_~queue~0.base) .cse11) 1)))))) .cse0) (or .cse0 (forall ((v_ArrVal_566 (Array Int Int)) (v_ArrVal_565 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_565))) (let ((.cse12 (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (+ (select .cse12 .cse7) 1) 0)) (not (= (select (select .cse13 c_~queue~0.base) .cse11) 1)) (<= (+ c_~sum~0 (select .cse12 .cse8) (select .cse12 .cse9)) 1))))))))) .cse1 .cse2 .cse3 .cse4 .cse5) (<= 1 c_~v_assert~0) (= c_~sum~0 0)))) is different from false [2023-08-24 10:11:27,108 WARN L839 $PredicateComparison]: unable to prove that (and (let ((.cse0 (+ c_~front~0 1))) (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< .cse0 0) (< c_~back~0 0) (let ((.cse11 (* c_~front~0 4)) (.cse10 (* c_~back~0 4))) (let ((.cse3 (+ .cse10 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ .cse11 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (<= (+ c_~back~0 1) c_~front~0))) (and (or .cse1 (forall ((v_ArrVal_564 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_565 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_565))) (let ((.cse2 (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (+ (select .cse2 .cse3) 1) 0)) (not (= (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse5) 1)) (<= 0 (+ c_~sum~0 (select .cse2 .cse6) (select .cse2 .cse7)))))))) (or (forall ((v_ArrVal_564 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_565 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_565))) (let ((.cse8 (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (+ (select .cse8 .cse3) 1) 0)) (<= (+ c_~sum~0 (select .cse8 .cse6) (select .cse8 .cse7)) 1) (not (= (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse5) 1)))))) .cse1)))) (<= c_~n~0 .cse0))) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (= c_~sum~0 0)) is different from false [2023-08-24 10:11:27,915 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse18 (* c_~front~0 4)) (.cse19 (* c_~back~0 4))) (let ((.cse7 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse19))) (.cse1 (+ c_~queue~0.offset .cse19 4)) (.cse2 (+ c_~queue~0.offset .cse18 4)) (.cse3 (+ c_~queue~0.offset .cse18)) (.cse4 (<= (+ c_~back~0 1) c_~front~0)) (.cse15 (+ c_~front~0 1))) (let ((.cse10 (<= c_~n~0 c_~back~0)) (.cse11 (< .cse15 0)) (.cse12 (< c_~back~0 0)) (.cse8 (and (or (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (+ (select .cse16 .cse1) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse16 .cse2) (select .cse16 .cse3)))))) .cse4) (or (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (+ (select .cse17 .cse1) 1) 0)) (<= (+ c_~sum~0 (select .cse17 .cse2) (select .cse17 .cse3)) 1)))) .cse4))) (.cse13 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (.cse9 (not (= .cse7 1))) (.cse14 (<= c_~n~0 .cse15))) (and (or (let ((.cse6 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (and (or (and (or (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (select .cse0 .cse1) 1)) (<= (+ c_~sum~0 (select .cse0 .cse2) (select .cse0 .cse3)) 1)))) .cse4) (or (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse5 .cse2) (select .cse5 .cse3))) (not (= (select .cse5 .cse1) 1))))) .cse4)) (not .cse6) (not (= (+ .cse7 1) 0))) (or .cse6 .cse8 .cse9))) .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse10 .cse11 .cse12 .cse8 .cse13 .cse9 .cse14))))) is different from false [2023-08-24 10:11:29,369 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse21 (select |c_#memory_int| c_~queue~0.base)) (.cse16 (* c_~back~0 4)) (.cse22 (* c_~front~0 4))) (let ((.cse19 (+ c_~front~0 1)) (.cse13 (+ c_~queue~0.offset .cse22)) (.cse12 (+ c_~queue~0.offset .cse22 4)) (.cse4 (select .cse21 (+ c_~queue~0.offset .cse16)))) (let ((.cse3 (not (= .cse4 1))) (.cse14 (<= (+ c_~back~0 1) c_~front~0)) (.cse8 (<= c_~n~0 c_~back~0)) (.cse9 (< c_~back~0 0)) (.cse18 (<= 0 c_~sum~0)) (.cse17 (<= c_~sum~0 1)) (.cse0 (let ((.cse20 (+ c_~sum~0 (select .cse21 .cse13) (select .cse21 .cse12)))) (and (<= .cse20 1) (<= 0 .cse20)))) (.cse5 (< .cse19 0)) (.cse6 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (.cse7 (<= c_~n~0 .cse19))) (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (or .cse0 (let ((.cse1 (<= c_~back~0 c_~front~0)) (.cse2 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (and (or .cse1 .cse2 .cse3) (or .cse1 (not .cse2) (not (= (+ .cse4 1) 0))))) .cse5 .cse6 .cse7) (<= c_~v_assert~0 1) (or .cse8 .cse5 .cse9 (let ((.cse11 (+ c_~queue~0.offset .cse16 4))) (and (or (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (+ (select .cse10 .cse11) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse10 .cse12) (select .cse10 .cse13)))))) .cse14) (or (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (+ (select .cse15 .cse11) 1) 0)) (<= (+ c_~sum~0 (select .cse15 .cse12) (select .cse15 .cse13)) 1)))) .cse14))) .cse6 .cse3 .cse7) (or (and (or .cse14 .cse17) (or .cse14 (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~back~0 c_~front~0) .cse18))) (= (mod c_~v_assert~0 256) 0) .cse8 .cse5 .cse9 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse7) (= |c_thread1Thread1of1ForFork2_~cond~0#1| c_~v_assert~0) (<= (div |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0) .cse18 .cse17 (or .cse0 (<= c_~back~0 .cse19) .cse5 .cse6 .cse7))))) is different from false [2023-08-24 10:11:46,608 INFO L124 PetriNetUnfolderBase]: 11854/20975 cut-off events. [2023-08-24 10:11:46,608 INFO L125 PetriNetUnfolderBase]: For 2596841/2596841 co-relation queries the response was YES. [2023-08-24 10:11:46,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331996 conditions, 20975 events. 11854/20975 cut-off events. For 2596841/2596841 co-relation queries the response was YES. Maximal size of possible extension queue 816. Compared 163897 event pairs, 1541 based on Foata normal form. 194/21169 useless extension candidates. Maximal degree in co-relation 331821. Up to 6107 conditions per place. [2023-08-24 10:11:46,987 INFO L140 encePairwiseOnDemand]: 232/248 looper letters, 1265 selfloop transitions, 1149 changer transitions 245/2659 dead transitions. [2023-08-24 10:11:46,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 2659 transitions, 55565 flow [2023-08-24 10:11:46,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-08-24 10:11:46,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2023-08-24 10:11:46,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 4734 transitions. [2023-08-24 10:11:46,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2726958525345622 [2023-08-24 10:11:46,995 INFO L72 ComplementDD]: Start complementDD. Operand 70 states and 4734 transitions. [2023-08-24 10:11:46,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 4734 transitions. [2023-08-24 10:11:46,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:11:46,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 70 states and 4734 transitions. [2023-08-24 10:11:47,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 71 states, 70 states have (on average 67.62857142857143) internal successors, (4734), 70 states have internal predecessors, (4734), 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-08-24 10:11:47,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 71 states, 71 states have (on average 248.0) internal successors, (17608), 71 states have internal predecessors, (17608), 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-08-24 10:11:47,015 INFO L81 ComplementDD]: Finished complementDD. Result has 71 states, 71 states have (on average 248.0) internal successors, (17608), 71 states have internal predecessors, (17608), 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-08-24 10:11:47,015 INFO L175 Difference]: Start difference. First operand has 557 places, 1884 transitions, 31285 flow. Second operand 70 states and 4734 transitions. [2023-08-24 10:11:47,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 2659 transitions, 55565 flow [2023-08-24 10:12:07,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 2659 transitions, 47842 flow, removed 3300 selfloop flow, removed 53 redundant places. [2023-08-24 10:12:07,912 INFO L231 Difference]: Finished difference. Result has 590 places, 2089 transitions, 34551 flow [2023-08-24 10:12:07,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=26766, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1884, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=953, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=867, PETRI_DIFFERENCE_SUBTRAHEND_STATES=70, PETRI_FLOW=34551, PETRI_PLACES=590, PETRI_TRANSITIONS=2089} [2023-08-24 10:12:07,914 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 559 predicate places. [2023-08-24 10:12:07,914 INFO L495 AbstractCegarLoop]: Abstraction has has 590 places, 2089 transitions, 34551 flow [2023-08-24 10:12:07,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 63.785714285714285) internal successors, (2679), 42 states have internal predecessors, (2679), 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-08-24 10:12:07,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:12:07,915 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:12:07,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-24 10:12:08,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-24 10:12:08,116 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 10:12:08,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:12:08,116 INFO L85 PathProgramCache]: Analyzing trace with hash 831425070, now seen corresponding path program 11 times [2023-08-24 10:12:08,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:12:08,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850245510] [2023-08-24 10:12:08,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:12:08,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:12:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:12:09,233 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:12:09,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:12:09,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850245510] [2023-08-24 10:12:09,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850245510] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:12:09,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306811180] [2023-08-24 10:12:09,234 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 10:12:09,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:12:09,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:12:09,234 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 10:12:09,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-24 10:12:09,352 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-08-24 10:12:09,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 10:12:09,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 54 conjunts are in the unsatisfiable core [2023-08-24 10:12:09,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:12:09,452 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-24 10:12:09,515 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 10:12:09,577 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 10:12:09,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:12:09,813 INFO L351 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 32 treesize of output 32 [2023-08-24 10:12:09,905 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:12:09,905 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:12:10,178 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (<= c_~n~0 c_~back~0) (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_619 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_619 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse1))))))) (< c_~back~0 0) (< c_~front~0 0) (let ((.cse4 (<= (+ c_~back~0 1) c_~front~0)) (.cse5 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse6 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse4 (not .cse5) (not (= (+ .cse6 1) 0))) (or .cse4 .cse5 (not (= .cse6 1))))))) is different from false [2023-08-24 10:12:10,209 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (<= c_~n~0 c_~back~0) (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_619 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_619 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse1))))))) (< c_~front~0 0) (let ((.cse4 (<= (+ c_~back~0 1) c_~front~0)) (.cse5 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse6 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse4 (not .cse5) (not (= (+ .cse6 1) 0))) (or .cse4 .cse5 (not (= .cse6 1))))))) is different from false [2023-08-24 10:12:10,433 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~queue~0.base)) (.cse1 (* c_~back~0 4))) (or (= (mod c_~v_assert~0 256) 0) (not (= (+ (select .cse0 (+ c_~queue~0.offset .cse1 4)) 1) 0)) (let ((.cse4 (* c_~front~0 4))) (let ((.cse2 (select .cse0 (+ c_~queue~0.offset .cse4))) (.cse3 (+ c_~queue~0.offset .cse4 4))) (and (forall ((v_ArrVal_619 (Array Int Int))) (<= (+ c_~sum~0 .cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse3)) 1)) (forall ((v_ArrVal_619 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse3))))))) (<= (+ c_~back~0 2) c_~front~0) (<= c_~n~0 (+ c_~back~0 1)) (< c_~front~0 0) (not (= (select .cse0 (+ c_~queue~0.offset .cse1)) 1)))) is different from false [2023-08-24 10:12:10,864 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:12:10,864 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 90 [2023-08-24 10:12:10,901 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:12:10,902 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7938 treesize of output 7140 [2023-08-24 10:12:10,933 INFO L351 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 203 treesize of output 175 [2023-08-24 10:12:10,971 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:12:10,972 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 218 treesize of output 222 [2023-08-24 10:12:11,009 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:12:11,010 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 223 treesize of output 195 [2023-08-24 10:12:12,937 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:12:12,938 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 90 [2023-08-24 10:12:12,943 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 10:12:12,964 INFO L322 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-24 10:12:12,965 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2242 treesize of output 1944 [2023-08-24 10:12:12,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:12:12,983 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 10:12:12,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:12:12,984 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 154 [2023-08-24 10:12:13,008 INFO L322 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-24 10:12:13,008 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 179 treesize of output 135 [2023-08-24 10:12:13,216 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-24 10:12:13,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306811180] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 10:12:13,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 10:12:13,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 39 [2023-08-24 10:12:13,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209268594] [2023-08-24 10:12:13,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 10:12:13,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-08-24 10:12:13,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:12:13,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-08-24 10:12:13,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1131, Unknown=16, NotChecked=216, Total=1560 [2023-08-24 10:12:13,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 248 [2023-08-24 10:12:13,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 590 places, 2089 transitions, 34551 flow. Second operand has 40 states, 40 states have (on average 63.775) internal successors, (2551), 40 states have internal predecessors, (2551), 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-08-24 10:12:13,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:12:13,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 248 [2023-08-24 10:12:13,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:12:14,250 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (or (= (mod c_~v_assert~0 256) 0) (let ((.cse8 (* c_~back~0 4)) (.cse9 (* c_~front~0 4))) (let ((.cse4 (+ .cse9 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ .cse8 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_617 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_617) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_618))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse0 .cse1) 1)) (not (= (+ (select .cse0 .cse2) 1) 0)) (forall ((v_ArrVal_619 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse4) (select .cse0 .cse5)) 1)))))) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_617 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_617) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_618))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (forall ((v_ArrVal_619 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse4) (select .cse7 .cse5)))) (not (= (select .cse7 .cse1) 1)) (not (= (+ (select .cse7 .cse2) 1) 0))))))))) (<= (+ c_~back~0 2) c_~front~0) (<= c_~n~0 (+ c_~back~0 1)) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< c_~front~0 0)) (<= 1 c_~v_assert~0) (= c_~sum~0 0)) is different from false [2023-08-24 10:12:15,735 WARN L839 $PredicateComparison]: unable to prove that (and (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (<= c_~n~0 c_~back~0) (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_619 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_619 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse1))))))) (< c_~front~0 0) (let ((.cse4 (<= (+ c_~back~0 1) c_~front~0)) (.cse5 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse6 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse4 (not .cse5) (not (= (+ .cse6 1) 0))) (or .cse4 .cse5 (not (= .cse6 1))))))) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (= c_~sum~0 0)) is different from false [2023-08-24 10:12:16,225 WARN L839 $PredicateComparison]: unable to prove that (and (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (<= c_~n~0 c_~back~0) (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_619 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_619 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse1))))))) (< c_~front~0 0) (let ((.cse4 (<= (+ c_~back~0 1) c_~front~0)) (.cse5 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse6 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse4 (not .cse5) (not (= (+ .cse6 1) 0))) (or .cse4 .cse5 (not (= .cse6 1))))))) (<= c_~v_assert~0 1) (<= |c_thread1Thread1of1ForFork2_~cond~0#1| 1) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0) (= c_~sum~0 0)) is different from false [2023-08-24 10:12:17,041 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse16 (* c_~front~0 4))) (let ((.cse2 (= (mod c_~v_assert~0 256) 0)) (.cse3 (<= (+ c_~back~0 2) c_~front~0)) (.cse4 (<= c_~n~0 (+ c_~back~0 1))) (.cse0 (<= 0 c_~sum~0)) (.cse9 (+ c_~queue~0.offset .cse16 4)) (.cse7 (+ c_~queue~0.offset .cse16)) (.cse5 (< c_~front~0 0)) (.cse1 (<= c_~sum~0 1))) (and (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~back~0 c_~front~0) .cse0 .cse1) .cse2 .cse3 .cse4 .cse5 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= c_~v_assert~0 1) (<= |c_thread1Thread1of1ForFork2_~cond~0#1| 1) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (or .cse2 .cse3 (let ((.cse14 (* c_~back~0 4))) (let ((.cse10 (+ c_~queue~0.offset .cse14 4)) (.cse11 (+ c_~queue~0.offset .cse14))) (and (forall ((v_ArrVal_618 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_618))) (let ((.cse6 (select .cse8 c_~queue~0.base))) (or (forall ((v_ArrVal_619 (Array Int Int))) (<= (+ c_~sum~0 (select .cse6 .cse7) (select (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse9)) 1)) (not (= (+ (select .cse6 .cse10) 1) 0)) (not (= (select .cse6 .cse11) 1)))))) (forall ((v_ArrVal_618 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_618))) (let ((.cse12 (select .cse13 c_~queue~0.base))) (or (not (= (+ (select .cse12 .cse10) 1) 0)) (forall ((v_ArrVal_619 (Array Int Int))) (<= 0 (+ c_~sum~0 (select .cse12 .cse7) (select (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse9)))) (not (= (select .cse12 .cse11) 1))))))))) .cse4 .cse5) (<= 1 c_~v_assert~0) .cse0 (or (<= c_~n~0 c_~front~0) (let ((.cse15 (select (select |c_#memory_int| c_~queue~0.base) .cse7))) (and (forall ((v_ArrVal_619 (Array Int Int))) (<= (+ c_~sum~0 .cse15 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse9)) 1)) (forall ((v_ArrVal_619 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse15 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse9)))))) (<= c_~back~0 c_~front~0) .cse5) .cse1))) is different from false [2023-08-24 10:12:17,965 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_619 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse0)))) (< 0 (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256)) (forall ((v_ArrVal_619 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse0)) 1)))) is different from false [2023-08-24 10:12:18,732 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (<= |c_thread1Thread1of1ForFork2_~cond~0#1| 1) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (or (<= c_~n~0 c_~front~0) (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_619 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_619 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse1))))))) (<= c_~back~0 c_~front~0) (< c_~front~0 0)) (<= c_~sum~0 1)) is different from false [2023-08-24 10:12:37,053 INFO L124 PetriNetUnfolderBase]: 19145/33270 cut-off events. [2023-08-24 10:12:37,053 INFO L125 PetriNetUnfolderBase]: For 3146030/3146030 co-relation queries the response was YES. [2023-08-24 10:12:37,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479931 conditions, 33270 events. 19145/33270 cut-off events. For 3146030/3146030 co-relation queries the response was YES. Maximal size of possible extension queue 1432. Compared 276492 event pairs, 2092 based on Foata normal form. 122/33392 useless extension candidates. Maximal degree in co-relation 479764. Up to 9823 conditions per place. [2023-08-24 10:12:38,216 INFO L140 encePairwiseOnDemand]: 232/248 looper letters, 2326 selfloop transitions, 1409 changer transitions 268/4003 dead transitions. [2023-08-24 10:12:38,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 648 places, 4003 transitions, 77417 flow [2023-08-24 10:12:38,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-08-24 10:12:38,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2023-08-24 10:12:38,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 4698 transitions. [2023-08-24 10:12:38,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2706221198156682 [2023-08-24 10:12:38,224 INFO L72 ComplementDD]: Start complementDD. Operand 70 states and 4698 transitions. [2023-08-24 10:12:38,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 4698 transitions. [2023-08-24 10:12:38,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:12:38,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 70 states and 4698 transitions. [2023-08-24 10:12:38,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 71 states, 70 states have (on average 67.11428571428571) internal successors, (4698), 70 states have internal predecessors, (4698), 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-08-24 10:12:38,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 71 states, 71 states have (on average 248.0) internal successors, (17608), 71 states have internal predecessors, (17608), 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-08-24 10:12:38,248 INFO L81 ComplementDD]: Finished complementDD. Result has 71 states, 71 states have (on average 248.0) internal successors, (17608), 71 states have internal predecessors, (17608), 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-08-24 10:12:38,248 INFO L175 Difference]: Start difference. First operand has 590 places, 2089 transitions, 34551 flow. Second operand 70 states and 4698 transitions. [2023-08-24 10:12:38,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 648 places, 4003 transitions, 77417 flow [2023-08-24 10:13:08,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 618 places, 4003 transitions, 74916 flow, removed 665 selfloop flow, removed 30 redundant places. [2023-08-24 10:13:08,368 INFO L231 Difference]: Finished difference. Result has 651 places, 2901 transitions, 54182 flow [2023-08-24 10:13:08,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=32994, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2073, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=624, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1000, PETRI_DIFFERENCE_SUBTRAHEND_STATES=70, PETRI_FLOW=54182, PETRI_PLACES=651, PETRI_TRANSITIONS=2901} [2023-08-24 10:13:08,370 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 620 predicate places. [2023-08-24 10:13:08,370 INFO L495 AbstractCegarLoop]: Abstraction has has 651 places, 2901 transitions, 54182 flow [2023-08-24 10:13:08,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 63.775) internal successors, (2551), 40 states have internal predecessors, (2551), 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-08-24 10:13:08,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:13:08,371 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:13:08,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-08-24 10:13:08,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-24 10:13:08,576 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 10:13:08,576 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:13:08,576 INFO L85 PathProgramCache]: Analyzing trace with hash 681889414, now seen corresponding path program 12 times [2023-08-24 10:13:08,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:13:08,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85542772] [2023-08-24 10:13:08,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:13:08,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:13:08,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:13:09,813 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:13:09,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:13:09,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85542772] [2023-08-24 10:13:09,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85542772] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:13:09,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548892454] [2023-08-24 10:13:09,814 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 10:13:09,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:13:09,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:13:09,815 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 10:13:09,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-24 10:13:09,946 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-08-24 10:13:09,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 10:13:09,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-24 10:13:09,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:13:10,249 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 10:13:10,249 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:13:10,636 INFO L322 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-08-24 10:13:10,636 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 178 [2023-08-24 10:13:11,032 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 10:13:11,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548892454] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 10:13:11,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 10:13:11,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 9] total 30 [2023-08-24 10:13:11,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420608773] [2023-08-24 10:13:11,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 10:13:11,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-24 10:13:11,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:13:11,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-24 10:13:11,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2023-08-24 10:13:11,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 248 [2023-08-24 10:13:11,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 2901 transitions, 54182 flow. Second operand has 31 states, 31 states have (on average 74.51612903225806) internal successors, (2310), 31 states have internal predecessors, (2310), 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-08-24 10:13:11,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:13:11,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 248 [2023-08-24 10:13:11,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:13:37,880 INFO L124 PetriNetUnfolderBase]: 21088/36476 cut-off events. [2023-08-24 10:13:37,881 INFO L125 PetriNetUnfolderBase]: For 4176769/4176769 co-relation queries the response was YES. [2023-08-24 10:13:38,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 568633 conditions, 36476 events. 21088/36476 cut-off events. For 4176769/4176769 co-relation queries the response was YES. Maximal size of possible extension queue 1495. Compared 304647 event pairs, 1862 based on Foata normal form. 114/36590 useless extension candidates. Maximal degree in co-relation 568449. Up to 17007 conditions per place. [2023-08-24 10:13:39,000 INFO L140 encePairwiseOnDemand]: 235/248 looper letters, 2071 selfloop transitions, 1795 changer transitions 169/4035 dead transitions. [2023-08-24 10:13:39,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 690 places, 4035 transitions, 86583 flow [2023-08-24 10:13:39,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-08-24 10:13:39,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2023-08-24 10:13:39,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 4290 transitions. [2023-08-24 10:13:39,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31451612903225806 [2023-08-24 10:13:39,004 INFO L72 ComplementDD]: Start complementDD. Operand 55 states and 4290 transitions. [2023-08-24 10:13:39,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 4290 transitions. [2023-08-24 10:13:39,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:13:39,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 4290 transitions. [2023-08-24 10:13:39,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 56 states, 55 states have (on average 78.0) internal successors, (4290), 55 states have internal predecessors, (4290), 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-08-24 10:13:39,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 56 states, 56 states have (on average 248.0) internal successors, (13888), 56 states have internal predecessors, (13888), 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-08-24 10:13:39,020 INFO L81 ComplementDD]: Finished complementDD. Result has 56 states, 56 states have (on average 248.0) internal successors, (13888), 56 states have internal predecessors, (13888), 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-08-24 10:13:39,020 INFO L175 Difference]: Start difference. First operand has 651 places, 2901 transitions, 54182 flow. Second operand 55 states and 4290 transitions. [2023-08-24 10:13:39,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 690 places, 4035 transitions, 86583 flow [2023-08-24 10:14:08,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 662 places, 4035 transitions, 84725 flow, removed 798 selfloop flow, removed 28 redundant places. [2023-08-24 10:14:08,522 INFO L231 Difference]: Finished difference. Result has 676 places, 3368 transitions, 67579 flow [2023-08-24 10:14:08,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=52971, PETRI_DIFFERENCE_MINUEND_PLACES=608, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2901, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1347, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=67579, PETRI_PLACES=676, PETRI_TRANSITIONS=3368} [2023-08-24 10:14:08,525 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 645 predicate places. [2023-08-24 10:14:08,525 INFO L495 AbstractCegarLoop]: Abstraction has has 676 places, 3368 transitions, 67579 flow [2023-08-24 10:14:08,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 74.51612903225806) internal successors, (2310), 31 states have internal predecessors, (2310), 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-08-24 10:14:08,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:14:08,526 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:14:08,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-24 10:14:08,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-24 10:14:08,731 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 10:14:08,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:14:08,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1698548598, now seen corresponding path program 13 times [2023-08-24 10:14:08,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:14:08,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203843349] [2023-08-24 10:14:08,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:14:08,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:14:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:14:10,349 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:14:10,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:14:10,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203843349] [2023-08-24 10:14:10,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203843349] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:14:10,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420003351] [2023-08-24 10:14:10,350 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-24 10:14:10,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:14:10,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:14:10,351 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 10:14:10,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-24 10:14:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:14:10,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-24 10:14:10,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:14:10,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:14:10,730 INFO L351 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 19 treesize of output 21 [2023-08-24 10:14:10,919 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 10:14:10,919 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:14:11,285 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (let ((.cse8 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse2 (+ c_~queue~0.offset .cse8 4)) (.cse3 (+ c_~queue~0.offset .cse8)) (.cse5 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (and (or (and (forall ((v_ArrVal_724 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_724) c_~queue~0.base))) (or (not (= (select .cse0 .cse1) 1)) (<= (+ c_~sum~0 (select .cse0 .cse2) (select .cse0 .cse3)) 1)))) (forall ((v_ArrVal_724 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_724) c_~queue~0.base))) (or (not (= (select .cse4 .cse1) 1)) (<= 0 (+ c_~sum~0 (select .cse4 .cse2) (select .cse4 .cse3))))))) .cse5) (or (and (forall ((v_ArrVal_724 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_724) c_~queue~0.base))) (or (not (= (+ (select .cse6 .cse1) 1) 0)) (<= (+ c_~sum~0 (select .cse6 .cse2) (select .cse6 .cse3)) 1)))) (forall ((v_ArrVal_724 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_724) c_~queue~0.base))) (or (not (= (+ (select .cse7 .cse1) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse7 .cse2) (select .cse7 .cse3))))))) (not .cse5)))))) is different from false [2023-08-24 10:14:11,466 INFO L322 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-08-24 10:14:11,466 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 497 treesize of output 401 [2023-08-24 10:14:11,494 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:14:11,495 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 260 treesize of output 260 [2023-08-24 10:14:11,523 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:14:11,524 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 241 treesize of output 241 [2023-08-24 10:14:11,552 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:14:11,552 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 222 treesize of output 222 [2023-08-24 10:14:11,576 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:14:11,577 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 203 [2023-08-24 10:14:14,628 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 10:14:14,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420003351] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 10:14:14,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 10:14:14,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 35 [2023-08-24 10:14:14,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190738252] [2023-08-24 10:14:14,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 10:14:14,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-08-24 10:14:14,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:14:14,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-08-24 10:14:14,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1044, Unknown=1, NotChecked=66, Total=1260 [2023-08-24 10:14:14,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 248 [2023-08-24 10:14:14,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 676 places, 3368 transitions, 67579 flow. Second operand has 36 states, 36 states have (on average 63.94444444444444) internal successors, (2302), 36 states have internal predecessors, (2302), 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-08-24 10:14:14,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:14:14,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 248 [2023-08-24 10:14:14,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:14:57,789 INFO L124 PetriNetUnfolderBase]: 29363/50828 cut-off events. [2023-08-24 10:14:57,790 INFO L125 PetriNetUnfolderBase]: For 5921680/5921680 co-relation queries the response was YES. [2023-08-24 10:14:59,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 803970 conditions, 50828 events. 29363/50828 cut-off events. For 5921680/5921680 co-relation queries the response was YES. Maximal size of possible extension queue 1963. Compared 444948 event pairs, 1920 based on Foata normal form. 806/51634 useless extension candidates. Maximal degree in co-relation 803782. Up to 13609 conditions per place. [2023-08-24 10:14:59,581 INFO L140 encePairwiseOnDemand]: 231/248 looper letters, 2308 selfloop transitions, 2249 changer transitions 1201/5758 dead transitions. [2023-08-24 10:14:59,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 734 places, 5758 transitions, 128426 flow [2023-08-24 10:14:59,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-08-24 10:14:59,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2023-08-24 10:14:59,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 3999 transitions. [2023-08-24 10:14:59,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2733050847457627 [2023-08-24 10:14:59,586 INFO L72 ComplementDD]: Start complementDD. Operand 59 states and 3999 transitions. [2023-08-24 10:14:59,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 3999 transitions. [2023-08-24 10:14:59,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:14:59,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 59 states and 3999 transitions. [2023-08-24 10:14:59,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 60 states, 59 states have (on average 67.77966101694915) internal successors, (3999), 59 states have internal predecessors, (3999), 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-08-24 10:14:59,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 60 states, 60 states have (on average 248.0) internal successors, (14880), 60 states have internal predecessors, (14880), 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-08-24 10:14:59,602 INFO L81 ComplementDD]: Finished complementDD. Result has 60 states, 60 states have (on average 248.0) internal successors, (14880), 60 states have internal predecessors, (14880), 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-08-24 10:14:59,602 INFO L175 Difference]: Start difference. First operand has 676 places, 3368 transitions, 67579 flow. Second operand 59 states and 3999 transitions. [2023-08-24 10:14:59,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 734 places, 5758 transitions, 128426 flow [2023-08-24 10:16:02,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 722 places, 5758 transitions, 124587 flow, removed 1096 selfloop flow, removed 12 redundant places. [2023-08-24 10:16:02,305 INFO L231 Difference]: Finished difference. Result has 752 places, 3879 transitions, 84683 flow [2023-08-24 10:16:02,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=64931, PETRI_DIFFERENCE_MINUEND_PLACES=664, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1723, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=84683, PETRI_PLACES=752, PETRI_TRANSITIONS=3879} [2023-08-24 10:16:02,309 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 721 predicate places. [2023-08-24 10:16:02,309 INFO L495 AbstractCegarLoop]: Abstraction has has 752 places, 3879 transitions, 84683 flow [2023-08-24 10:16:02,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 63.94444444444444) internal successors, (2302), 36 states have internal predecessors, (2302), 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-08-24 10:16:02,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:16:02,310 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:16:02,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-24 10:16:02,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-24 10:16:02,515 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 10:16:02,515 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:16:02,515 INFO L85 PathProgramCache]: Analyzing trace with hash 882178682, now seen corresponding path program 14 times [2023-08-24 10:16:02,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:16:02,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403602288] [2023-08-24 10:16:02,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:16:02,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:16:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:16:04,019 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:16:04,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:16:04,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403602288] [2023-08-24 10:16:04,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403602288] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:16:04,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801555424] [2023-08-24 10:16:04,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 10:16:04,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:16:04,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:16:04,021 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 10:16:04,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-24 10:16:04,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 10:16:04,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 10:16:04,126 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-24 10:16:04,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:16:04,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:16:04,356 INFO L351 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 18 treesize of output 20 [2023-08-24 10:16:04,499 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 10:16:04,500 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:16:04,883 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (let ((.cse8 (* c_~front~0 4))) (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse2 (+ c_~queue~0.offset .cse8)) (.cse3 (+ c_~queue~0.offset .cse8 4)) (.cse4 (+ c_~queue~0.offset (* c_~back~0 4)))) (and (or .cse0 (and (forall ((v_ArrVal_777 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_777) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse1 .cse2) (select .cse1 .cse3))) (not (= (select .cse1 .cse4) 1))))) (forall ((v_ArrVal_777 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_777) c_~queue~0.base))) (or (not (= (select .cse5 .cse4) 1)) (<= (+ c_~sum~0 (select .cse5 .cse2) (select .cse5 .cse3)) 1)))))) (or (not .cse0) (and (forall ((v_ArrVal_777 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_777) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse6 .cse2) (select .cse6 .cse3))) (not (= 0 (+ (select .cse6 .cse4) 1)))))) (forall ((v_ArrVal_777 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_777) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse7 .cse2) (select .cse7 .cse3)) 1) (not (= 0 (+ (select .cse7 .cse4) 1)))))))))))) is different from false [2023-08-24 10:16:04,971 INFO L322 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-08-24 10:16:04,972 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 497 treesize of output 401 [2023-08-24 10:16:04,992 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:16:04,993 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 260 treesize of output 260 [2023-08-24 10:16:05,014 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:16:05,014 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 241 treesize of output 241 [2023-08-24 10:16:05,035 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:16:05,036 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 222 treesize of output 222 [2023-08-24 10:16:05,058 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:16:05,058 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 203 [2023-08-24 10:16:08,349 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2023-08-24 10:16:08,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801555424] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 10:16:08,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 10:16:08,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 11] total 35 [2023-08-24 10:16:08,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109335534] [2023-08-24 10:16:08,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 10:16:08,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-08-24 10:16:08,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:16:08,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-08-24 10:16:08,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1018, Unknown=15, NotChecked=66, Total=1260 [2023-08-24 10:16:08,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 248 [2023-08-24 10:16:08,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 752 places, 3879 transitions, 84683 flow. Second operand has 36 states, 36 states have (on average 71.97222222222223) internal successors, (2591), 36 states have internal predecessors, (2591), 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-08-24 10:16:08,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:16:08,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 248 [2023-08-24 10:16:08,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:16:26,493 WARN L234 SmtUtils]: Spent 12.25s on a formula simplification. DAG size of input: 64 DAG size of output: 61 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 10:17:13,603 INFO L124 PetriNetUnfolderBase]: 28888/49819 cut-off events. [2023-08-24 10:17:13,603 INFO L125 PetriNetUnfolderBase]: For 7950427/7950427 co-relation queries the response was YES. [2023-08-24 10:17:15,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 887741 conditions, 49819 events. 28888/49819 cut-off events. For 7950427/7950427 co-relation queries the response was YES. Maximal size of possible extension queue 2113. Compared 435589 event pairs, 1869 based on Foata normal form. 110/49929 useless extension candidates. Maximal degree in co-relation 887525. Up to 20292 conditions per place. [2023-08-24 10:17:15,679 INFO L140 encePairwiseOnDemand]: 238/248 looper letters, 2503 selfloop transitions, 2211 changer transitions 262/4976 dead transitions. [2023-08-24 10:17:15,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 783 places, 4976 transitions, 121623 flow [2023-08-24 10:17:15,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-08-24 10:17:15,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-08-24 10:17:15,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 3011 transitions. [2023-08-24 10:17:15,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31131100082712987 [2023-08-24 10:17:15,683 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 3011 transitions. [2023-08-24 10:17:15,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 3011 transitions. [2023-08-24 10:17:15,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:17:15,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 3011 transitions. [2023-08-24 10:17:15,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 77.2051282051282) internal successors, (3011), 39 states have internal predecessors, (3011), 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-08-24 10:17:15,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 248.0) internal successors, (9920), 40 states have internal predecessors, (9920), 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-08-24 10:17:15,693 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 248.0) internal successors, (9920), 40 states have internal predecessors, (9920), 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-08-24 10:17:15,693 INFO L175 Difference]: Start difference. First operand has 752 places, 3879 transitions, 84683 flow. Second operand 39 states and 3011 transitions. [2023-08-24 10:17:15,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 783 places, 4976 transitions, 121623 flow [2023-08-24 10:18:25,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 754 places, 4976 transitions, 116778 flow, removed 1265 selfloop flow, removed 29 redundant places. [2023-08-24 10:18:25,741 INFO L231 Difference]: Finished difference. Result has 768 places, 4217 transitions, 96492 flow [2023-08-24 10:18:25,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=81140, PETRI_DIFFERENCE_MINUEND_PLACES=716, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3879, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1893, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1867, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=96492, PETRI_PLACES=768, PETRI_TRANSITIONS=4217} [2023-08-24 10:18:25,745 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 737 predicate places. [2023-08-24 10:18:25,745 INFO L495 AbstractCegarLoop]: Abstraction has has 768 places, 4217 transitions, 96492 flow [2023-08-24 10:18:25,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 71.97222222222223) internal successors, (2591), 36 states have internal predecessors, (2591), 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-08-24 10:18:25,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:18:25,745 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:18:25,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-24 10:18:25,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:18:25,946 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 10:18:25,946 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:18:25,946 INFO L85 PathProgramCache]: Analyzing trace with hash 82692924, now seen corresponding path program 15 times [2023-08-24 10:18:25,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:18:25,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607341513] [2023-08-24 10:18:25,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:18:25,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:18:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:18:27,210 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:18:27,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:18:27,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607341513] [2023-08-24 10:18:27,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607341513] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:18:27,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303203303] [2023-08-24 10:18:27,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 10:18:27,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:18:27,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:18:27,213 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 10:18:27,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-24 10:18:27,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-24 10:18:27,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 10:18:27,383 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-24 10:18:27,384 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:18:27,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:18:27,673 INFO L351 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 32 treesize of output 32 [2023-08-24 10:18:27,798 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 10:18:27,799 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:18:27,923 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_830 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_830) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_830 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_830) c_~queue~0.base) .cse0)) 1))))) is different from false [2023-08-24 10:18:27,948 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_830 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_830) c_~queue~0.base) .cse2)))) (forall ((v_ArrVal_830 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_830) c_~queue~0.base) .cse2)) 1))))) is different from false [2023-08-24 10:18:28,122 INFO L322 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-08-24 10:18:28,123 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 286 treesize of output 224 [2023-08-24 10:18:28,132 INFO L351 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 59 treesize of output 52 [2023-08-24 10:18:28,151 INFO L351 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 45 [2023-08-24 10:18:28,543 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2023-08-24 10:18:28,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303203303] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 10:18:28,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 10:18:28,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 11] total 35 [2023-08-24 10:18:28,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047188666] [2023-08-24 10:18:28,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 10:18:28,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-08-24 10:18:28,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:18:28,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-08-24 10:18:28,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=973, Unknown=5, NotChecked=130, Total=1260 [2023-08-24 10:18:28,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 248 [2023-08-24 10:18:28,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 768 places, 4217 transitions, 96492 flow. Second operand has 36 states, 36 states have (on average 70.22222222222223) internal successors, (2528), 36 states have internal predecessors, (2528), 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-08-24 10:18:28,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:18:28,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 248 [2023-08-24 10:18:28,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:18:30,518 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= c_~v_assert~0 1) (<= |c_thread2Thread1of1ForFork0_~cond~1#1| 1) (<= (div |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_830 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_830) c_~queue~0.base) .cse2)))) (forall ((v_ArrVal_830 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_830) c_~queue~0.base) .cse2)) 1))))) (<= c_~sum~0 1)) is different from false [2023-08-24 10:18:33,895 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= c_~v_assert~0 1) (<= |c_thread2Thread1of1ForFork0_~cond~1#1| 1) (<= (div |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (or (= (mod c_~v_assert~0 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_830 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_830) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_830 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_830) c_~queue~0.base) .cse0)) 1))))) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0) (= c_~sum~0 0)) is different from false [2023-08-24 10:20:00,625 INFO L124 PetriNetUnfolderBase]: 50189/84819 cut-off events. [2023-08-24 10:20:00,625 INFO L125 PetriNetUnfolderBase]: For 13327077/13327077 co-relation queries the response was YES. [2023-08-24 10:20:03,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1540405 conditions, 84819 events. 50189/84819 cut-off events. For 13327077/13327077 co-relation queries the response was YES. Maximal size of possible extension queue 3571. Compared 783305 event pairs, 2985 based on Foata normal form. 863/85682 useless extension candidates. Maximal degree in co-relation 1540186. Up to 27359 conditions per place. [2023-08-24 10:20:04,284 INFO L140 encePairwiseOnDemand]: 233/248 looper letters, 4235 selfloop transitions, 3089 changer transitions 1269/8593 dead transitions. [2023-08-24 10:20:04,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 822 places, 8593 transitions, 216803 flow [2023-08-24 10:20:04,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-08-24 10:20:04,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2023-08-24 10:20:04,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 4437 transitions. [2023-08-24 10:20:04,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2981854838709677 [2023-08-24 10:20:04,293 INFO L72 ComplementDD]: Start complementDD. Operand 60 states and 4437 transitions. [2023-08-24 10:20:04,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 4437 transitions. [2023-08-24 10:20:04,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:20:04,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 60 states and 4437 transitions. [2023-08-24 10:20:04,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 61 states, 60 states have (on average 73.95) internal successors, (4437), 60 states have internal predecessors, (4437), 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-08-24 10:20:04,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 61 states, 61 states have (on average 248.0) internal successors, (15128), 61 states have internal predecessors, (15128), 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-08-24 10:20:04,310 INFO L81 ComplementDD]: Finished complementDD. Result has 61 states, 61 states have (on average 248.0) internal successors, (15128), 61 states have internal predecessors, (15128), 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-08-24 10:20:04,310 INFO L175 Difference]: Start difference. First operand has 768 places, 4217 transitions, 96492 flow. Second operand 60 states and 4437 transitions. [2023-08-24 10:20:04,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 822 places, 8593 transitions, 216803 flow Received shutdown request... [2023-08-24 10:21:45,093 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-24 10:21:45,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-24 10:21:45,115 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-08-24 10:21:45,115 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 10:21:45,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:21:45,294 WARN L619 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2023-08-24 10:21:45,295 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-08-24 10:21:45,296 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-08-24 10:21:45,296 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-08-24 10:21:45,296 INFO L445 BasicCegarLoop]: Path program histogram: [15, 3, 1, 1] [2023-08-24 10:21:45,299 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 10:21:45,299 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 10:21:45,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 10:21:45 BasicIcfg [2023-08-24 10:21:45,301 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 10:21:45,301 INFO L158 Benchmark]: Toolchain (without parser) took 787800.38ms. Allocated memory was 394.3MB in the beginning and 13.3GB in the end (delta: 12.9GB). Free memory was 370.7MB in the beginning and 6.1GB in the end (delta: -5.7GB). Peak memory consumption was 7.2GB. Max. memory is 16.0GB. [2023-08-24 10:21:45,301 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 394.3MB. Free memory was 372.2MB in the beginning and 372.0MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 10:21:45,301 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.72ms. Allocated memory is still 394.3MB. Free memory was 369.9MB in the beginning and 358.3MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-24 10:21:45,302 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.40ms. Allocated memory is still 394.3MB. Free memory was 358.3MB in the beginning and 356.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 10:21:45,302 INFO L158 Benchmark]: Boogie Preprocessor took 38.87ms. Allocated memory is still 394.3MB. Free memory was 356.3MB in the beginning and 355.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 10:21:45,302 INFO L158 Benchmark]: RCFGBuilder took 523.30ms. Allocated memory is still 394.3MB. Free memory was 355.0MB in the beginning and 332.4MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 10:21:45,302 INFO L158 Benchmark]: TraceAbstraction took 786882.89ms. Allocated memory was 394.3MB in the beginning and 13.3GB in the end (delta: 12.9GB). Free memory was 331.9MB in the beginning and 6.1GB in the end (delta: -5.7GB). Peak memory consumption was 7.2GB. Max. memory is 16.0GB. [2023-08-24 10:21:45,303 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.14ms. Allocated memory is still 394.3MB. Free memory was 372.2MB in the beginning and 372.0MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 283.72ms. Allocated memory is still 394.3MB. Free memory was 369.9MB in the beginning and 358.3MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 54.40ms. Allocated memory is still 394.3MB. Free memory was 358.3MB in the beginning and 356.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 38.87ms. Allocated memory is still 394.3MB. Free memory was 356.3MB in the beginning and 355.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 523.30ms. Allocated memory is still 394.3MB. Free memory was 355.0MB in the beginning and 332.4MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * TraceAbstraction took 786882.89ms. Allocated memory was 394.3MB in the beginning and 13.3GB in the end (delta: 12.9GB). Free memory was 331.9MB in the beginning and 6.1GB in the end (delta: -5.7GB). Peak memory consumption was 7.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 123 PlacesBefore, 31 PlacesAfterwards, 123 TransitionsBefore, 24 TransitionsAfterwards, 1262 CoEnabledTransitionPairs, 7 FixpointIterations, 62 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 8 TrivialYvCompositions, 7 ConcurrentYvCompositions, 7 ChoiceCompositions, 112 TotalNumberOfCompositions, 2063 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1580, independent: 1522, independent conditional: 0, independent unconditional: 1522, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 701, independent: 679, independent conditional: 0, independent unconditional: 679, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1580, independent: 843, independent conditional: 0, independent unconditional: 843, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 701, unknown conditional: 0, unknown unconditional: 701] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 117]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 111]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 158 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: 786.8s, OverallIterations: 20, TraceHistogramMax: 3, PathProgramHistogramMax: 15, EmptinessCheckTime: 0.0s, AutomataDifference: 730.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 331 mSolverCounterUnknown, 7890 SdHoareTripleChecker+Valid, 17.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7890 mSDsluCounter, 220 SdHoareTripleChecker+Invalid, 15.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 11594 IncrementalHoareTripleChecker+Unchecked, 216 mSDsCounter, 788 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20029 IncrementalHoareTripleChecker+Invalid, 32742 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 788 mSolverCounterUnsat, 4 mSDtfsCounter, 20029 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1755 GetRequests, 492 SyntacticMatches, 68 SemanticMatches, 1195 ConstructedPredicates, 38 IntricatePredicates, 0 DeprecatedPredicates, 39965 ImplicationChecksByTransitivity, 145.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96492occurred in iteration=19, InterpolantAutomatonStates: 863, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 46.9s InterpolantComputationTime, 906 NumberOfCodeBlocks, 906 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 1247 ConstructedInterpolants, 53 QuantifiedInterpolants, 27962 SizeOfPredicates, 346 NumberOfNonLiveVariables, 3422 ConjunctsInSsa, 554 ConjunctsInUnsatCore, 48 InterpolantComputations, 6 PerfectInterpolantSequences, 130/410 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