/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 PROGRAM_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 16:21:46,622 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 16:21:46,697 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 16:21:46,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 16:21:46,702 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 16:21:46,730 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 16:21:46,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 16:21:46,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 16:21:46,732 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 16:21:46,735 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 16:21:46,735 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 16:21:46,736 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 16:21:46,736 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 16:21:46,736 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 16:21:46,736 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 16:21:46,737 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 16:21:46,737 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 16:21:46,737 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 16:21:46,737 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 16:21:46,737 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 16:21:46,738 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 16:21:46,738 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 16:21:46,739 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 16:21:46,739 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 16:21:46,739 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 16:21:46,739 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 16:21:46,740 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 16:21:46,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 16:21:46,740 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 16:21:46,740 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 16:21:46,741 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 16:21:46,741 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 16:21:46,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 16:21:46,742 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 16:21:46,742 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 16:21:46,742 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 -> PROGRAM_FIRST [2023-08-24 16:21:47,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 16:21:47,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 16:21:47,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 16:21:47,047 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 16:21:47,047 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 16:21:47,048 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 16:21:48,225 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 16:21:48,449 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 16:21:48,449 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2023-08-24 16:21:48,456 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f57db8924/837d9c0991ea43249e7a1b9ef3e08846/FLAGfa6ce4aa9 [2023-08-24 16:21:48,467 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f57db8924/837d9c0991ea43249e7a1b9ef3e08846 [2023-08-24 16:21:48,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 16:21:48,470 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 16:21:48,471 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 16:21:48,472 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 16:21:48,474 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 16:21:48,474 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 04:21:48" (1/1) ... [2023-08-24 16:21:48,475 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12ec2634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:21:48, skipping insertion in model container [2023-08-24 16:21:48,475 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 04:21:48" (1/1) ... [2023-08-24 16:21:48,496 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 16:21:48,663 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 16:21:48,672 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 16:21:48,682 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 16:21:48,715 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 16:21:48,718 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 16:21:48,727 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 16:21:48,727 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 16:21:48,733 INFO L206 MainTranslator]: Completed translation [2023-08-24 16:21:48,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:21:48 WrapperNode [2023-08-24 16:21:48,733 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 16:21:48,735 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 16:21:48,735 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 16:21:48,735 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 16:21:48,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:21:48" (1/1) ... [2023-08-24 16:21:48,758 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:21:48" (1/1) ... [2023-08-24 16:21:48,787 INFO L138 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 165 [2023-08-24 16:21:48,788 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 16:21:48,789 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 16:21:48,789 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 16:21:48,789 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 16:21:48,796 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:21:48" (1/1) ... [2023-08-24 16:21:48,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:21:48" (1/1) ... [2023-08-24 16:21:48,813 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:21:48" (1/1) ... [2023-08-24 16:21:48,813 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:21:48" (1/1) ... [2023-08-24 16:21:48,824 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:21:48" (1/1) ... [2023-08-24 16:21:48,833 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:21:48" (1/1) ... [2023-08-24 16:21:48,834 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:21:48" (1/1) ... [2023-08-24 16:21:48,835 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:21:48" (1/1) ... [2023-08-24 16:21:48,836 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 16:21:48,837 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 16:21:48,837 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 16:21:48,837 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 16:21:48,838 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:21:48" (1/1) ... [2023-08-24 16:21:48,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 16:21:48,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 16:21:48,872 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 16:21:48,900 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 16:21:48,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 16:21:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 16:21:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 16:21:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 16:21:48,914 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 16:21:48,914 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 16:21:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 16:21:48,915 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 16:21:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-24 16:21:48,915 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-24 16:21:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 16:21:48,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 16:21:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 16:21:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-24 16:21:48,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 16:21:48,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 16:21:48,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 16:21:48,918 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 16:21:48,999 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 16:21:49,001 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 16:21:49,280 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 16:21:49,368 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 16:21:49,368 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-24 16:21:49,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 04:21:49 BoogieIcfgContainer [2023-08-24 16:21:49,376 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 16:21:49,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 16:21:49,378 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 16:21:49,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 16:21:49,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 04:21:48" (1/3) ... [2023-08-24 16:21:49,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d3a1a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 04:21:49, skipping insertion in model container [2023-08-24 16:21:49,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:21:48" (2/3) ... [2023-08-24 16:21:49,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d3a1a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 04:21:49, skipping insertion in model container [2023-08-24 16:21:49,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 04:21:49" (3/3) ... [2023-08-24 16:21:49,384 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2023-08-24 16:21:49,398 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 16:21:49,399 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 16:21:49,399 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 16:21:49,467 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-24 16:21:49,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 136 transitions, 296 flow [2023-08-24 16:21:49,545 INFO L124 PetriNetUnfolderBase]: 10/133 cut-off events. [2023-08-24 16:21:49,545 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 16:21:49,550 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 16:21:49,550 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 136 transitions, 296 flow [2023-08-24 16:21:49,554 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 123 transitions, 264 flow [2023-08-24 16:21:49,557 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 16:21:49,568 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 123 transitions, 264 flow [2023-08-24 16:21:49,587 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 123 transitions, 264 flow [2023-08-24 16:21:49,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 123 transitions, 264 flow [2023-08-24 16:21:49,625 INFO L124 PetriNetUnfolderBase]: 10/123 cut-off events. [2023-08-24 16:21:49,625 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 16:21:49,626 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 16:21:49,627 INFO L119 LiptonReduction]: Number of co-enabled transitions 1262 [2023-08-24 16:21:53,505 INFO L134 LiptonReduction]: Checked pairs total: 2063 [2023-08-24 16:21:53,505 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-08-24 16:21:53,516 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 16:21:53,522 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;@4af2aeda, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 16:21:53,522 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-24 16:21:53,529 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 16:21:53,530 INFO L124 PetriNetUnfolderBase]: 3/23 cut-off events. [2023-08-24 16:21:53,530 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 16:21:53,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:21:53,530 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 16:21:53,531 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 16:21:53,535 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:21:53,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1116037830, now seen corresponding path program 1 times [2023-08-24 16:21:53,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:21:53,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288642499] [2023-08-24 16:21:53,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:21:53,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:21:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:21:53,927 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 16:21:53,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:21:53,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288642499] [2023-08-24 16:21:53,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288642499] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 16:21:53,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 16:21:53,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 16:21:53,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162950185] [2023-08-24 16:21:53,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 16:21:53,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 16:21:53,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:21:53,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 16:21:53,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 16:21:53,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 248 [2023-08-24 16:21:53,960 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 16:21:53,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:21:53,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 248 [2023-08-24 16:21:53,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:21:54,147 INFO L124 PetriNetUnfolderBase]: 214/342 cut-off events. [2023-08-24 16:21:54,147 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-08-24 16:21:54,148 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 16:21:54,151 INFO L140 encePairwiseOnDemand]: 243/248 looper letters, 48 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2023-08-24 16:21:54,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 53 transitions, 242 flow [2023-08-24 16:21:54,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 16:21:54,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 16:21:54,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2023-08-24 16:21:54,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49193548387096775 [2023-08-24 16:21:54,173 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 610 transitions. [2023-08-24 16:21:54,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 610 transitions. [2023-08-24 16:21:54,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:21:54,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 610 transitions. [2023-08-24 16:21:54,183 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 16:21:54,189 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 16:21:54,190 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 16:21:54,192 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 66 flow. Second operand 5 states and 610 transitions. [2023-08-24 16:21:54,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 53 transitions, 242 flow [2023-08-24 16:21:54,195 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 16:21:54,196 INFO L231 Difference]: Finished difference. Result has 31 places, 27 transitions, 82 flow [2023-08-24 16:21:54,198 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 16:21:54,200 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2023-08-24 16:21:54,201 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 27 transitions, 82 flow [2023-08-24 16:21:54,201 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 16:21:54,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:21:54,202 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 16:21:54,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 16:21:54,202 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 16:21:54,203 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:21:54,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1567348952, now seen corresponding path program 2 times [2023-08-24 16:21:54,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:21:54,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362198720] [2023-08-24 16:21:54,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:21:54,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:21:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:21:54,362 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 16:21:54,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:21:54,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362198720] [2023-08-24 16:21:54,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362198720] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 16:21:54,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 16:21:54,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 16:21:54,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721222588] [2023-08-24 16:21:54,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 16:21:54,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 16:21:54,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:21:54,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 16:21:54,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 16:21:54,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 248 [2023-08-24 16:21:54,368 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 16:21:54,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:21:54,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 248 [2023-08-24 16:21:54,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:21:54,490 INFO L124 PetriNetUnfolderBase]: 209/341 cut-off events. [2023-08-24 16:21:54,490 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2023-08-24 16:21:54,493 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 16:21:54,496 INFO L140 encePairwiseOnDemand]: 243/248 looper letters, 44 selfloop transitions, 7 changer transitions 0/51 dead transitions. [2023-08-24 16:21:54,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 51 transitions, 258 flow [2023-08-24 16:21:54,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 16:21:54,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 16:21:54,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2023-08-24 16:21:54,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4870967741935484 [2023-08-24 16:21:54,498 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 604 transitions. [2023-08-24 16:21:54,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 604 transitions. [2023-08-24 16:21:54,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:21:54,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 604 transitions. [2023-08-24 16:21:54,500 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 16:21:54,531 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 16:21:54,531 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 16:21:54,532 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 82 flow. Second operand 5 states and 604 transitions. [2023-08-24 16:21:54,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 51 transitions, 258 flow [2023-08-24 16:21:54,535 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 16:21:54,536 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 123 flow [2023-08-24 16:21:54,536 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 16:21:54,537 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2023-08-24 16:21:54,538 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 123 flow [2023-08-24 16:21:54,541 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 16:21:54,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:21:54,546 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 16:21:54,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 16:21:54,546 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 16:21:54,549 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:21:54,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1909084888, now seen corresponding path program 3 times [2023-08-24 16:21:54,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:21:54,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954034298] [2023-08-24 16:21:54,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:21:54,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:21:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:21:54,729 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 16:21:54,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:21:54,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954034298] [2023-08-24 16:21:54,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954034298] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 16:21:54,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 16:21:54,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 16:21:54,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910637685] [2023-08-24 16:21:54,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 16:21:54,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 16:21:54,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:21:54,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 16:21:54,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 16:21:54,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 248 [2023-08-24 16:21:54,733 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 16:21:54,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:21:54,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 248 [2023-08-24 16:21:54,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:21:54,893 INFO L124 PetriNetUnfolderBase]: 328/534 cut-off events. [2023-08-24 16:21:54,893 INFO L125 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES. [2023-08-24 16:21:54,895 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 16:21:54,896 INFO L140 encePairwiseOnDemand]: 242/248 looper letters, 51 selfloop transitions, 6 changer transitions 15/72 dead transitions. [2023-08-24 16:21:54,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 72 transitions, 418 flow [2023-08-24 16:21:54,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 16:21:54,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 16:21:54,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 721 transitions. [2023-08-24 16:21:54,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845430107526882 [2023-08-24 16:21:54,899 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 721 transitions. [2023-08-24 16:21:54,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 721 transitions. [2023-08-24 16:21:54,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:21:54,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 721 transitions. [2023-08-24 16:21:54,901 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 16:21:54,904 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 16:21:54,904 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 16:21:54,904 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 123 flow. Second operand 6 states and 721 transitions. [2023-08-24 16:21:54,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 72 transitions, 418 flow [2023-08-24 16:21:54,906 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 16:21:54,908 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 128 flow [2023-08-24 16:21:54,908 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 16:21:54,908 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2023-08-24 16:21:54,909 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 128 flow [2023-08-24 16:21:54,909 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 16:21:54,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:21:54,909 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 16:21:54,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 16:21:54,910 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 16:21:54,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:21:54,910 INFO L85 PathProgramCache]: Analyzing trace with hash -957600211, now seen corresponding path program 1 times [2023-08-24 16:21:54,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:21:54,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947750567] [2023-08-24 16:21:54,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:21:54,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:21:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:21:55,006 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 16:21:55,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:21:55,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947750567] [2023-08-24 16:21:55,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947750567] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 16:21:55,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 16:21:55,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 16:21:55,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012062865] [2023-08-24 16:21:55,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 16:21:55,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 16:21:55,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:21:55,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 16:21:55,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 16:21:55,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 248 [2023-08-24 16:21:55,009 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 16:21:55,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:21:55,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 248 [2023-08-24 16:21:55,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:21:55,061 INFO L124 PetriNetUnfolderBase]: 80/163 cut-off events. [2023-08-24 16:21:55,061 INFO L125 PetriNetUnfolderBase]: For 349/375 co-relation queries the response was YES. [2023-08-24 16:21:55,062 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 16:21:55,063 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 24 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2023-08-24 16:21:55,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 175 flow [2023-08-24 16:21:55,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 16:21:55,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 16:21:55,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-08-24 16:21:55,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48655913978494625 [2023-08-24 16:21:55,064 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-08-24 16:21:55,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-08-24 16:21:55,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:21:55,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-08-24 16:21:55,066 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 16:21:55,067 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 16:21:55,068 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 16:21:55,068 INFO L175 Difference]: Start difference. First operand has 43 places, 29 transitions, 128 flow. Second operand 3 states and 362 transitions. [2023-08-24 16:21:55,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 175 flow [2023-08-24 16:21:55,069 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 16:21:55,070 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 104 flow [2023-08-24 16:21:55,070 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 16:21:55,071 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2023-08-24 16:21:55,071 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 104 flow [2023-08-24 16:21:55,071 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 16:21:55,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:21:55,071 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 16:21:55,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 16:21:55,072 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 16:21:55,072 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:21:55,072 INFO L85 PathProgramCache]: Analyzing trace with hash -2068012950, now seen corresponding path program 1 times [2023-08-24 16:21:55,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:21:55,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598960804] [2023-08-24 16:21:55,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:21:55,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:21:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:21:55,156 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 16:21:55,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:21:55,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598960804] [2023-08-24 16:21:55,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598960804] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 16:21:55,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 16:21:55,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 16:21:55,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276116199] [2023-08-24 16:21:55,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 16:21:55,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 16:21:55,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:21:55,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 16:21:55,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 16:21:55,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 248 [2023-08-24 16:21:55,159 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 16:21:55,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:21:55,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 248 [2023-08-24 16:21:55,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:21:55,222 INFO L124 PetriNetUnfolderBase]: 83/178 cut-off events. [2023-08-24 16:21:55,223 INFO L125 PetriNetUnfolderBase]: For 245/289 co-relation queries the response was YES. [2023-08-24 16:21:55,223 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 16:21:55,224 INFO L140 encePairwiseOnDemand]: 244/248 looper letters, 22 selfloop transitions, 2 changer transitions 8/37 dead transitions. [2023-08-24 16:21:55,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 37 transitions, 190 flow [2023-08-24 16:21:55,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 16:21:55,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 16:21:55,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 447 transitions. [2023-08-24 16:21:55,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45060483870967744 [2023-08-24 16:21:55,226 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 447 transitions. [2023-08-24 16:21:55,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 447 transitions. [2023-08-24 16:21:55,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:21:55,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 447 transitions. [2023-08-24 16:21:55,228 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 16:21:55,230 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 16:21:55,230 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 16:21:55,230 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 104 flow. Second operand 4 states and 447 transitions. [2023-08-24 16:21:55,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 37 transitions, 190 flow [2023-08-24 16:21:55,231 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 16:21:55,232 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 116 flow [2023-08-24 16:21:55,232 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 16:21:55,233 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2023-08-24 16:21:55,233 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 116 flow [2023-08-24 16:21:55,233 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 16:21:55,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:21:55,234 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 16:21:55,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 16:21:55,234 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 16:21:55,234 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:21:55,234 INFO L85 PathProgramCache]: Analyzing trace with hash 876728516, now seen corresponding path program 1 times [2023-08-24 16:21:55,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:21:55,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342838792] [2023-08-24 16:21:55,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:21:55,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:21:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:21:56,101 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 16:21:56,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:21:56,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342838792] [2023-08-24 16:21:56,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342838792] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 16:21:56,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503626632] [2023-08-24 16:21:56,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:21:56,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:21:56,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 16:21:56,106 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 16:21:56,132 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 16:21:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:21:56,226 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 47 conjunts are in the unsatisfiable core [2023-08-24 16:21:56,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 16:21:56,351 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 16:21:56,409 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 16:21:56,460 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 16:21:56,511 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 16:21:56,696 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 16:21:56,696 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 16:21:57,130 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 16:21:57,209 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 16:21:57,238 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:21:57,239 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 16:21:57,254 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:21:57,254 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 16:21:57,281 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:21:57,281 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 16:21:57,301 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:21:57,301 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 16:21:57,319 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:21:57,320 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 16:21:57,926 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:21:57,926 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 16:21:57,940 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 16:21:57,941 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 16:21:57,970 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 16:21:57,970 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 16:21:57,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 16:21:58,012 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 16:21:58,029 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 16:21:58,029 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 16:21:58,161 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-24 16:21:58,259 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 16:21:58,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503626632] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 16:21:58,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 16:21:58,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 28 [2023-08-24 16:21:58,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606905979] [2023-08-24 16:21:58,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 16:21:58,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-24 16:21:58,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:21:58,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-24 16:21:58,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=568, Unknown=3, NotChecked=102, Total=812 [2023-08-24 16:21:58,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 248 [2023-08-24 16:21:58,265 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 16:21:58,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:21:58,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 248 [2023-08-24 16:21:58,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:21:58,309 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 16:22:02,529 INFO L124 PetriNetUnfolderBase]: 1571/2606 cut-off events. [2023-08-24 16:22:02,529 INFO L125 PetriNetUnfolderBase]: For 2163/2163 co-relation queries the response was YES. [2023-08-24 16:22:02,534 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 16:22:02,542 INFO L140 encePairwiseOnDemand]: 234/248 looper letters, 245 selfloop transitions, 118 changer transitions 84/447 dead transitions. [2023-08-24 16:22:02,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 447 transitions, 2584 flow [2023-08-24 16:22:02,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-08-24 16:22:02,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2023-08-24 16:22:02,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 4702 transitions. [2023-08-24 16:22:02,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27477793361383823 [2023-08-24 16:22:02,557 INFO L72 ComplementDD]: Start complementDD. Operand 69 states and 4702 transitions. [2023-08-24 16:22:02,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 4702 transitions. [2023-08-24 16:22:02,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:22:02,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 69 states and 4702 transitions. [2023-08-24 16:22:02,568 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 16:22:02,587 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 16:22:02,590 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 16:22:02,590 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 116 flow. Second operand 69 states and 4702 transitions. [2023-08-24 16:22:02,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 447 transitions, 2584 flow [2023-08-24 16:22:02,595 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 16:22:02,600 INFO L231 Difference]: Finished difference. Result has 137 places, 169 transitions, 1215 flow [2023-08-24 16:22:02,601 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 16:22:02,603 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 106 predicate places. [2023-08-24 16:22:02,603 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 169 transitions, 1215 flow [2023-08-24 16:22:02,605 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 16:22:02,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:22:02,605 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 16:22:02,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-24 16:22:02,809 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 16:22:02,810 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 16:22:02,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:22:02,810 INFO L85 PathProgramCache]: Analyzing trace with hash -19731206, now seen corresponding path program 2 times [2023-08-24 16:22:02,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:22:02,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114483400] [2023-08-24 16:22:02,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:22:02,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:22:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:22:03,989 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 16:22:03,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:22:03,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114483400] [2023-08-24 16:22:03,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114483400] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 16:22:03,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589613319] [2023-08-24 16:22:03,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 16:22:03,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:22:03,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 16:22:03,991 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 16:22:03,992 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 16:22:04,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 16:22:04,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 16:22:04,075 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 44 conjunts are in the unsatisfiable core [2023-08-24 16:22:04,078 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 16:22:04,150 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 16:22:04,198 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 16:22:04,249 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 16:22:04,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 16:22:04,389 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 16:22:04,494 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 16:22:04,495 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 16:22:04,985 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 16:22:05,174 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:22:05,174 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 16:22:05,185 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:22:05,186 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 16:22:05,197 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 16:22:05,214 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:22:05,214 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 16:22:05,227 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:22:05,227 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 16:22:05,479 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:22:05,479 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 16:22:05,482 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 16:22:05,489 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 16:22:05,489 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 16:22:05,501 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 16:22:05,502 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 16:22:05,513 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 16:22:05,514 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 16:22:05,554 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-24 16:22:05,625 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 16:22:05,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589613319] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 16:22:05,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 16:22:05,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 31 [2023-08-24 16:22:05,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125362044] [2023-08-24 16:22:05,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 16:22:05,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-24 16:22:05,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:22:05,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-24 16:22:05,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=788, Unknown=9, NotChecked=58, Total=992 [2023-08-24 16:22:05,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 248 [2023-08-24 16:22:05,632 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 16:22:05,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:22:05,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 248 [2023-08-24 16:22:05,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:22:06,095 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 16:22:06,124 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 16:22:06,298 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 16:22:13,254 INFO L124 PetriNetUnfolderBase]: 1572/2591 cut-off events. [2023-08-24 16:22:13,254 INFO L125 PetriNetUnfolderBase]: For 30821/30821 co-relation queries the response was YES. [2023-08-24 16:22:13,263 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 16:22:13,272 INFO L140 encePairwiseOnDemand]: 232/248 looper letters, 233 selfloop transitions, 139 changer transitions 94/466 dead transitions. [2023-08-24 16:22:13,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 466 transitions, 4161 flow [2023-08-24 16:22:13,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-08-24 16:22:13,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2023-08-24 16:22:13,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 3652 transitions. [2023-08-24 16:22:13,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.272700119474313 [2023-08-24 16:22:13,287 INFO L72 ComplementDD]: Start complementDD. Operand 54 states and 3652 transitions. [2023-08-24 16:22:13,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 3652 transitions. [2023-08-24 16:22:13,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:22:13,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 54 states and 3652 transitions. [2023-08-24 16:22:13,295 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 16:22:13,310 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 16:22:13,312 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 16:22:13,312 INFO L175 Difference]: Start difference. First operand has 137 places, 169 transitions, 1215 flow. Second operand 54 states and 3652 transitions. [2023-08-24 16:22:13,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 466 transitions, 4161 flow [2023-08-24 16:22:13,361 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 16:22:13,367 INFO L231 Difference]: Finished difference. Result has 180 places, 218 transitions, 1864 flow [2023-08-24 16:22:13,367 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 16:22:13,368 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 149 predicate places. [2023-08-24 16:22:13,368 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 218 transitions, 1864 flow [2023-08-24 16:22:13,369 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 16:22:13,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:22:13,369 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 16:22:13,375 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 16:22:13,575 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 16:22:13,575 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 16:22:13,576 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:22:13,576 INFO L85 PathProgramCache]: Analyzing trace with hash 458145310, now seen corresponding path program 3 times [2023-08-24 16:22:13,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:22:13,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756119886] [2023-08-24 16:22:13,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:22:13,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:22:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:22:14,476 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 16:22:14,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:22:14,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756119886] [2023-08-24 16:22:14,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756119886] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 16:22:14,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891639296] [2023-08-24 16:22:14,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 16:22:14,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:22:14,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 16:22:14,481 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 16:22:14,536 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 16:22:14,617 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 16:22:14,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 16:22:14,619 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-24 16:22:14,620 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 16:22:14,809 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 16:22:14,810 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 16:22:14,922 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:22:14,922 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 16:22:15,150 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 16:22:15,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891639296] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 16:22:15,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 16:22:15,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 22 [2023-08-24 16:22:15,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380139507] [2023-08-24 16:22:15,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 16:22:15,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-24 16:22:15,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:22:15,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-24 16:22:15,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2023-08-24 16:22:15,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 248 [2023-08-24 16:22:15,155 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 16:22:15,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:22:15,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 248 [2023-08-24 16:22:15,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:22:16,478 INFO L124 PetriNetUnfolderBase]: 1490/2473 cut-off events. [2023-08-24 16:22:16,478 INFO L125 PetriNetUnfolderBase]: For 15876/15876 co-relation queries the response was YES. [2023-08-24 16:22:16,491 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 16:22:16,504 INFO L140 encePairwiseOnDemand]: 235/248 looper letters, 215 selfloop transitions, 183 changer transitions 24/422 dead transitions. [2023-08-24 16:22:16,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 422 transitions, 4489 flow [2023-08-24 16:22:16,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-08-24 16:22:16,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-08-24 16:22:16,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 2245 transitions. [2023-08-24 16:22:16,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3121523915461624 [2023-08-24 16:22:16,508 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 2245 transitions. [2023-08-24 16:22:16,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 2245 transitions. [2023-08-24 16:22:16,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:22:16,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 2245 transitions. [2023-08-24 16:22:16,514 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 16:22:16,521 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 16:22:16,523 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 16:22:16,523 INFO L175 Difference]: Start difference. First operand has 180 places, 218 transitions, 1864 flow. Second operand 29 states and 2245 transitions. [2023-08-24 16:22:16,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 422 transitions, 4489 flow [2023-08-24 16:22:16,630 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 16:22:16,638 INFO L231 Difference]: Finished difference. Result has 187 places, 288 transitions, 2787 flow [2023-08-24 16:22:16,639 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 16:22:16,642 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 156 predicate places. [2023-08-24 16:22:16,642 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 288 transitions, 2787 flow [2023-08-24 16:22:16,643 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 16:22:16,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:22:16,643 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 16:22:16,651 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 16:22:16,848 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 16:22:16,848 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 16:22:16,849 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:22:16,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1536834318, now seen corresponding path program 4 times [2023-08-24 16:22:16,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:22:16,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876335397] [2023-08-24 16:22:16,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:22:16,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:22:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:22:17,611 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 16:22:17,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:22:17,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876335397] [2023-08-24 16:22:17,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876335397] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 16:22:17,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692818194] [2023-08-24 16:22:17,612 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 16:22:17,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:22:17,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 16:22:17,613 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 16:22:17,636 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 16:22:17,712 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 16:22:17,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 16:22:17,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 32 conjunts are in the unsatisfiable core [2023-08-24 16:22:17,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 16:22:17,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 16:22:17,882 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 16:22:17,949 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 16:22:17,950 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 16:22:18,061 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 16:22:18,090 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:22:18,091 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 16:22:18,095 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 16:22:18,099 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 16:22:18,319 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 16:22:18,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692818194] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 16:22:18,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 16:22:18,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 25 [2023-08-24 16:22:18,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592223350] [2023-08-24 16:22:18,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 16:22:18,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-24 16:22:18,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:22:18,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-24 16:22:18,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=516, Unknown=1, NotChecked=46, Total=650 [2023-08-24 16:22:18,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 248 [2023-08-24 16:22:18,332 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 16:22:18,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:22:18,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 248 [2023-08-24 16:22:18,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:22:19,809 INFO L124 PetriNetUnfolderBase]: 1560/2585 cut-off events. [2023-08-24 16:22:19,809 INFO L125 PetriNetUnfolderBase]: For 18349/18349 co-relation queries the response was YES. [2023-08-24 16:22:19,822 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 16:22:19,834 INFO L140 encePairwiseOnDemand]: 236/248 looper letters, 230 selfloop transitions, 176 changer transitions 36/442 dead transitions. [2023-08-24 16:22:19,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 442 transitions, 5037 flow [2023-08-24 16:22:19,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-24 16:22:19,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-24 16:22:19,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1916 transitions. [2023-08-24 16:22:19,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29714640198511166 [2023-08-24 16:22:19,839 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 1916 transitions. [2023-08-24 16:22:19,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 1916 transitions. [2023-08-24 16:22:19,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:22:19,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1916 transitions. [2023-08-24 16:22:19,843 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 16:22:19,849 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 16:22:19,849 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 16:22:19,850 INFO L175 Difference]: Start difference. First operand has 187 places, 288 transitions, 2787 flow. Second operand 26 states and 1916 transitions. [2023-08-24 16:22:19,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 442 transitions, 5037 flow [2023-08-24 16:22:19,925 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 16:22:19,931 INFO L231 Difference]: Finished difference. Result has 209 places, 303 transitions, 3196 flow [2023-08-24 16:22:19,931 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 16:22:19,932 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 178 predicate places. [2023-08-24 16:22:19,932 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 303 transitions, 3196 flow [2023-08-24 16:22:19,933 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 16:22:19,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:22:19,933 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 16:22:19,941 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 16:22:20,138 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 16:22:20,138 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 16:22:20,139 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:22:20,139 INFO L85 PathProgramCache]: Analyzing trace with hash 238598793, now seen corresponding path program 5 times [2023-08-24 16:22:20,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:22:20,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842503138] [2023-08-24 16:22:20,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:22:20,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:22:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:22:20,295 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 16:22:20,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:22:20,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842503138] [2023-08-24 16:22:20,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842503138] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 16:22:20,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320834781] [2023-08-24 16:22:20,296 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 16:22:20,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:22:20,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 16:22:20,297 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 16:22:20,300 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 16:22:20,387 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-08-24 16:22:20,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 16:22:20,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-24 16:22:20,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 16:22:20,478 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 16:22:20,478 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 16:22:20,544 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 16:22:20,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320834781] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 16:22:20,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 16:22:20,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2023-08-24 16:22:20,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991758291] [2023-08-24 16:22:20,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 16:22:20,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-24 16:22:20,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:22:20,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-24 16:22:20,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-08-24 16:22:20,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 248 [2023-08-24 16:22:20,548 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 16:22:20,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:22:20,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 248 [2023-08-24 16:22:20,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:22:20,953 INFO L124 PetriNetUnfolderBase]: 563/1117 cut-off events. [2023-08-24 16:22:20,953 INFO L125 PetriNetUnfolderBase]: For 13657/13721 co-relation queries the response was YES. [2023-08-24 16:22:20,960 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 16:22:20,973 INFO L140 encePairwiseOnDemand]: 243/248 looper letters, 98 selfloop transitions, 22 changer transitions 49/223 dead transitions. [2023-08-24 16:22:20,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 223 transitions, 2674 flow [2023-08-24 16:22:20,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 16:22:20,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 16:22:20,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 846 transitions. [2023-08-24 16:22:20,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4264112903225806 [2023-08-24 16:22:20,975 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 846 transitions. [2023-08-24 16:22:20,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 846 transitions. [2023-08-24 16:22:20,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:22:20,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 846 transitions. [2023-08-24 16:22:20,977 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 16:22:20,979 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 16:22:20,979 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 16:22:20,979 INFO L175 Difference]: Start difference. First operand has 209 places, 303 transitions, 3196 flow. Second operand 8 states and 846 transitions. [2023-08-24 16:22:20,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 223 transitions, 2674 flow [2023-08-24 16:22:21,031 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 16:22:21,035 INFO L231 Difference]: Finished difference. Result has 165 places, 171 transitions, 1687 flow [2023-08-24 16:22:21,035 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 16:22:21,036 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 134 predicate places. [2023-08-24 16:22:21,036 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 171 transitions, 1687 flow [2023-08-24 16:22:21,036 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 16:22:21,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:22:21,037 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 16:22:21,049 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 16:22:21,242 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 16:22:21,243 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 16:22:21,243 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:22:21,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1886288447, now seen corresponding path program 6 times [2023-08-24 16:22:21,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:22:21,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492575224] [2023-08-24 16:22:21,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:22:21,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:22:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:22:21,350 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 16:22:21,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:22:21,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492575224] [2023-08-24 16:22:21,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492575224] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 16:22:21,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 16:22:21,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 16:22:21,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458446460] [2023-08-24 16:22:21,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 16:22:21,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 16:22:21,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:22:21,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 16:22:21,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 16:22:21,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 248 [2023-08-24 16:22:21,353 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 16:22:21,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:22:21,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 248 [2023-08-24 16:22:21,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:22:21,634 INFO L124 PetriNetUnfolderBase]: 949/1822 cut-off events. [2023-08-24 16:22:21,634 INFO L125 PetriNetUnfolderBase]: For 12020/12088 co-relation queries the response was YES. [2023-08-24 16:22:21,644 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 16:22:21,652 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 140 selfloop transitions, 67 changer transitions 1/262 dead transitions. [2023-08-24 16:22:21,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 262 transitions, 2975 flow [2023-08-24 16:22:21,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 16:22:21,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 16:22:21,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 509 transitions. [2023-08-24 16:22:21,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5131048387096774 [2023-08-24 16:22:21,654 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 509 transitions. [2023-08-24 16:22:21,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 509 transitions. [2023-08-24 16:22:21,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:22:21,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 509 transitions. [2023-08-24 16:22:21,655 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 16:22:21,656 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 16:22:21,656 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 16:22:21,656 INFO L175 Difference]: Start difference. First operand has 165 places, 171 transitions, 1687 flow. Second operand 4 states and 509 transitions. [2023-08-24 16:22:21,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 262 transitions, 2975 flow [2023-08-24 16:22:21,685 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 16:22:21,689 INFO L231 Difference]: Finished difference. Result has 127 places, 218 transitions, 2315 flow [2023-08-24 16:22:21,689 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 16:22:21,689 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 96 predicate places. [2023-08-24 16:22:21,689 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 218 transitions, 2315 flow [2023-08-24 16:22:21,690 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 16:22:21,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:22:21,690 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 16:22:21,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 16:22:21,690 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 16:22:21,691 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:22:21,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1530240330, now seen corresponding path program 7 times [2023-08-24 16:22:21,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:22:21,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185760076] [2023-08-24 16:22:21,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:22:21,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:22:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:22:22,714 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 16:22:22,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:22:22,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185760076] [2023-08-24 16:22:22,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185760076] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 16:22:22,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421592881] [2023-08-24 16:22:22,714 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-24 16:22:22,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:22:22,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 16:22:22,717 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 16:22:22,742 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 16:22:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:22:22,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-24 16:22:22,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 16:22:23,228 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 16:22:23,228 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 16:22:23,605 INFO L322 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-08-24 16:22:23,605 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 16:22:24,460 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 16:22:24,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421592881] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 16:22:24,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 16:22:24,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 34 [2023-08-24 16:22:24,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599593409] [2023-08-24 16:22:24,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 16:22:24,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-24 16:22:24,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:22:24,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-24 16:22:24,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1000, Unknown=0, NotChecked=0, Total=1190 [2023-08-24 16:22:24,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 248 [2023-08-24 16:22:24,465 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 16:22:24,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:22:24,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 248 [2023-08-24 16:22:24,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:22:31,823 INFO L124 PetriNetUnfolderBase]: 6409/10849 cut-off events. [2023-08-24 16:22:31,823 INFO L125 PetriNetUnfolderBase]: For 61871/61871 co-relation queries the response was YES. [2023-08-24 16:22:31,864 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 16:22:31,902 INFO L140 encePairwiseOnDemand]: 235/248 looper letters, 552 selfloop transitions, 502 changer transitions 445/1499 dead transitions. [2023-08-24 16:22:31,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 1499 transitions, 17398 flow [2023-08-24 16:22:31,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2023-08-24 16:22:31,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2023-08-24 16:22:31,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 7012 transitions. [2023-08-24 16:22:31,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31768756795940556 [2023-08-24 16:22:31,911 INFO L72 ComplementDD]: Start complementDD. Operand 89 states and 7012 transitions. [2023-08-24 16:22:31,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 7012 transitions. [2023-08-24 16:22:31,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:22:31,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 89 states and 7012 transitions. [2023-08-24 16:22:31,923 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 16:22:31,939 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 16:22:31,940 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 16:22:31,941 INFO L175 Difference]: Start difference. First operand has 127 places, 218 transitions, 2315 flow. Second operand 89 states and 7012 transitions. [2023-08-24 16:22:31,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 1499 transitions, 17398 flow [2023-08-24 16:22:32,094 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 16:22:32,107 INFO L231 Difference]: Finished difference. Result has 266 places, 644 transitions, 9554 flow [2023-08-24 16:22:32,107 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 16:22:32,108 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 235 predicate places. [2023-08-24 16:22:32,108 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 644 transitions, 9554 flow [2023-08-24 16:22:32,108 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 16:22:32,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:22:32,109 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 16:22:32,113 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 16:22:32,309 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 16:22:32,309 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 16:22:32,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:22:32,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1405231144, now seen corresponding path program 8 times [2023-08-24 16:22:32,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:22:32,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882630453] [2023-08-24 16:22:32,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:22:32,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:22:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:22:33,624 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 16:22:33,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:22:33,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882630453] [2023-08-24 16:22:33,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882630453] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 16:22:33,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576690101] [2023-08-24 16:22:33,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 16:22:33,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:22:33,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 16:22:33,626 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 16:22:33,628 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 16:22:33,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 16:22:33,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 16:22:33,741 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-24 16:22:33,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 16:22:33,844 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 16:22:33,893 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 16:22:34,011 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 16:22:34,065 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 16:22:34,397 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 16:22:34,397 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 16:22:35,111 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 ((.cse6 (* c_~front~0 4)) (.cse7 (* c_~back~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse7 4)) (.cse4 (+ c_~queue~0.offset .cse7)) (.cse2 (+ c_~queue~0.offset .cse6)) (.cse3 (+ c_~queue~0.offset .cse6 4))) (and (forall ((v_ArrVal_464 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.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_464 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.base))) (or (not (= (+ (select .cse5 .cse1) 1) 0)) (not (= (select .cse5 .cse4) 1)) (<= 0 (+ c_~sum~0 (select .cse5 .cse2) (select .cse5 .cse3))))))))) (< .cse8 0) (< c_~back~0 0) (<= c_~n~0 .cse8))) is different from false [2023-08-24 16:22:35,384 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 16:22:35,415 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:22:35,415 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 16:22:35,451 INFO L322 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-24 16:22:35,451 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 16:22:35,478 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 16:22:35,494 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:22:35,494 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 16:22:35,543 INFO L322 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-24 16:22:35,543 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 16:22:35,584 INFO L322 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-24 16:22:35,585 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 16:22:37,304 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:22:37,304 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 16:22:37,325 INFO L322 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-24 16:22:37,326 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 16:22:37,362 INFO L322 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-24 16:22:37,362 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 16:22:37,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 16:22:37,378 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 16:22:37,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 16:22:37,379 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 16:22:37,406 INFO L322 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-24 16:22:37,406 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 16:22:37,618 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-24 16:22:37,795 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 16:22:37,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576690101] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 16:22:37,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 16:22:37,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 15] total 41 [2023-08-24 16:22:37,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827169831] [2023-08-24 16:22:37,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 16:22:37,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-08-24 16:22:37,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:22:37,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-08-24 16:22:37,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=1214, Unknown=8, NotChecked=154, Total=1722 [2023-08-24 16:22:37,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 248 [2023-08-24 16:22:37,828 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 16:22:37,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:22:37,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 248 [2023-08-24 16:22:37,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:22:37,941 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse25 (* c_~front~0 4)) (.cse24 (* c_~back~0 4))) (let ((.cse28 (+ c_~queue~0.offset .cse24 4)) (.cse30 (+ c_~queue~0.offset .cse25)) (.cse35 (select |c_#memory_int| c_~queue~0.base)) (.cse31 (+ c_~queue~0.offset .cse24))) (let ((.cse26 (+ c_~front~0 1)) (.cse29 (+ c_~queue~0.offset .cse25 4)) (.cse13 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse36 (select .cse35 .cse31)) (.cse34 (select .cse35 .cse30)) (.cse10 (select .cse35 .cse28))) (let ((.cse4 (not (= (+ .cse10 1) 0))) (.cse14 (<= c_~n~0 c_~front~0)) (.cse16 (let ((.cse37 (+ c_~sum~0 .cse34))) (and (<= .cse37 1) (<= 0 .cse37)))) (.cse17 (< c_~front~0 0)) (.cse9 (<= 0 c_~sum~0)) (.cse7 (not (= .cse36 1))) (.cse15 (<= c_~back~0 c_~front~0)) (.cse11 (not .cse13)) (.cse12 (not (= (+ .cse36 1) 0))) (.cse0 (let ((.cse33 (+ c_~sum~0 .cse34 (select .cse35 .cse29)))) (and (<= .cse33 1) (<= 0 .cse33)))) (.cse1 (= (mod c_~v_assert~0 256) 0)) (.cse2 (<= c_~n~0 c_~back~0)) (.cse3 (<= (+ c_~back~0 1) c_~front~0)) (.cse5 (< .cse26 0)) (.cse6 (< c_~back~0 0)) (.cse8 (<= c_~n~0 .cse26))) (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 .cse14 .cse15 .cse16 .cse17) (or .cse14 .cse15 .cse16 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) .cse17) (<= 1 c_~v_assert~0) .cse9 (or .cse0 .cse1 (and (or .cse15 .cse13 .cse7) (or .cse15 .cse11 .cse12)) .cse5 .cse8) (or .cse1 .cse2 .cse3 (let ((.cse19 (+ .cse24 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse20 (+ .cse25 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse21 (+ .cse25 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse22 (+ .cse24 |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 ((.cse18 (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 .cse18 .cse19) 1) 0)) (<= (+ c_~sum~0 (select .cse18 .cse20) (select .cse18 .cse21)) 1) (not (= (select .cse18 .cse22) 1))))) (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (let ((.cse23 (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 .cse23 .cse19) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse23 .cse20) (select .cse23 .cse21))) (not (= (select .cse23 .cse22) 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 .cse26) .cse1 .cse5 .cse8) (or .cse1 .cse2 .cse3 (and (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (let ((.cse27 (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 .cse27 .cse28)) 0)) (<= 0 (+ (select .cse27 .cse29) c_~sum~0 (select .cse27 .cse30))) (not (= (select .cse27 .cse31) 1))))) (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (let ((.cse32 (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 .cse32 .cse28)) 0)) (<= (+ (select .cse32 .cse29) c_~sum~0 (select .cse32 .cse30)) 1) (not (= (select .cse32 .cse31) 1)))))) .cse5 .cse6 .cse8)))))) is different from false [2023-08-24 16:22:38,459 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 .cse1 .cse2 .cse3 (and (= c_~back~0 c_~front~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) .cse4 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5) (or .cse0 .cse1 .cse2 (let ((.cse12 (* c_~front~0 4)) (.cse13 (* c_~back~0 4))) (let ((.cse7 (+ c_~queue~0.offset .cse13 4)) (.cse10 (+ c_~queue~0.offset .cse13)) (.cse8 (+ c_~queue~0.offset .cse12)) (.cse9 (+ c_~queue~0.offset .cse12 4))) (and (forall ((v_ArrVal_464 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.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_464 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.base))) (or (not (= (+ (select .cse11 .cse7) 1) 0)) (not (= (select .cse11 .cse10) 1)) (<= 0 (+ c_~sum~0 (select .cse11 .cse8) (select .cse11 .cse9))))))))) .cse3 .cse4 .cse5)))) is different from false [2023-08-24 16:22:46,248 INFO L124 PetriNetUnfolderBase]: 7121/12084 cut-off events. [2023-08-24 16:22:46,248 INFO L125 PetriNetUnfolderBase]: For 413616/413616 co-relation queries the response was YES. [2023-08-24 16:22:46,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94613 conditions, 12084 events. 7121/12084 cut-off events. For 413616/413616 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 83280 event pairs, 545 based on Foata normal form. 312/12396 useless extension candidates. Maximal degree in co-relation 94527. Up to 3049 conditions per place. [2023-08-24 16:22:46,387 INFO L140 encePairwiseOnDemand]: 233/248 looper letters, 752 selfloop transitions, 601 changer transitions 507/1860 dead transitions. [2023-08-24 16:22:46,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 1860 transitions, 29674 flow [2023-08-24 16:22:46,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2023-08-24 16:22:46,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2023-08-24 16:22:46,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 5894 transitions. [2023-08-24 16:22:46,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2763503375843961 [2023-08-24 16:22:46,402 INFO L72 ComplementDD]: Start complementDD. Operand 86 states and 5894 transitions. [2023-08-24 16:22:46,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 5894 transitions. [2023-08-24 16:22:46,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:22:46,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 86 states and 5894 transitions. [2023-08-24 16:22:46,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 87 states, 86 states have (on average 68.53488372093024) internal successors, (5894), 86 states have internal predecessors, (5894), 0 states have call successors, (0), 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 16:22:46,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 87 states, 87 states have (on average 248.0) internal successors, (21576), 87 states have internal predecessors, (21576), 0 states have call successors, (0), 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 16:22:46,434 INFO L81 ComplementDD]: Finished complementDD. Result has 87 states, 87 states have (on average 248.0) internal successors, (21576), 87 states have internal predecessors, (21576), 0 states have call successors, (0), 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 16:22:46,434 INFO L175 Difference]: Start difference. First operand has 266 places, 644 transitions, 9554 flow. Second operand 86 states and 5894 transitions. [2023-08-24 16:22:46,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 1860 transitions, 29674 flow [2023-08-24 16:22:49,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 1860 transitions, 24898 flow, removed 2199 selfloop flow, removed 27 redundant places. [2023-08-24 16:22:49,129 INFO L231 Difference]: Finished difference. Result has 355 places, 942 transitions, 15048 flow [2023-08-24 16:22:49,130 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=304, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=86, PETRI_FLOW=15048, PETRI_PLACES=355, PETRI_TRANSITIONS=942} [2023-08-24 16:22:49,130 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 324 predicate places. [2023-08-24 16:22:49,130 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 942 transitions, 15048 flow [2023-08-24 16:22:49,131 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 16:22:49,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:22:49,131 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 16:22:49,135 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 16:22:49,331 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 16:22:49,331 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 16:22:49,332 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:22:49,332 INFO L85 PathProgramCache]: Analyzing trace with hash -2126548424, now seen corresponding path program 9 times [2023-08-24 16:22:49,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:22:49,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361585734] [2023-08-24 16:22:49,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:22:49,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:22:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:22:50,697 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 16:22:50,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:22:50,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361585734] [2023-08-24 16:22:50,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361585734] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 16:22:50,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930979812] [2023-08-24 16:22:50,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 16:22:50,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:22:50,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 16:22:50,698 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 16:22:50,726 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 16:22:50,842 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-24 16:22:50,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 16:22:50,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-24 16:22:50,846 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 16:22:51,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 16:22:51,144 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 16:22:51,267 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 16:22:51,267 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 16:22:51,383 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 16:22:51,574 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ 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 ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_513 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~queue~0.base) .cse4)))) (forall ((v_ArrVal_513 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~queue~0.base) .cse4)) 1))))))) is different from false [2023-08-24 16:22:51,667 INFO L322 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-08-24 16:22:51,667 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 16:22:51,676 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 16:22:51,684 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 16:22:52,031 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2023-08-24 16:22:52,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930979812] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 16:22:52,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 16:22:52,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 33 [2023-08-24 16:22:52,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929492266] [2023-08-24 16:22:52,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 16:22:52,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-24 16:22:52,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:22:52,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-24 16:22:52,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=869, Unknown=6, NotChecked=122, Total=1122 [2023-08-24 16:22:52,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 248 [2023-08-24 16:22:52,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 942 transitions, 15048 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 16:22:52,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:22:52,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 248 [2023-08-24 16:22:52,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:22:56,117 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse4 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse3) (not (= (+ .cse4 1) 0))) (or .cse3 (not (= .cse4 1)))))) (.cse1 (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)))))) (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (or .cse0 .cse1 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (<= c_~v_assert~0 1) (<= |c_thread2Thread1of1ForFork0_~cond~1#1| 1) (or .cse0 (= (mod c_~v_assert~0 256) 0) .cse1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1))) is different from false [2023-08-24 16:22:56,202 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (.cse0 (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse5 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1)))))) (.cse1 (let ((.cse3 (+ 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) .cse3)))) (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) .cse3)) 1)))))) (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (or .cse0 .cse1 .cse2) (<= c_~sum~0 0) (<= c_~v_assert~0 1) (or .cse1 .cse2) (<= |c_thread2Thread1of1ForFork0_~cond~1#1| 1) (or .cse0 (= (mod c_~v_assert~0 256) 0) .cse1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0))) is different from false [2023-08-24 16:23:59,240 INFO L124 PetriNetUnfolderBase]: 13189/23044 cut-off events. [2023-08-24 16:23:59,241 INFO L125 PetriNetUnfolderBase]: For 613564/613564 co-relation queries the response was YES. [2023-08-24 16:23:59,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175736 conditions, 23044 events. 13189/23044 cut-off events. For 613564/613564 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 178235 event pairs, 439 based on Foata normal form. 1641/24685 useless extension candidates. Maximal degree in co-relation 175627. Up to 5025 conditions per place. [2023-08-24 16:23:59,598 INFO L140 encePairwiseOnDemand]: 231/248 looper letters, 1024 selfloop transitions, 1240 changer transitions 1177/3441 dead transitions. [2023-08-24 16:23:59,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 3441 transitions, 54809 flow [2023-08-24 16:23:59,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2023-08-24 16:23:59,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2023-08-24 16:23:59,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 10144 transitions. [2023-08-24 16:23:59,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2763731473408893 [2023-08-24 16:23:59,613 INFO L72 ComplementDD]: Start complementDD. Operand 148 states and 10144 transitions. [2023-08-24 16:23:59,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 10144 transitions. [2023-08-24 16:23:59,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:23:59,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 148 states and 10144 transitions. [2023-08-24 16:23:59,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 149 states, 148 states have (on average 68.54054054054055) internal successors, (10144), 148 states have internal predecessors, (10144), 0 states have call successors, (0), 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 16:23:59,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 149 states, 149 states have (on average 248.0) internal successors, (36952), 149 states have internal predecessors, (36952), 0 states have call successors, (0), 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 16:23:59,663 INFO L81 ComplementDD]: Finished complementDD. Result has 149 states, 149 states have (on average 248.0) internal successors, (36952), 149 states have internal predecessors, (36952), 0 states have call successors, (0), 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 16:23:59,663 INFO L175 Difference]: Start difference. First operand has 355 places, 942 transitions, 15048 flow. Second operand 148 states and 10144 transitions. [2023-08-24 16:23:59,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 3441 transitions, 54809 flow [2023-08-24 16:24:06,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 3441 transitions, 49323 flow, removed 2406 selfloop flow, removed 41 redundant places. [2023-08-24 16:24:06,834 INFO L231 Difference]: Finished difference. Result has 520 places, 1655 transitions, 28523 flow [2023-08-24 16:24:06,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=9598, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=704, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=441, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=148, PETRI_FLOW=28523, PETRI_PLACES=520, PETRI_TRANSITIONS=1655} [2023-08-24 16:24:06,835 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 489 predicate places. [2023-08-24 16:24:06,835 INFO L495 AbstractCegarLoop]: Abstraction has has 520 places, 1655 transitions, 28523 flow [2023-08-24 16:24:06,836 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 16:24:06,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:24:06,836 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 16:24:06,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-24 16:24:07,038 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 16:24:07,041 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 16:24:07,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:24:07,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1840003540, now seen corresponding path program 10 times [2023-08-24 16:24:07,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:24:07,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867729783] [2023-08-24 16:24:07,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:24:07,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:24:07,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:24:08,535 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 16:24:08,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:24:08,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867729783] [2023-08-24 16:24:08,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867729783] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 16:24:08,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914256932] [2023-08-24 16:24:08,536 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 16:24:08,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:24:08,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 16:24:08,537 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 16:24:08,541 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 16:24:08,642 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 16:24:08,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 16:24:08,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-24 16:24:08,646 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 16:24:08,760 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 16:24:08,812 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 16:24:08,905 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 16:24:09,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 16:24:09,062 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 16:24:09,316 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 16:24:09,316 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 16:24:09,724 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 16:24:10,454 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 16:24:10,538 WARN L839 $PredicateComparison]: unable to prove that (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))) is different from false [2023-08-24 16:24:10,564 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:24:10,564 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 16:24:10,601 INFO L322 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-24 16:24:10,601 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 16:24:10,640 INFO L322 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-24 16:24:10,640 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 16:24:10,652 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 16:24:10,658 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:24:10,659 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 16:24:10,696 INFO L322 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-24 16:24:10,696 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 16:24:12,164 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:24:12,164 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 16:24:12,169 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 16:24:12,187 INFO L322 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-24 16:24:12,187 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 16:24:12,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 16:24:12,203 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 16:24:12,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 16:24:12,205 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 16:24:12,225 INFO L322 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-24 16:24:12,225 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 16:24:12,488 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-24 16:24:12,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914256932] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 16:24:12,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 16:24:12,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 40 [2023-08-24 16:24:12,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364434667] [2023-08-24 16:24:12,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 16:24:12,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-08-24 16:24:12,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:24:12,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-08-24 16:24:12,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1162, Unknown=13, NotChecked=222, Total=1640 [2023-08-24 16:24:12,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 248 [2023-08-24 16:24:12,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 1655 transitions, 28523 flow. Second operand has 41 states, 41 states have (on average 65.70731707317073) internal successors, (2694), 41 states have internal predecessors, (2694), 0 states have call successors, (0), 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 16:24:12,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:24:12,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 248 [2023-08-24 16:24:12,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:24:28,996 WARN L234 SmtUtils]: Spent 16.46s on a formula simplification. DAG size of input: 116 DAG size of output: 104 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 16:24:29,376 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse27 (* c_~back~0 4))) (let ((.cse26 (* c_~front~0 4)) (.cse21 (+ c_~queue~0.offset .cse27))) (let ((.cse18 (+ c_~front~0 1)) (.cse7 (select (select |c_#memory_int| c_~queue~0.base) .cse21)) (.cse1 (+ c_~queue~0.offset .cse27 4)) (.cse2 (+ c_~queue~0.offset .cse26 4)) (.cse3 (+ c_~queue~0.offset .cse26)) (.cse4 (<= (+ c_~back~0 1) c_~front~0))) (let ((.cse8 (and (or (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (+ (select .cse24 .cse1) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse24 .cse2) (select .cse24 .cse3)))))) .cse4) (or (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (+ (select .cse25 .cse1) 1) 0)) (<= (+ c_~sum~0 (select .cse25 .cse2) (select .cse25 .cse3)) 1)))) .cse4))) (.cse9 (not (= .cse7 1))) (.cse16 (= (mod c_~v_assert~0 256) 0)) (.cse17 (and (or (forall ((v_ArrVal_566 (Array Int Int)) (v_ArrVal_565 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_565))) (let ((.cse19 (select (store .cse20 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (+ (select .cse19 .cse1) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse19 .cse3) (select .cse19 .cse2))) (not (= (select (select .cse20 c_~queue~0.base) .cse21) 1)))))) .cse4) (or .cse4 (forall ((v_ArrVal_566 (Array Int Int)) (v_ArrVal_565 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_565))) (let ((.cse22 (select (store .cse23 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (+ (select .cse22 .cse1) 1) 0)) (not (= (select (select .cse23 c_~queue~0.base) .cse21) 1)) (<= (+ c_~sum~0 (select .cse22 .cse3) (select .cse22 .cse2)) 1)))))))) (.cse10 (<= c_~n~0 c_~back~0)) (.cse11 (< .cse18 0)) (.cse12 (< c_~back~0 0)) (.cse13 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (.cse14 (<= c_~n~0 .cse18)) (.cse15 (<= 0 c_~sum~0))) (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) (<= c_~sum~0 0) (<= c_~v_assert~0 1) (or .cse10 .cse11 .cse12 .cse8 .cse13 .cse9 .cse14) (or (and (or .cse4 (<= c_~sum~0 1)) (or .cse4 (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) .cse15))) .cse16 .cse10 .cse11 .cse12 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse14) (or .cse17 .cse16 .cse10 .cse11 .cse12 .cse14) (or .cse17 .cse10 .cse11 .cse12 .cse13 .cse14) (<= 1 c_~v_assert~0) .cse15))))) is different from false [2023-08-24 16:24:29,562 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_~sum~0 0) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2023-08-24 16:24:44,933 INFO L124 PetriNetUnfolderBase]: 11493/20012 cut-off events. [2023-08-24 16:24:44,933 INFO L125 PetriNetUnfolderBase]: For 1667850/1667850 co-relation queries the response was YES. [2023-08-24 16:24:45,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291673 conditions, 20012 events. 11493/20012 cut-off events. For 1667850/1667850 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 151777 event pairs, 1562 based on Foata normal form. 176/20188 useless extension candidates. Maximal degree in co-relation 291512. Up to 6805 conditions per place. [2023-08-24 16:24:45,316 INFO L140 encePairwiseOnDemand]: 231/248 looper letters, 1057 selfloop transitions, 963 changer transitions 312/2332 dead transitions. [2023-08-24 16:24:45,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 2332 transitions, 48671 flow [2023-08-24 16:24:45,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-08-24 16:24:45,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2023-08-24 16:24:45,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 3836 transitions. [2023-08-24 16:24:45,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2812316715542522 [2023-08-24 16:24:45,323 INFO L72 ComplementDD]: Start complementDD. Operand 55 states and 3836 transitions. [2023-08-24 16:24:45,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 3836 transitions. [2023-08-24 16:24:45,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:24:45,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 3836 transitions. [2023-08-24 16:24:45,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 56 states, 55 states have (on average 69.74545454545455) internal successors, (3836), 55 states have internal predecessors, (3836), 0 states have call successors, (0), 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 16:24:45,339 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 16:24:45,340 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 16:24:45,340 INFO L175 Difference]: Start difference. First operand has 520 places, 1655 transitions, 28523 flow. Second operand 55 states and 3836 transitions. [2023-08-24 16:24:45,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 2332 transitions, 48671 flow [2023-08-24 16:24:56,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 490 places, 2332 transitions, 42059 flow, removed 2726 selfloop flow, removed 50 redundant places. [2023-08-24 16:24:56,215 INFO L231 Difference]: Finished difference. Result has 511 places, 1761 transitions, 30554 flow [2023-08-24 16:24:56,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=25130, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1649, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=840, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=752, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=30554, PETRI_PLACES=511, PETRI_TRANSITIONS=1761} [2023-08-24 16:24:56,216 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 480 predicate places. [2023-08-24 16:24:56,216 INFO L495 AbstractCegarLoop]: Abstraction has has 511 places, 1761 transitions, 30554 flow [2023-08-24 16:24:56,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 65.70731707317073) internal successors, (2694), 41 states have internal predecessors, (2694), 0 states have call successors, (0), 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 16:24:56,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:24:56,217 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 16:24:56,222 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 16:24:56,417 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 16:24:56,417 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 16:24:56,418 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:24:56,418 INFO L85 PathProgramCache]: Analyzing trace with hash -322501898, now seen corresponding path program 11 times [2023-08-24 16:24:56,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:24:56,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811547169] [2023-08-24 16:24:56,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:24:56,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:24:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:24:58,453 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 16:24:58,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:24:58,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811547169] [2023-08-24 16:24:58,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811547169] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 16:24:58,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868301554] [2023-08-24 16:24:58,454 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 16:24:58,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:24:58,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 16:24:58,456 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 16:24:58,456 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 16:24:58,560 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-08-24 16:24:58,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 16:24:58,562 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 34 conjunts are in the unsatisfiable core [2023-08-24 16:24:58,563 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 16:24:58,882 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 16:24:58,882 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 16:24:59,269 INFO L322 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-08-24 16:24:59,270 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 16:24:59,713 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 16:24:59,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868301554] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 16:24:59,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 16:24:59,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 9] total 32 [2023-08-24 16:24:59,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706069275] [2023-08-24 16:24:59,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 16:24:59,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-24 16:24:59,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:24:59,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-24 16:24:59,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2023-08-24 16:24:59,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 248 [2023-08-24 16:24:59,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 511 places, 1761 transitions, 30554 flow. Second operand has 33 states, 33 states have (on average 64.27272727272727) internal successors, (2121), 33 states have internal predecessors, (2121), 0 states have call successors, (0), 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 16:24:59,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:24:59,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 248 [2023-08-24 16:24:59,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:25:12,006 INFO L124 PetriNetUnfolderBase]: 12937/22252 cut-off events. [2023-08-24 16:25:12,006 INFO L125 PetriNetUnfolderBase]: For 1234155/1234155 co-relation queries the response was YES. [2023-08-24 16:25:12,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292468 conditions, 22252 events. 12937/22252 cut-off events. For 1234155/1234155 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 168270 event pairs, 1163 based on Foata normal form. 100/22352 useless extension candidates. Maximal degree in co-relation 292326. Up to 8191 conditions per place. [2023-08-24 16:25:12,335 INFO L140 encePairwiseOnDemand]: 235/248 looper letters, 1517 selfloop transitions, 996 changer transitions 151/2664 dead transitions. [2023-08-24 16:25:12,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 2664 transitions, 53043 flow [2023-08-24 16:25:12,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-08-24 16:25:12,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2023-08-24 16:25:12,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 3723 transitions. [2023-08-24 16:25:12,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27294721407624634 [2023-08-24 16:25:12,340 INFO L72 ComplementDD]: Start complementDD. Operand 55 states and 3723 transitions. [2023-08-24 16:25:12,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 3723 transitions. [2023-08-24 16:25:12,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:25:12,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 3723 transitions. [2023-08-24 16:25:12,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 56 states, 55 states have (on average 67.69090909090909) internal successors, (3723), 55 states have internal predecessors, (3723), 0 states have call successors, (0), 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 16:25:12,354 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 16:25:12,355 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 16:25:12,355 INFO L175 Difference]: Start difference. First operand has 511 places, 1761 transitions, 30554 flow. Second operand 55 states and 3723 transitions. [2023-08-24 16:25:12,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 2664 transitions, 53043 flow [2023-08-24 16:25:19,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 535 places, 2664 transitions, 51874 flow, removed 503 selfloop flow, removed 23 redundant places. [2023-08-24 16:25:19,409 INFO L231 Difference]: Finished difference. Result has 546 places, 2015 transitions, 37835 flow [2023-08-24 16:25:19,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=29874, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1761, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=760, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=956, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=37835, PETRI_PLACES=546, PETRI_TRANSITIONS=2015} [2023-08-24 16:25:19,410 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 515 predicate places. [2023-08-24 16:25:19,410 INFO L495 AbstractCegarLoop]: Abstraction has has 546 places, 2015 transitions, 37835 flow [2023-08-24 16:25:19,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 64.27272727272727) internal successors, (2121), 33 states have internal predecessors, (2121), 0 states have call successors, (0), 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 16:25:19,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:25:19,411 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 16:25:19,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-24 16:25:19,611 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 16:25:19,612 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 16:25:19,612 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:25:19,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1492230456, now seen corresponding path program 12 times [2023-08-24 16:25:19,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:25:19,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81488198] [2023-08-24 16:25:19,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:25:19,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:25:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:25:21,455 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 16:25:21,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:25:21,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81488198] [2023-08-24 16:25:21,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81488198] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 16:25:21,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256585787] [2023-08-24 16:25:21,455 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 16:25:21,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:25:21,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 16:25:21,456 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 16:25:21,459 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 16:25:21,608 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-08-24 16:25:21,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 16:25:21,610 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 46 conjunts are in the unsatisfiable core [2023-08-24 16:25:21,612 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 16:25:21,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 16:25:21,879 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 16:25:22,085 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 16:25:22,085 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 16:25:22,930 INFO L322 Elim1Store]: treesize reduction 16, result has 64.4 percent of original size [2023-08-24 16:25:22,930 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 516 treesize of output 412 [2023-08-24 16:25:22,963 INFO L322 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2023-08-24 16:25:22,963 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 279 treesize of output 271 [2023-08-24 16:25:22,996 INFO L322 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2023-08-24 16:25:22,996 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 252 [2023-08-24 16:25:23,030 INFO L322 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2023-08-24 16:25:23,030 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 233 [2023-08-24 16:25:23,064 INFO L322 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2023-08-24 16:25:23,065 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 214 [2023-08-24 16:25:24,269 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 16:25:24,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256585787] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 16:25:24,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 16:25:24,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 11] total 36 [2023-08-24 16:25:24,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296315949] [2023-08-24 16:25:24,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 16:25:24,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-24 16:25:24,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:25:24,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-24 16:25:24,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1122, Unknown=5, NotChecked=0, Total=1332 [2023-08-24 16:25:24,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 248 [2023-08-24 16:25:24,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 2015 transitions, 37835 flow. Second operand has 37 states, 37 states have (on average 64.13513513513513) internal successors, (2373), 37 states have internal predecessors, (2373), 0 states have call successors, (0), 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 16:25:24,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:25:24,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 248 [2023-08-24 16:25:24,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:26:09,527 WARN L234 SmtUtils]: Spent 42.85s on a formula simplification. DAG size of input: 100 DAG size of output: 80 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 16:26:12,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 16:26:14,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 16:27:02,024 WARN L234 SmtUtils]: Spent 46.70s on a formula simplification. DAG size of input: 95 DAG size of output: 79 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 16:27:04,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 16:27:07,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 16:27:33,167 INFO L124 PetriNetUnfolderBase]: 27127/45787 cut-off events. [2023-08-24 16:27:33,168 INFO L125 PetriNetUnfolderBase]: For 2496521/2496521 co-relation queries the response was YES. [2023-08-24 16:27:34,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615300 conditions, 45787 events. 27127/45787 cut-off events. For 2496521/2496521 co-relation queries the response was YES. Maximal size of possible extension queue 1786. Compared 382013 event pairs, 1599 based on Foata normal form. 1302/47089 useless extension candidates. Maximal degree in co-relation 615155. Up to 17942 conditions per place. [2023-08-24 16:27:34,567 INFO L140 encePairwiseOnDemand]: 235/248 looper letters, 1418 selfloop transitions, 2459 changer transitions 1298/5175 dead transitions. [2023-08-24 16:27:34,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 617 places, 5175 transitions, 112658 flow [2023-08-24 16:27:34,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-08-24 16:27:34,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2023-08-24 16:27:34,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 5135 transitions. [2023-08-24 16:27:34,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2760752688172043 [2023-08-24 16:27:34,574 INFO L72 ComplementDD]: Start complementDD. Operand 75 states and 5135 transitions. [2023-08-24 16:27:34,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 5135 transitions. [2023-08-24 16:27:34,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:27:34,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 75 states and 5135 transitions. [2023-08-24 16:27:34,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 76 states, 75 states have (on average 68.46666666666667) internal successors, (5135), 75 states have internal predecessors, (5135), 0 states have call successors, (0), 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 16:27:34,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 76 states, 76 states have (on average 248.0) internal successors, (18848), 76 states have internal predecessors, (18848), 0 states have call successors, (0), 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 16:27:34,593 INFO L81 ComplementDD]: Finished complementDD. Result has 76 states, 76 states have (on average 248.0) internal successors, (18848), 76 states have internal predecessors, (18848), 0 states have call successors, (0), 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 16:27:34,593 INFO L175 Difference]: Start difference. First operand has 546 places, 2015 transitions, 37835 flow. Second operand 75 states and 5135 transitions. [2023-08-24 16:27:34,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 617 places, 5175 transitions, 112658 flow [2023-08-24 16:27:54,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 5175 transitions, 107404 flow, removed 1522 selfloop flow, removed 18 redundant places. [2023-08-24 16:27:54,706 INFO L231 Difference]: Finished difference. Result has 628 places, 3155 transitions, 69176 flow [2023-08-24 16:27:54,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=34661, PETRI_DIFFERENCE_MINUEND_PLACES=525, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1929, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1230, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=75, PETRI_FLOW=69176, PETRI_PLACES=628, PETRI_TRANSITIONS=3155} [2023-08-24 16:27:54,709 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 597 predicate places. [2023-08-24 16:27:54,709 INFO L495 AbstractCegarLoop]: Abstraction has has 628 places, 3155 transitions, 69176 flow [2023-08-24 16:27:54,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 64.13513513513513) internal successors, (2373), 37 states have internal predecessors, (2373), 0 states have call successors, (0), 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 16:27:54,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:27:54,709 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 16:27:54,717 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 16:27:54,914 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 16:27:54,915 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 16:27:54,915 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:27:54,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1498405498, now seen corresponding path program 13 times [2023-08-24 16:27:54,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:27:54,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726224498] [2023-08-24 16:27:54,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:27:54,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:27:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:27:57,008 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 16:27:57,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:27:57,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726224498] [2023-08-24 16:27:57,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726224498] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 16:27:57,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87839101] [2023-08-24 16:27:57,009 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-24 16:27:57,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:27:57,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 16:27:57,010 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 16:27:57,011 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 16:27:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:27:57,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-24 16:27:57,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 16:27:57,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 16:27:57,385 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 16:27:57,593 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 16:27:57,593 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 16:27:57,850 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 16:27:57,976 INFO L322 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-08-24 16:27:57,977 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 16:27:58,001 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:27:58,002 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 16:27:58,025 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:27:58,025 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 16:27:58,049 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:27:58,049 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 16:27:58,083 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:27:58,084 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 16:28:00,355 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2023-08-24 16:28:00,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87839101] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 16:28:00,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 16:28:00,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 11] total 37 [2023-08-24 16:28:00,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559476339] [2023-08-24 16:28:00,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 16:28:00,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-08-24 16:28:00,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:28:00,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-08-24 16:28:00,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1157, Unknown=1, NotChecked=70, Total=1406 [2023-08-24 16:28:00,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 248 [2023-08-24 16:28:00,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 3155 transitions, 69176 flow. Second operand has 38 states, 38 states have (on average 65.94736842105263) internal successors, (2506), 38 states have internal predecessors, (2506), 0 states have call successors, (0), 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 16:28:00,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:28:00,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 248 [2023-08-24 16:28:00,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:28:39,358 WARN L234 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 16:28:50,475 WARN L234 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 16:29:00,577 INFO L124 PetriNetUnfolderBase]: 29481/49810 cut-off events. [2023-08-24 16:29:00,577 INFO L125 PetriNetUnfolderBase]: For 2859780/2859780 co-relation queries the response was YES. [2023-08-24 16:29:02,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701120 conditions, 49810 events. 29481/49810 cut-off events. For 2859780/2859780 co-relation queries the response was YES. Maximal size of possible extension queue 1838. Compared 419486 event pairs, 3272 based on Foata normal form. 76/49886 useless extension candidates. Maximal degree in co-relation 700950. Up to 20439 conditions per place. [2023-08-24 16:29:02,702 INFO L140 encePairwiseOnDemand]: 232/248 looper letters, 2844 selfloop transitions, 1911 changer transitions 190/4945 dead transitions. [2023-08-24 16:29:02,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 682 places, 4945 transitions, 118217 flow [2023-08-24 16:29:02,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-08-24 16:29:02,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2023-08-24 16:29:02,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 3867 transitions. [2023-08-24 16:29:02,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2835043988269795 [2023-08-24 16:29:02,706 INFO L72 ComplementDD]: Start complementDD. Operand 55 states and 3867 transitions. [2023-08-24 16:29:02,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 3867 transitions. [2023-08-24 16:29:02,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:29:02,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 3867 transitions. [2023-08-24 16:29:02,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 56 states, 55 states have (on average 70.30909090909091) internal successors, (3867), 55 states have internal predecessors, (3867), 0 states have call successors, (0), 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 16:29:02,718 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 16:29:02,719 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 16:29:02,719 INFO L175 Difference]: Start difference. First operand has 628 places, 3155 transitions, 69176 flow. Second operand 55 states and 3867 transitions. [2023-08-24 16:29:02,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 682 places, 4945 transitions, 118217 flow [2023-08-24 16:29:41,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 664 places, 4945 transitions, 111858 flow, removed 2366 selfloop flow, removed 18 redundant places. [2023-08-24 16:29:41,439 INFO L231 Difference]: Finished difference. Result has 678 places, 3921 transitions, 88918 flow [2023-08-24 16:29:41,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=65194, PETRI_DIFFERENCE_MINUEND_PLACES=610, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1175, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=88918, PETRI_PLACES=678, PETRI_TRANSITIONS=3921} [2023-08-24 16:29:41,442 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 647 predicate places. [2023-08-24 16:29:41,442 INFO L495 AbstractCegarLoop]: Abstraction has has 678 places, 3921 transitions, 88918 flow [2023-08-24 16:29:41,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 65.94736842105263) internal successors, (2506), 38 states have internal predecessors, (2506), 0 states have call successors, (0), 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 16:29:41,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:29:41,442 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 16:29:41,447 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 16:29:41,643 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 16:29:41,643 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 16:29:41,644 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:29:41,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1980000128, now seen corresponding path program 14 times [2023-08-24 16:29:41,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:29:41,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169162445] [2023-08-24 16:29:41,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:29:41,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:29:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:29:43,491 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 16:29:43,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:29:43,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169162445] [2023-08-24 16:29:43,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169162445] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 16:29:43,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753500173] [2023-08-24 16:29:43,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 16:29:43,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:29:43,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 16:29:43,493 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 16:29:43,499 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 16:29:43,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 16:29:43,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 16:29:43,612 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-24 16:29:43,613 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 16:29:43,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 16:29:43,949 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 16:29:44,110 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 16:29:44,110 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 16:29:44,451 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_777 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_777) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_777 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_777) c_~queue~0.base) .cse4))))))) (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0))) is different from false [2023-08-24 16:29:44,480 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_777 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_777) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_777 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_777) c_~queue~0.base) .cse4))))))) (= (mod c_~v_assert~0 256) 0))) is different from false [2023-08-24 16:29:44,599 INFO L322 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-08-24 16:29:44,599 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 16:29:44,611 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 16:29:44,623 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 16:29:45,093 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2023-08-24 16:29:45,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753500173] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 16:29:45,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 16:29:45,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 11] total 36 [2023-08-24 16:29:45,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328967656] [2023-08-24 16:29:45,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 16:29:45,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-24 16:29:45,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:29:45,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-24 16:29:45,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1024, Unknown=7, NotChecked=134, Total=1332 [2023-08-24 16:29:45,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 248 [2023-08-24 16:29:45,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 678 places, 3921 transitions, 88918 flow. Second operand has 37 states, 37 states have (on average 65.91891891891892) internal successors, (2439), 37 states have internal predecessors, (2439), 0 states have call successors, (0), 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 16:29:45,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:29:45,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 248 [2023-08-24 16:29:45,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:30:37,452 INFO L124 PetriNetUnfolderBase]: 33465/56637 cut-off events. [2023-08-24 16:30:37,452 INFO L125 PetriNetUnfolderBase]: For 3427905/3427905 co-relation queries the response was YES. [2023-08-24 16:30:39,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809735 conditions, 56637 events. 33465/56637 cut-off events. For 3427905/3427905 co-relation queries the response was YES. Maximal size of possible extension queue 1957. Compared 484135 event pairs, 2887 based on Foata normal form. 770/57407 useless extension candidates. Maximal degree in co-relation 809555. Up to 21681 conditions per place. [2023-08-24 16:30:40,100 INFO L140 encePairwiseOnDemand]: 235/248 looper letters, 1750 selfloop transitions, 2274 changer transitions 1137/5161 dead transitions. [2023-08-24 16:30:40,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 700 places, 5161 transitions, 126284 flow [2023-08-24 16:30:40,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-08-24 16:30:40,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-08-24 16:30:40,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1981 transitions. [2023-08-24 16:30:40,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2852822580645161 [2023-08-24 16:30:40,102 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 1981 transitions. [2023-08-24 16:30:40,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 1981 transitions. [2023-08-24 16:30:40,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:30:40,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 1981 transitions. [2023-08-24 16:30:40,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 70.75) internal successors, (1981), 28 states have internal predecessors, (1981), 0 states have call successors, (0), 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 16:30:40,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 248.0) internal successors, (7192), 29 states have internal predecessors, (7192), 0 states have call successors, (0), 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 16:30:40,110 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 248.0) internal successors, (7192), 29 states have internal predecessors, (7192), 0 states have call successors, (0), 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 16:30:40,110 INFO L175 Difference]: Start difference. First operand has 678 places, 3921 transitions, 88918 flow. Second operand 28 states and 1981 transitions. [2023-08-24 16:30:40,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 700 places, 5161 transitions, 126284 flow [2023-08-24 16:31:20,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 680 places, 5161 transitions, 122862 flow, removed 953 selfloop flow, removed 20 redundant places. [2023-08-24 16:31:20,320 INFO L231 Difference]: Finished difference. Result has 684 places, 3729 transitions, 89826 flow [2023-08-24 16:31:20,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=84920, PETRI_DIFFERENCE_MINUEND_PLACES=653, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3838, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2098, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1688, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=89826, PETRI_PLACES=684, PETRI_TRANSITIONS=3729} [2023-08-24 16:31:20,323 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 653 predicate places. [2023-08-24 16:31:20,323 INFO L495 AbstractCegarLoop]: Abstraction has has 684 places, 3729 transitions, 89826 flow [2023-08-24 16:31:20,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 65.91891891891892) internal successors, (2439), 37 states have internal predecessors, (2439), 0 states have call successors, (0), 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 16:31:20,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:31:20,324 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 16:31:20,329 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 16:31:20,524 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 16:31:20,525 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 16:31:20,525 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:31:20,525 INFO L85 PathProgramCache]: Analyzing trace with hash 454457314, now seen corresponding path program 15 times [2023-08-24 16:31:20,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:31:20,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405621720] [2023-08-24 16:31:20,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:31:20,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:31:20,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:31:22,027 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 16:31:22,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:31:22,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405621720] [2023-08-24 16:31:22,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405621720] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 16:31:22,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951055404] [2023-08-24 16:31:22,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 16:31:22,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:31:22,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 16:31:22,029 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 16:31:22,032 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 16:31:22,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-24 16:31:22,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 16:31:22,211 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-24 16:31:22,213 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 16:31:22,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 16:31:22,537 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 16:31:22,666 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 16:31:22,666 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 16:31:22,903 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (+ c_~queue~0.offset .cse2 4)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse2)))) (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) .cse1))) (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) .cse1) 1)))))) is different from false [2023-08-24 16:31:23,130 INFO L322 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-08-24 16:31:23,130 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 16:31:23,143 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 16:31:23,154 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 16:31:23,707 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 16:31:23,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951055404] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 16:31:23,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 16:31:23,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 34 [2023-08-24 16:31:23,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283943856] [2023-08-24 16:31:23,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 16:31:23,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-24 16:31:23,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:31:23,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-24 16:31:23,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=961, Unknown=8, NotChecked=64, Total=1190 [2023-08-24 16:31:23,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 248 [2023-08-24 16:31:23,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 684 places, 3729 transitions, 89826 flow. Second operand has 35 states, 35 states have (on average 70.22857142857143) internal successors, (2458), 35 states have internal predecessors, (2458), 0 states have call successors, (0), 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 16:31:23,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:31:23,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 248 [2023-08-24 16:31:23,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:31:26,479 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_~queue~0.base))) (let ((.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse1 (let ((.cse7 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse7 4)) (.cse6 (select .cse4 (+ c_~queue~0.offset .cse7)))) (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) .cse5) .cse6))) (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) .cse5) .cse6) 1))))))) (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= c_~v_assert~0 1) (or .cse0 .cse1) (<= |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) (<= c_~sum~0 1) (or (let ((.cse2 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse3 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse2 (not (= .cse3 1))))) .cse0 .cse1)))) is different from false [2023-08-24 16:31:27,024 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) (<= 1 c_~v_assert~0) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ 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 ((.cse5 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse5 4)) (.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (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) .cse3) .cse4))) (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) .cse3) .cse4) 1)))))))) is different from false [2023-08-24 16:32:20,361 INFO L124 PetriNetUnfolderBase]: 38790/64443 cut-off events. [2023-08-24 16:32:20,362 INFO L125 PetriNetUnfolderBase]: For 4307624/4307624 co-relation queries the response was YES. [2023-08-24 16:32:22,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 968659 conditions, 64443 events. 38790/64443 cut-off events. For 4307624/4307624 co-relation queries the response was YES. Maximal size of possible extension queue 2993. Compared 558053 event pairs, 2842 based on Foata normal form. 164/64607 useless extension candidates. Maximal degree in co-relation 968481. Up to 27294 conditions per place. [2023-08-24 16:32:23,175 INFO L140 encePairwiseOnDemand]: 233/248 looper letters, 3387 selfloop transitions, 2365 changer transitions 314/6066 dead transitions. [2023-08-24 16:32:23,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 722 places, 6066 transitions, 163468 flow [2023-08-24 16:32:23,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-08-24 16:32:23,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2023-08-24 16:32:23,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 4425 transitions. [2023-08-24 16:32:23,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2973790322580645 [2023-08-24 16:32:23,180 INFO L72 ComplementDD]: Start complementDD. Operand 60 states and 4425 transitions. [2023-08-24 16:32:23,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 4425 transitions. [2023-08-24 16:32:23,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:32:23,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 60 states and 4425 transitions. [2023-08-24 16:32:23,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 61 states, 60 states have (on average 73.75) internal successors, (4425), 60 states have internal predecessors, (4425), 0 states have call successors, (0), 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 16:32:23,194 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 16:32:23,195 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 16:32:23,195 INFO L175 Difference]: Start difference. First operand has 684 places, 3729 transitions, 89826 flow. Second operand 60 states and 4425 transitions. [2023-08-24 16:32:23,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 722 places, 6066 transitions, 163468 flow [2023-08-24 16:33:15,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 695 places, 6066 transitions, 158099 flow, removed 788 selfloop flow, removed 27 redundant places. [2023-08-24 16:33:15,575 INFO L231 Difference]: Finished difference. Result has 728 places, 4533 transitions, 116441 flow [2023-08-24 16:33:15,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=86736, PETRI_DIFFERENCE_MINUEND_PLACES=636, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1670, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1686, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=116441, PETRI_PLACES=728, PETRI_TRANSITIONS=4533} [2023-08-24 16:33:15,579 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 697 predicate places. [2023-08-24 16:33:15,580 INFO L495 AbstractCegarLoop]: Abstraction has has 728 places, 4533 transitions, 116441 flow [2023-08-24 16:33:15,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 70.22857142857143) internal successors, (2458), 35 states have internal predecessors, (2458), 0 states have call successors, (0), 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 16:33:15,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 16:33:15,580 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 16:33:15,586 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 16:33:15,786 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 16:33:15,786 INFO L420 AbstractCegarLoop]: === Iteration 21 === 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 16:33:15,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 16:33:15,786 INFO L85 PathProgramCache]: Analyzing trace with hash -2105959251, now seen corresponding path program 16 times [2023-08-24 16:33:15,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 16:33:15,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255790717] [2023-08-24 16:33:15,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 16:33:15,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 16:33:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 16:33:15,948 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 16:33:15,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 16:33:15,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255790717] [2023-08-24 16:33:15,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255790717] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 16:33:15,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743080431] [2023-08-24 16:33:15,948 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 16:33:15,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 16:33:15,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 16:33:15,953 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 16:33:15,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-24 16:33:16,084 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 16:33:16,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 16:33:16,085 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 16:33:16,087 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 16:33:16,229 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 16:33:16,229 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 170 treesize of output 120 [2023-08-24 16:33:16,253 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 16:33:16,253 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 16:33:16,421 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-24 16:33:16,422 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 193 treesize of output 145 [2023-08-24 16:33:16,515 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 16:33:16,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743080431] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 16:33:16,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 16:33:16,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2023-08-24 16:33:16,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060199826] [2023-08-24 16:33:16,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 16:33:16,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-24 16:33:16,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 16:33:16,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-24 16:33:16,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2023-08-24 16:33:16,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 248 [2023-08-24 16:33:16,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 728 places, 4533 transitions, 116441 flow. Second operand has 13 states, 13 states have (on average 100.38461538461539) internal successors, (1305), 13 states have internal predecessors, (1305), 0 states have call successors, (0), 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 16:33:16,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 16:33:16,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 248 [2023-08-24 16:33:16,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 16:34:30,785 INFO L124 PetriNetUnfolderBase]: 49975/85108 cut-off events. [2023-08-24 16:34:30,785 INFO L125 PetriNetUnfolderBase]: For 8710445/8720173 co-relation queries the response was YES. [2023-08-24 16:34:34,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1479852 conditions, 85108 events. 49975/85108 cut-off events. For 8710445/8720173 co-relation queries the response was YES. Maximal size of possible extension queue 4081. Compared 800158 event pairs, 6875 based on Foata normal form. 1485/85532 useless extension candidates. Maximal degree in co-relation 1479646. Up to 37698 conditions per place. [2023-08-24 16:34:35,454 INFO L140 encePairwiseOnDemand]: 243/248 looper letters, 2557 selfloop transitions, 2941 changer transitions 179/6332 dead transitions. [2023-08-24 16:34:35,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 713 places, 6332 transitions, 176723 flow [2023-08-24 16:34:35,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 16:34:35,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 16:34:35,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 871 transitions. [2023-08-24 16:34:35,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43901209677419356 [2023-08-24 16:34:35,455 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 871 transitions. [2023-08-24 16:34:35,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 871 transitions. [2023-08-24 16:34:35,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 16:34:35,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 871 transitions. [2023-08-24 16:34:35,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 108.875) internal successors, (871), 8 states have internal predecessors, (871), 0 states have call successors, (0), 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 16:34:35,457 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 16:34:35,457 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 16:34:35,457 INFO L175 Difference]: Start difference. First operand has 728 places, 4533 transitions, 116441 flow. Second operand 8 states and 871 transitions. [2023-08-24 16:34:35,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 713 places, 6332 transitions, 176723 flow Received shutdown request... [2023-08-24 16:34:44,368 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 16:34:44,368 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 16:34:45,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-24 16:34:45,469 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-24 16:34:45,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-24 16:34:45,469 WARN L619 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2023-08-24 16:34:45,477 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-08-24 16:34:45,477 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-08-24 16:34:45,477 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-08-24 16:34:45,477 INFO L445 BasicCegarLoop]: Path program histogram: [16, 3, 1, 1] [2023-08-24 16:34:45,479 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 16:34:45,479 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 16:34:45,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 04:34:45 BasicIcfg [2023-08-24 16:34:45,483 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 16:34:45,484 INFO L158 Benchmark]: Toolchain (without parser) took 777013.19ms. Allocated memory was 348.1MB in the beginning and 13.8GB in the end (delta: 13.5GB). Free memory was 325.3MB in the beginning and 7.8GB in the end (delta: -7.5GB). Peak memory consumption was 7.6GB. Max. memory is 16.0GB. [2023-08-24 16:34:45,484 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 348.1MB. Free memory is still 324.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 16:34:45,484 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.31ms. Allocated memory is still 348.1MB. Free memory was 325.3MB in the beginning and 312.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-24 16:34:45,484 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.36ms. Allocated memory is still 348.1MB. Free memory was 312.7MB in the beginning and 310.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 16:34:45,484 INFO L158 Benchmark]: Boogie Preprocessor took 47.57ms. Allocated memory is still 348.1MB. Free memory was 310.6MB in the beginning and 309.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 16:34:45,485 INFO L158 Benchmark]: RCFGBuilder took 539.23ms. Allocated memory is still 348.1MB. Free memory was 309.0MB in the beginning and 286.4MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 16:34:45,485 INFO L158 Benchmark]: TraceAbstraction took 776105.01ms. Allocated memory was 348.1MB in the beginning and 13.8GB in the end (delta: 13.5GB). Free memory was 285.9MB in the beginning and 7.8GB in the end (delta: -7.6GB). Peak memory consumption was 7.6GB. Max. memory is 16.0GB. [2023-08-24 16:34:45,486 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.13ms. Allocated memory is still 348.1MB. Free memory is still 324.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 262.31ms. Allocated memory is still 348.1MB. Free memory was 325.3MB in the beginning and 312.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 53.36ms. Allocated memory is still 348.1MB. Free memory was 312.7MB in the beginning and 310.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 47.57ms. Allocated memory is still 348.1MB. Free memory was 310.6MB in the beginning and 309.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 539.23ms. Allocated memory is still 348.1MB. Free memory was 309.0MB in the beginning and 286.4MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * TraceAbstraction took 776105.01ms. Allocated memory was 348.1MB in the beginning and 13.8GB in the end (delta: 13.5GB). Free memory was 285.9MB in the beginning and 7.8GB in the end (delta: -7.6GB). Peak memory consumption was 7.6GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 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: 776.0s, OverallIterations: 21, TraceHistogramMax: 3, PathProgramHistogramMax: 16, EmptinessCheckTime: 0.0s, AutomataDifference: 721.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 311 mSolverCounterUnknown, 8308 SdHoareTripleChecker+Valid, 24.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8308 mSDsluCounter, 227 SdHoareTripleChecker+Invalid, 22.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 8269 IncrementalHoareTripleChecker+Unchecked, 221 mSDsCounter, 886 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18642 IncrementalHoareTripleChecker+Invalid, 28108 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 886 mSolverCounterUnsat, 6 mSDtfsCounter, 18642 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1768 GetRequests, 548 SyntacticMatches, 68 SemanticMatches, 1152 ConstructedPredicates, 27 IntricatePredicates, 0 DeprecatedPredicates, 34634 ImplicationChecksByTransitivity, 232.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116441occurred in iteration=20, InterpolantAutomatonStates: 864, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 44.6s InterpolantComputationTime, 972 NumberOfCodeBlocks, 972 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 1343 ConstructedInterpolants, 47 QuantifiedInterpolants, 28749 SizeOfPredicates, 366 NumberOfNonLiveVariables, 3701 ConjunctsInSsa, 560 ConjunctsInUnsatCore, 51 InterpolantComputations, 6 PerfectInterpolantSequences, 181/476 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