/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 10:12:33,634 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 10:12:33,708 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 10:12:33,713 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 10:12:33,714 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 10:12:33,751 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 10:12:33,752 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 10:12:33,752 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 10:12:33,753 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 10:12:33,756 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 10:12:33,756 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 10:12:33,757 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 10:12:33,757 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 10:12:33,758 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 10:12:33,758 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 10:12:33,759 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 10:12:33,759 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 10:12:33,759 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 10:12:33,759 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 10:12:33,759 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 10:12:33,760 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 10:12:33,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 10:12:33,761 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 10:12:33,761 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 10:12:33,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 10:12:33,762 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 10:12:33,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 10:12:33,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 10:12:33,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 10:12:33,763 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 10:12:33,764 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 10:12:33,764 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 10:12:33,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 10:12:33,764 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 10:12:33,765 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 10:12:33,765 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-24 10:12:34,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 10:12:34,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 10:12:34,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 10:12:34,114 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 10:12:34,116 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 10:12:34,117 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c [2023-08-24 10:12:35,250 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 10:12:35,436 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 10:12:35,437 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c [2023-08-24 10:12:35,444 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34f095672/2748276c5fa34539ac2543e5a248e6a6/FLAGb3129846c [2023-08-24 10:12:35,461 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34f095672/2748276c5fa34539ac2543e5a248e6a6 [2023-08-24 10:12:35,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 10:12:35,464 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 10:12:35,465 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 10:12:35,465 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 10:12:35,467 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 10:12:35,468 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 10:12:35" (1/1) ... [2023-08-24 10:12:35,469 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@575bf4b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:12:35, skipping insertion in model container [2023-08-24 10:12:35,469 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 10:12:35" (1/1) ... [2023-08-24 10:12:35,488 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 10:12:35,625 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-three-array-max.wvr.c[2823,2836] [2023-08-24 10:12:35,630 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 10:12:35,638 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 10:12:35,657 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-three-array-max.wvr.c[2823,2836] [2023-08-24 10:12:35,660 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 10:12:35,667 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 10:12:35,667 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 10:12:35,673 INFO L206 MainTranslator]: Completed translation [2023-08-24 10:12:35,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:12:35 WrapperNode [2023-08-24 10:12:35,673 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 10:12:35,674 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 10:12:35,674 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 10:12:35,674 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 10:12:35,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:12:35" (1/1) ... [2023-08-24 10:12:35,687 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:12:35" (1/1) ... [2023-08-24 10:12:35,721 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 240 [2023-08-24 10:12:35,722 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 10:12:35,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 10:12:35,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 10:12:35,723 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 10:12:35,731 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:12:35" (1/1) ... [2023-08-24 10:12:35,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:12:35" (1/1) ... [2023-08-24 10:12:35,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:12:35" (1/1) ... [2023-08-24 10:12:35,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:12:35" (1/1) ... [2023-08-24 10:12:35,754 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:12:35" (1/1) ... [2023-08-24 10:12:35,771 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:12:35" (1/1) ... [2023-08-24 10:12:35,773 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:12:35" (1/1) ... [2023-08-24 10:12:35,774 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:12:35" (1/1) ... [2023-08-24 10:12:35,777 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 10:12:35,777 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 10:12:35,778 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 10:12:35,778 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 10:12:35,778 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:12:35" (1/1) ... [2023-08-24 10:12:35,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 10:12:35,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:12:35,814 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-24 10:12:35,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-24 10:12:35,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 10:12:35,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 10:12:35,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 10:12:35,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 10:12:35,858 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 10:12:35,858 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 10:12:35,859 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 10:12:35,859 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 10:12:35,859 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-24 10:12:35,859 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-24 10:12:35,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 10:12:35,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 10:12:35,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 10:12:35,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-24 10:12:35,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 10:12:35,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 10:12:35,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 10:12:35,863 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 10:12:35,974 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 10:12:35,976 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 10:12:36,436 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 10:12:36,523 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 10:12:36,523 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-24 10:12:36,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 10:12:36 BoogieIcfgContainer [2023-08-24 10:12:36,528 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 10:12:36,531 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 10:12:36,532 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 10:12:36,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 10:12:36,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 10:12:35" (1/3) ... [2023-08-24 10:12:36,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@555b913a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 10:12:36, skipping insertion in model container [2023-08-24 10:12:36,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:12:35" (2/3) ... [2023-08-24 10:12:36,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@555b913a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 10:12:36, skipping insertion in model container [2023-08-24 10:12:36,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 10:12:36" (3/3) ... [2023-08-24 10:12:36,538 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-max.wvr.c [2023-08-24 10:12:36,553 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 10:12:36,555 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 10:12:36,555 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 10:12:36,644 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-24 10:12:36,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 273 places, 290 transitions, 604 flow [2023-08-24 10:12:36,817 INFO L124 PetriNetUnfolderBase]: 27/287 cut-off events. [2023-08-24 10:12:36,817 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 10:12:36,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 287 events. 27/287 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 234 event pairs, 0 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 227. Up to 2 conditions per place. [2023-08-24 10:12:36,823 INFO L82 GeneralOperation]: Start removeDead. Operand has 273 places, 290 transitions, 604 flow [2023-08-24 10:12:36,832 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 260 places, 277 transitions, 572 flow [2023-08-24 10:12:36,835 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 10:12:36,847 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 260 places, 277 transitions, 572 flow [2023-08-24 10:12:36,849 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 260 places, 277 transitions, 572 flow [2023-08-24 10:12:36,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 260 places, 277 transitions, 572 flow [2023-08-24 10:12:36,945 INFO L124 PetriNetUnfolderBase]: 27/277 cut-off events. [2023-08-24 10:12:36,945 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 10:12:36,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 277 events. 27/277 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 229 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 227. Up to 2 conditions per place. [2023-08-24 10:12:36,949 INFO L119 LiptonReduction]: Number of co-enabled transitions 2904 [2023-08-24 10:12:45,447 INFO L134 LiptonReduction]: Checked pairs total: 4130 [2023-08-24 10:12:45,447 INFO L136 LiptonReduction]: Total number of compositions: 310 [2023-08-24 10:12:45,459 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 10:12:45,465 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;@60cbe959, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 10:12:45,465 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-24 10:12:45,473 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 10:12:45,474 INFO L124 PetriNetUnfolderBase]: 8/34 cut-off events. [2023-08-24 10:12:45,474 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 10:12:45,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:12:45,474 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] [2023-08-24 10:12:45,475 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 10:12:45,479 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:12:45,479 INFO L85 PathProgramCache]: Analyzing trace with hash -963094014, now seen corresponding path program 1 times [2023-08-24 10:12:45,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:12:45,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568846904] [2023-08-24 10:12:45,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:12:45,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:12:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:12:45,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:12:45,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:12:45,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568846904] [2023-08-24 10:12:45,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568846904] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 10:12:45,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 10:12:45,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 10:12:45,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436614556] [2023-08-24 10:12:45,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 10:12:45,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 10:12:45,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:12:46,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 10:12:46,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 10:12:46,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 600 [2023-08-24 10:12:46,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:46,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:12:46,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 600 [2023-08-24 10:12:46,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:12:46,231 INFO L124 PetriNetUnfolderBase]: 787/1050 cut-off events. [2023-08-24 10:12:46,232 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2023-08-24 10:12:46,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2157 conditions, 1050 events. 787/1050 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3696 event pairs, 357 based on Foata normal form. 0/603 useless extension candidates. Maximal degree in co-relation 1871. Up to 1027 conditions per place. [2023-08-24 10:12:46,241 INFO L140 encePairwiseOnDemand]: 597/600 looper letters, 31 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2023-08-24 10:12:46,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 36 transitions, 156 flow [2023-08-24 10:12:46,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 10:12:46,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 10:12:46,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2023-08-24 10:12:46,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37722222222222224 [2023-08-24 10:12:46,265 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 679 transitions. [2023-08-24 10:12:46,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 679 transitions. [2023-08-24 10:12:46,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:12:46,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 679 transitions. [2023-08-24 10:12:46,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:46,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 600.0) internal successors, (2400), 4 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:46,285 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 600.0) internal successors, (2400), 4 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:46,287 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 88 flow. Second operand 3 states and 679 transitions. [2023-08-24 10:12:46,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 36 transitions, 156 flow [2023-08-24 10:12:46,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 144 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-24 10:12:46,295 INFO L231 Difference]: Finished difference. Result has 34 places, 36 transitions, 88 flow [2023-08-24 10:12:46,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=600, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=34, PETRI_TRANSITIONS=36} [2023-08-24 10:12:46,303 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2023-08-24 10:12:46,303 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 36 transitions, 88 flow [2023-08-24 10:12:46,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:46,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:12:46,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:12:46,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 10:12:46,305 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 10:12:46,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:12:46,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1128208641, now seen corresponding path program 1 times [2023-08-24 10:12:46,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:12:46,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919975116] [2023-08-24 10:12:46,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:12:46,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:12:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:12:46,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:12:46,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:12:46,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919975116] [2023-08-24 10:12:46,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919975116] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:12:46,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784748159] [2023-08-24 10:12:46,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:12:46,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:12:46,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:12:46,501 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 10:12:46,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-24 10:12:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:12:46,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-24 10:12:46,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:12:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 10:12:46,719 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 10:12:46,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784748159] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 10:12:46,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 10:12:46,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-08-24 10:12:46,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359155560] [2023-08-24 10:12:46,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 10:12:46,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 10:12:46,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:12:46,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 10:12:46,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-24 10:12:46,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 600 [2023-08-24 10:12:46,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 36 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:46,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:12:46,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 600 [2023-08-24 10:12:46,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:12:46,897 INFO L124 PetriNetUnfolderBase]: 787/1052 cut-off events. [2023-08-24 10:12:46,898 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 10:12:46,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2119 conditions, 1052 events. 787/1052 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3704 event pairs, 357 based on Foata normal form. 0/605 useless extension candidates. Maximal degree in co-relation 2108. Up to 1026 conditions per place. [2023-08-24 10:12:46,904 INFO L140 encePairwiseOnDemand]: 593/600 looper letters, 29 selfloop transitions, 6 changer transitions 0/38 dead transitions. [2023-08-24 10:12:46,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 38 transitions, 162 flow [2023-08-24 10:12:46,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 10:12:46,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 10:12:46,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 897 transitions. [2023-08-24 10:12:46,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37375 [2023-08-24 10:12:46,908 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 897 transitions. [2023-08-24 10:12:46,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 897 transitions. [2023-08-24 10:12:46,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:12:46,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 897 transitions. [2023-08-24 10:12:46,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 224.25) internal successors, (897), 4 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:46,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 600.0) internal successors, (3000), 5 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:46,924 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 600.0) internal successors, (3000), 5 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:46,924 INFO L175 Difference]: Start difference. First operand has 34 places, 36 transitions, 88 flow. Second operand 4 states and 897 transitions. [2023-08-24 10:12:46,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 38 transitions, 162 flow [2023-08-24 10:12:46,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 158 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 10:12:46,927 INFO L231 Difference]: Finished difference. Result has 37 places, 38 transitions, 112 flow [2023-08-24 10:12:46,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=600, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=37, PETRI_TRANSITIONS=38} [2023-08-24 10:12:46,928 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 0 predicate places. [2023-08-24 10:12:46,928 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 38 transitions, 112 flow [2023-08-24 10:12:46,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:46,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:12:46,929 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, 1] [2023-08-24 10:12:46,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-24 10:12:47,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:12:47,135 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 10:12:47,136 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:12:47,136 INFO L85 PathProgramCache]: Analyzing trace with hash 802689150, now seen corresponding path program 1 times [2023-08-24 10:12:47,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:12:47,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856865492] [2023-08-24 10:12:47,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:12:47,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:12:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:12:47,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 10:12:47,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:12:47,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856865492] [2023-08-24 10:12:47,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856865492] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 10:12:47,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 10:12:47,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 10:12:47,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027857335] [2023-08-24 10:12:47,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 10:12:47,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 10:12:47,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:12:47,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 10:12:47,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 10:12:47,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 600 [2023-08-24 10:12:47,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 38 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:47,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:12:47,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 600 [2023-08-24 10:12:47,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:12:47,680 INFO L124 PetriNetUnfolderBase]: 1449/1926 cut-off events. [2023-08-24 10:12:47,680 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-08-24 10:12:47,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3898 conditions, 1926 events. 1449/1926 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 7587 event pairs, 303 based on Foata normal form. 1/1155 useless extension candidates. Maximal degree in co-relation 3878. Up to 1172 conditions per place. [2023-08-24 10:12:47,689 INFO L140 encePairwiseOnDemand]: 595/600 looper letters, 53 selfloop transitions, 4 changer transitions 1/61 dead transitions. [2023-08-24 10:12:47,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 61 transitions, 279 flow [2023-08-24 10:12:47,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 10:12:47,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 10:12:47,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 803 transitions. [2023-08-24 10:12:47,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4461111111111111 [2023-08-24 10:12:47,692 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 803 transitions. [2023-08-24 10:12:47,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 803 transitions. [2023-08-24 10:12:47,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:12:47,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 803 transitions. [2023-08-24 10:12:47,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:47,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 600.0) internal successors, (2400), 4 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:47,698 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 600.0) internal successors, (2400), 4 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:47,698 INFO L175 Difference]: Start difference. First operand has 37 places, 38 transitions, 112 flow. Second operand 3 states and 803 transitions. [2023-08-24 10:12:47,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 61 transitions, 279 flow [2023-08-24 10:12:47,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 61 transitions, 278 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 10:12:47,700 INFO L231 Difference]: Finished difference. Result has 39 places, 41 transitions, 137 flow [2023-08-24 10:12:47,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=600, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=39, PETRI_TRANSITIONS=41} [2023-08-24 10:12:47,701 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2023-08-24 10:12:47,701 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 41 transitions, 137 flow [2023-08-24 10:12:47,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:47,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:12:47,702 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, 1, 1, 1] [2023-08-24 10:12:47,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 10:12:47,702 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 10:12:47,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:12:47,702 INFO L85 PathProgramCache]: Analyzing trace with hash -296266314, now seen corresponding path program 1 times [2023-08-24 10:12:47,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:12:47,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327215746] [2023-08-24 10:12:47,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:12:47,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:12:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:12:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 10:12:47,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:12:47,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327215746] [2023-08-24 10:12:47,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327215746] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:12:47,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851152404] [2023-08-24 10:12:47,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:12:47,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:12:47,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:12:47,832 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 10:12:47,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-24 10:12:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:12:47,975 INFO L262 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 10:12:47,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:12:48,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 10:12:48,043 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:12:48,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 10:12:48,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851152404] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 10:12:48,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 10:12:48,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-24 10:12:48,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396638750] [2023-08-24 10:12:48,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 10:12:48,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-24 10:12:48,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:12:48,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-24 10:12:48,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-08-24 10:12:48,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 600 [2023-08-24 10:12:48,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 41 transitions, 137 flow. Second operand has 12 states, 12 states have (on average 213.91666666666666) internal successors, (2567), 12 states have internal predecessors, (2567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:48,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:12:48,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 600 [2023-08-24 10:12:48,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:12:48,602 INFO L124 PetriNetUnfolderBase]: 2230/3081 cut-off events. [2023-08-24 10:12:48,602 INFO L125 PetriNetUnfolderBase]: For 225/225 co-relation queries the response was YES. [2023-08-24 10:12:48,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6779 conditions, 3081 events. 2230/3081 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 14171 event pairs, 790 based on Foata normal form. 0/2132 useless extension candidates. Maximal degree in co-relation 4085. Up to 1468 conditions per place. [2023-08-24 10:12:48,622 INFO L140 encePairwiseOnDemand]: 589/600 looper letters, 90 selfloop transitions, 22 changer transitions 0/114 dead transitions. [2023-08-24 10:12:48,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 114 transitions, 589 flow [2023-08-24 10:12:48,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 10:12:48,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 10:12:48,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2215 transitions. [2023-08-24 10:12:48,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36916666666666664 [2023-08-24 10:12:48,629 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2215 transitions. [2023-08-24 10:12:48,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2215 transitions. [2023-08-24 10:12:48,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:12:48,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2215 transitions. [2023-08-24 10:12:48,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 221.5) internal successors, (2215), 10 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:48,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 600.0) internal successors, (6600), 11 states have internal predecessors, (6600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:48,645 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 600.0) internal successors, (6600), 11 states have internal predecessors, (6600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:48,645 INFO L175 Difference]: Start difference. First operand has 39 places, 41 transitions, 137 flow. Second operand 10 states and 2215 transitions. [2023-08-24 10:12:48,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 114 transitions, 589 flow [2023-08-24 10:12:48,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 114 transitions, 579 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 10:12:48,649 INFO L231 Difference]: Finished difference. Result has 52 places, 57 transitions, 292 flow [2023-08-24 10:12:48,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=600, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=292, PETRI_PLACES=52, PETRI_TRANSITIONS=57} [2023-08-24 10:12:48,650 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 15 predicate places. [2023-08-24 10:12:48,650 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 57 transitions, 292 flow [2023-08-24 10:12:48,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 213.91666666666666) internal successors, (2567), 12 states have internal predecessors, (2567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:48,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:12:48,652 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, 1, 1, 1, 1] [2023-08-24 10:12:48,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-24 10:12:48,857 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,SelfDestructingSolverStorable3 [2023-08-24 10:12:48,858 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 10:12:48,858 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:12:48,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1525373573, now seen corresponding path program 1 times [2023-08-24 10:12:48,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:12:48,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489040923] [2023-08-24 10:12:48,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:12:48,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:12:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:12:49,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 10:12:49,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:12:49,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489040923] [2023-08-24 10:12:49,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489040923] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:12:49,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938739260] [2023-08-24 10:12:49,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:12:49,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:12:49,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:12:49,050 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 10:12:49,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-24 10:12:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:12:49,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 10:12:49,192 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:12:49,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 10:12:49,240 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:12:49,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 10:12:49,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938739260] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 10:12:49,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 10:12:49,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-24 10:12:49,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125860682] [2023-08-24 10:12:49,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 10:12:49,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-24 10:12:49,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:12:49,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-24 10:12:49,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-08-24 10:12:49,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 600 [2023-08-24 10:12:49,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 57 transitions, 292 flow. Second operand has 12 states, 12 states have (on average 210.0) internal successors, (2520), 12 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:49,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:12:49,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 600 [2023-08-24 10:12:49,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:12:49,629 INFO L124 PetriNetUnfolderBase]: 1642/2243 cut-off events. [2023-08-24 10:12:49,629 INFO L125 PetriNetUnfolderBase]: For 376/393 co-relation queries the response was YES. [2023-08-24 10:12:49,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5583 conditions, 2243 events. 1642/2243 cut-off events. For 376/393 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 9048 event pairs, 823 based on Foata normal form. 17/1625 useless extension candidates. Maximal degree in co-relation 5042. Up to 1987 conditions per place. [2023-08-24 10:12:49,643 INFO L140 encePairwiseOnDemand]: 589/600 looper letters, 33 selfloop transitions, 9 changer transitions 38/82 dead transitions. [2023-08-24 10:12:49,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 82 transitions, 522 flow [2023-08-24 10:12:49,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 10:12:49,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 10:12:49,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1730 transitions. [2023-08-24 10:12:49,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36041666666666666 [2023-08-24 10:12:49,649 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1730 transitions. [2023-08-24 10:12:49,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1730 transitions. [2023-08-24 10:12:49,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:12:49,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1730 transitions. [2023-08-24 10:12:49,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 216.25) internal successors, (1730), 8 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:49,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 600.0) internal successors, (5400), 9 states have internal predecessors, (5400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:49,660 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 600.0) internal successors, (5400), 9 states have internal predecessors, (5400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:49,660 INFO L175 Difference]: Start difference. First operand has 52 places, 57 transitions, 292 flow. Second operand 8 states and 1730 transitions. [2023-08-24 10:12:49,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 82 transitions, 522 flow [2023-08-24 10:12:49,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 82 transitions, 494 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-08-24 10:12:49,665 INFO L231 Difference]: Finished difference. Result has 60 places, 44 transitions, 210 flow [2023-08-24 10:12:49,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=600, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=210, PETRI_PLACES=60, PETRI_TRANSITIONS=44} [2023-08-24 10:12:49,665 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 23 predicate places. [2023-08-24 10:12:49,666 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 44 transitions, 210 flow [2023-08-24 10:12:49,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 210.0) internal successors, (2520), 12 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:49,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:12:49,667 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, 1, 1, 1] [2023-08-24 10:12:49,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-24 10:12:49,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:12:49,878 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 10:12:49,878 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:12:49,878 INFO L85 PathProgramCache]: Analyzing trace with hash -827810902, now seen corresponding path program 2 times [2023-08-24 10:12:49,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:12:49,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928093891] [2023-08-24 10:12:49,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:12:49,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:12:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:12:50,105 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-24 10:12:50,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:12:50,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928093891] [2023-08-24 10:12:50,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928093891] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:12:50,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270377129] [2023-08-24 10:12:50,106 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 10:12:50,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:12:50,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:12:50,107 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 10:12:50,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-24 10:12:50,233 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 10:12:50,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 10:12:50,235 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 10:12:50,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:12:50,285 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-24 10:12:50,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:12:50,353 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-24 10:12:50,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270377129] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-24 10:12:50,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-24 10:12:50,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2023-08-24 10:12:50,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917464899] [2023-08-24 10:12:50,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 10:12:50,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 10:12:50,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:12:50,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 10:12:50,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-08-24 10:12:50,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 600 [2023-08-24 10:12:50,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 44 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 215.33333333333334) internal successors, (1292), 6 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:50,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:12:50,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 600 [2023-08-24 10:12:50,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:12:50,645 INFO L124 PetriNetUnfolderBase]: 1804/2426 cut-off events. [2023-08-24 10:12:50,646 INFO L125 PetriNetUnfolderBase]: For 631/631 co-relation queries the response was YES. [2023-08-24 10:12:50,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6488 conditions, 2426 events. 1804/2426 cut-off events. For 631/631 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 10006 event pairs, 730 based on Foata normal form. 0/1829 useless extension candidates. Maximal degree in co-relation 6465. Up to 1822 conditions per place. [2023-08-24 10:12:50,661 INFO L140 encePairwiseOnDemand]: 595/600 looper letters, 57 selfloop transitions, 5 changer transitions 0/64 dead transitions. [2023-08-24 10:12:50,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 64 transitions, 401 flow [2023-08-24 10:12:50,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 10:12:50,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 10:12:50,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1319 transitions. [2023-08-24 10:12:50,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3663888888888889 [2023-08-24 10:12:50,666 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1319 transitions. [2023-08-24 10:12:50,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1319 transitions. [2023-08-24 10:12:50,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:12:50,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1319 transitions. [2023-08-24 10:12:50,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 219.83333333333334) internal successors, (1319), 6 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:50,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 600.0) internal successors, (4200), 7 states have internal predecessors, (4200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:50,675 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 600.0) internal successors, (4200), 7 states have internal predecessors, (4200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:50,675 INFO L175 Difference]: Start difference. First operand has 60 places, 44 transitions, 210 flow. Second operand 6 states and 1319 transitions. [2023-08-24 10:12:50,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 64 transitions, 401 flow [2023-08-24 10:12:50,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 64 transitions, 347 flow, removed 14 selfloop flow, removed 9 redundant places. [2023-08-24 10:12:50,686 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 185 flow [2023-08-24 10:12:50,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=600, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=185, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2023-08-24 10:12:50,687 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 11 predicate places. [2023-08-24 10:12:50,687 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 185 flow [2023-08-24 10:12:50,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 215.33333333333334) internal successors, (1292), 6 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:50,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:12:50,688 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, 1, 1, 1, 1] [2023-08-24 10:12:50,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-24 10:12:50,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:12:50,894 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 10:12:50,894 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:12:50,894 INFO L85 PathProgramCache]: Analyzing trace with hash 495019740, now seen corresponding path program 1 times [2023-08-24 10:12:50,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:12:50,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858088235] [2023-08-24 10:12:50,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:12:50,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:12:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:12:51,022 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 10:12:51,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:12:51,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858088235] [2023-08-24 10:12:51,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858088235] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:12:51,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092576656] [2023-08-24 10:12:51,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:12:51,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:12:51,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:12:51,024 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 10:12:51,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-24 10:12:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:12:51,155 INFO L262 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 10:12:51,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:12:51,207 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 10:12:51,208 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:12:51,266 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 10:12:51,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092576656] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-24 10:12:51,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-24 10:12:51,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2023-08-24 10:12:51,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300528423] [2023-08-24 10:12:51,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 10:12:51,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 10:12:51,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:12:51,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 10:12:51,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-08-24 10:12:51,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 600 [2023-08-24 10:12:51,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 185 flow. Second operand has 6 states, 6 states have (on average 211.5) internal successors, (1269), 6 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:51,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:12:51,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 600 [2023-08-24 10:12:51,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:12:51,476 INFO L124 PetriNetUnfolderBase]: 1346/1812 cut-off events. [2023-08-24 10:12:51,476 INFO L125 PetriNetUnfolderBase]: For 498/633 co-relation queries the response was YES. [2023-08-24 10:12:51,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4651 conditions, 1812 events. 1346/1812 cut-off events. For 498/633 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 7392 event pairs, 200 based on Foata normal form. 135/1527 useless extension candidates. Maximal degree in co-relation 4617. Up to 1279 conditions per place. [2023-08-24 10:12:51,488 INFO L140 encePairwiseOnDemand]: 593/600 looper letters, 50 selfloop transitions, 8 changer transitions 0/60 dead transitions. [2023-08-24 10:12:51,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 346 flow [2023-08-24 10:12:51,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 10:12:51,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 10:12:51,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1291 transitions. [2023-08-24 10:12:51,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3586111111111111 [2023-08-24 10:12:51,492 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1291 transitions. [2023-08-24 10:12:51,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1291 transitions. [2023-08-24 10:12:51,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:12:51,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1291 transitions. [2023-08-24 10:12:51,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 215.16666666666666) internal successors, (1291), 6 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:51,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 600.0) internal successors, (4200), 7 states have internal predecessors, (4200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:51,500 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 600.0) internal successors, (4200), 7 states have internal predecessors, (4200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:51,500 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 185 flow. Second operand 6 states and 1291 transitions. [2023-08-24 10:12:51,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 346 flow [2023-08-24 10:12:51,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 60 transitions, 331 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-24 10:12:51,505 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 210 flow [2023-08-24 10:12:51,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=600, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2023-08-24 10:12:51,506 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 15 predicate places. [2023-08-24 10:12:51,506 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 210 flow [2023-08-24 10:12:51,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.5) internal successors, (1269), 6 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:51,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:12:51,507 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, 1, 1, 1, 1, 1] [2023-08-24 10:12:51,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-24 10:12:51,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:12:51,713 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 10:12:51,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:12:51,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1020146927, now seen corresponding path program 1 times [2023-08-24 10:12:51,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:12:51,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477040326] [2023-08-24 10:12:51,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:12:51,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:12:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:12:51,823 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-24 10:12:51,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:12:51,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477040326] [2023-08-24 10:12:51,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477040326] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 10:12:51,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 10:12:51,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 10:12:51,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465497949] [2023-08-24 10:12:51,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 10:12:51,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 10:12:51,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:12:51,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 10:12:51,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 10:12:51,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 600 [2023-08-24 10:12:51,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 243.66666666666666) internal successors, (1462), 6 states have internal predecessors, (1462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:51,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:12:51,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 600 [2023-08-24 10:12:51,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:12:52,243 INFO L124 PetriNetUnfolderBase]: 1889/2588 cut-off events. [2023-08-24 10:12:52,243 INFO L125 PetriNetUnfolderBase]: For 1087/1301 co-relation queries the response was YES. [2023-08-24 10:12:52,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6932 conditions, 2588 events. 1889/2588 cut-off events. For 1087/1301 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 11236 event pairs, 48 based on Foata normal form. 288/2376 useless extension candidates. Maximal degree in co-relation 6896. Up to 866 conditions per place. [2023-08-24 10:12:52,262 INFO L140 encePairwiseOnDemand]: 593/600 looper letters, 110 selfloop transitions, 12 changer transitions 0/123 dead transitions. [2023-08-24 10:12:52,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 123 transitions, 696 flow [2023-08-24 10:12:52,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 10:12:52,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 10:12:52,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1778 transitions. [2023-08-24 10:12:52,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42333333333333334 [2023-08-24 10:12:52,268 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1778 transitions. [2023-08-24 10:12:52,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1778 transitions. [2023-08-24 10:12:52,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:12:52,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1778 transitions. [2023-08-24 10:12:52,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:52,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 600.0) internal successors, (4800), 8 states have internal predecessors, (4800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:52,293 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 600.0) internal successors, (4800), 8 states have internal predecessors, (4800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:52,293 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 210 flow. Second operand 7 states and 1778 transitions. [2023-08-24 10:12:52,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 123 transitions, 696 flow [2023-08-24 10:12:52,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 123 transitions, 680 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-24 10:12:52,300 INFO L231 Difference]: Finished difference. Result has 58 places, 55 transitions, 299 flow [2023-08-24 10:12:52,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=600, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=299, PETRI_PLACES=58, PETRI_TRANSITIONS=55} [2023-08-24 10:12:52,301 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 21 predicate places. [2023-08-24 10:12:52,301 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 299 flow [2023-08-24 10:12:52,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 243.66666666666666) internal successors, (1462), 6 states have internal predecessors, (1462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:52,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:12:52,302 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, 1, 1, 1, 1, 1] [2023-08-24 10:12:52,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 10:12:52,302 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 10:12:52,302 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:12:52,302 INFO L85 PathProgramCache]: Analyzing trace with hash 470588981, now seen corresponding path program 2 times [2023-08-24 10:12:52,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:12:52,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997009449] [2023-08-24 10:12:52,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:12:52,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:12:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:12:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-24 10:12:52,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:12:52,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997009449] [2023-08-24 10:12:52,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997009449] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:12:52,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377135034] [2023-08-24 10:12:52,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 10:12:52,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:12:52,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:12:52,426 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 10:12:52,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-24 10:12:52,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 10:12:52,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 10:12:52,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 10:12:52,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:12:52,750 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 10:12:52,750 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:12:52,801 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-24 10:12:52,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377135034] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-24 10:12:52,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-24 10:12:52,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2023-08-24 10:12:52,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324995707] [2023-08-24 10:12:52,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 10:12:52,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 10:12:52,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:12:52,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 10:12:52,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-08-24 10:12:52,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 600 [2023-08-24 10:12:52,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 299 flow. Second operand has 6 states, 6 states have (on average 215.66666666666666) internal successors, (1294), 6 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:52,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:12:52,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 600 [2023-08-24 10:12:52,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:12:53,105 INFO L124 PetriNetUnfolderBase]: 1942/2638 cut-off events. [2023-08-24 10:12:53,106 INFO L125 PetriNetUnfolderBase]: For 3341/3648 co-relation queries the response was YES. [2023-08-24 10:12:53,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7837 conditions, 2638 events. 1942/2638 cut-off events. For 3341/3648 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 10449 event pairs, 555 based on Foata normal form. 411/2481 useless extension candidates. Maximal degree in co-relation 7799. Up to 1498 conditions per place. [2023-08-24 10:12:53,123 INFO L140 encePairwiseOnDemand]: 593/600 looper letters, 62 selfloop transitions, 13 changer transitions 0/77 dead transitions. [2023-08-24 10:12:53,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 548 flow [2023-08-24 10:12:53,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 10:12:53,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 10:12:53,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1318 transitions. [2023-08-24 10:12:53,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3661111111111111 [2023-08-24 10:12:53,160 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1318 transitions. [2023-08-24 10:12:53,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1318 transitions. [2023-08-24 10:12:53,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:12:53,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1318 transitions. [2023-08-24 10:12:53,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 219.66666666666666) internal successors, (1318), 6 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:53,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 600.0) internal successors, (4200), 7 states have internal predecessors, (4200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:53,168 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 600.0) internal successors, (4200), 7 states have internal predecessors, (4200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:53,168 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 299 flow. Second operand 6 states and 1318 transitions. [2023-08-24 10:12:53,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 548 flow [2023-08-24 10:12:53,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 77 transitions, 525 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-24 10:12:53,178 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 342 flow [2023-08-24 10:12:53,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=600, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=342, PETRI_PLACES=63, PETRI_TRANSITIONS=57} [2023-08-24 10:12:53,179 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 26 predicate places. [2023-08-24 10:12:53,179 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 342 flow [2023-08-24 10:12:53,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 215.66666666666666) internal successors, (1294), 6 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:12:53,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:12:53,180 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, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:12:53,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-24 10:12:53,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:12:53,386 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 10:12:53,386 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:12:53,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1758351541, now seen corresponding path program 1 times [2023-08-24 10:12:53,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:12:53,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347182747] [2023-08-24 10:12:53,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:12:53,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:12:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:12:55,619 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-24 10:12:55,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:12:55,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347182747] [2023-08-24 10:12:55,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347182747] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:12:55,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835358632] [2023-08-24 10:12:55,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:12:55,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:12:55,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:12:55,625 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 10:12:55,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-24 10:12:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:12:55,784 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 73 conjunts are in the unsatisfiable core [2023-08-24 10:12:55,787 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:12:55,870 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 10:12:55,948 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 10:12:55,949 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 11 treesize of output 11 [2023-08-24 10:12:56,079 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:12:56,079 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 28 treesize of output 20 [2023-08-24 10:12:56,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:12:56,398 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 16 treesize of output 18 [2023-08-24 10:12:56,681 INFO L322 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2023-08-24 10:12:56,681 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2023-08-24 10:12:57,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:12:57,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:12:57,122 INFO L322 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2023-08-24 10:12:57,124 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 111 treesize of output 124 [2023-08-24 10:12:58,840 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:12:58,841 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 269 treesize of output 573 [2023-08-24 10:13:04,726 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 19 treesize of output 15 [2023-08-24 10:13:14,950 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 26 treesize of output 20 [2023-08-24 10:13:15,202 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 19 treesize of output 15 [2023-08-24 10:13:16,476 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 24 treesize of output 18 [2023-08-24 10:13:17,829 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 26 treesize of output 20 [2023-08-24 10:13:17,895 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 19 treesize of output 15 [2023-08-24 10:13:19,003 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 21 treesize of output 17 [2023-08-24 10:13:19,193 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 26 treesize of output 20 [2023-08-24 10:13:19,425 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 21 treesize of output 17 [2023-08-24 10:13:19,481 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 21 treesize of output 17 [2023-08-24 10:13:19,569 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 19 treesize of output 15 [2023-08-24 10:13:19,735 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 21 treesize of output 17 [2023-08-24 10:13:19,810 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 7 treesize of output 3 [2023-08-24 10:13:19,813 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 19 treesize of output 11 [2023-08-24 10:13:19,821 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 19 treesize of output 11 [2023-08-24 10:13:19,831 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-24 10:13:19,831 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:13:20,088 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~C~0.offset 4))) (and (or (< |c_thread1Thread1of1ForFork1_#t~mem4| c_~maxb~0) (let ((.cse0 (+ (* c_thread1Thread1of1ForFork1_~i~0 4) c_~B~0.offset))) (and (forall ((v_ArrVal_569 (Array Int Int))) (<= c_~maxc~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_569) c_~B~0.base) .cse0) c_~maxa~0))) (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_569))) (<= (select (select .cse1 c_~C~0.base) .cse2) (+ (select (select .cse1 c_~B~0.base) .cse0) c_~maxa~0))))))) (or (<= c_~maxb~0 |c_thread1Thread1of1ForFork1_#t~mem4|) (let ((.cse3 (+ c_~maxa~0 c_~maxb~0))) (and (<= c_~maxc~0 .cse3) (forall ((v_ArrVal_569 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_569) c_~C~0.base) .cse2) .cse3))))))) is different from false [2023-08-24 10:13:20,281 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_thread2Thread1of1ForFork2_~i~1#1| 4))) (let ((.cse0 (+ c_~maxa~0 c_~maxb~0)) (.cse1 (+ (select (select |c_#memory_int| c_~B~0.base) (+ .cse3 c_~B~0.offset)) (select (select |c_#memory_int| c_~A~0.base) (+ .cse3 c_~A~0.offset)))) (.cse4 (+ (* c_thread1Thread1of1ForFork1_~i~0 4) c_~B~0.offset)) (.cse2 (select |c_#memory_int| c_~C~0.base))) (and (or (<= c_~maxc~0 .cse0) (forall ((~C~0.offset Int) (v_ArrVal_567 Int)) (or (< .cse1 v_ArrVal_567) (<= c_~maxb~0 (select (select (store |c_#memory_int| c_~C~0.base (store .cse2 (+ .cse3 ~C~0.offset) v_ArrVal_567)) c_~B~0.base) .cse4))))) (forall ((v_ArrVal_567 Int)) (or (< .cse1 v_ArrVal_567) (forall ((~C~0.offset Int)) (let ((.cse6 (store |c_#memory_int| c_~C~0.base (store .cse2 (+ .cse3 ~C~0.offset) v_ArrVal_567)))) (or (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse5 (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_569))) (<= (select (select .cse5 c_~C~0.base) (+ ~C~0.offset 4)) (+ (select (select .cse5 c_~B~0.base) .cse4) c_~maxa~0)))) (< (select (select .cse6 c_~B~0.base) .cse4) c_~maxb~0)))))) (forall ((v_ArrVal_567 Int)) (or (< .cse1 v_ArrVal_567) (forall ((~C~0.offset Int)) (let ((.cse7 (store |c_#memory_int| c_~C~0.base (store .cse2 (+ .cse3 ~C~0.offset) v_ArrVal_567)))) (or (<= c_~maxb~0 (select (select .cse7 c_~B~0.base) .cse4)) (forall ((v_ArrVal_569 (Array Int Int))) (<= (select (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_569) c_~C~0.base) (+ ~C~0.offset 4)) .cse0))))))) (forall ((v_ArrVal_567 Int)) (or (< .cse1 v_ArrVal_567) (forall ((~C~0.offset Int)) (let ((.cse8 (store |c_#memory_int| c_~C~0.base (store .cse2 (+ .cse3 ~C~0.offset) v_ArrVal_567)))) (or (forall ((v_ArrVal_569 (Array Int Int))) (<= c_~maxc~0 (+ (select (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_569) c_~B~0.base) .cse4) c_~maxa~0))) (< (select (select .cse8 c_~B~0.base) .cse4) c_~maxb~0))))))))) is different from false [2023-08-24 10:13:20,338 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~maxa~0 c_~maxb~0)) (.cse1 (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset 4)) (select (select |c_#memory_int| c_~B~0.base) (+ 4 c_~B~0.offset)))) (.cse3 (+ (* c_thread1Thread1of1ForFork1_~i~0 4) c_~B~0.offset)) (.cse2 (select |c_#memory_int| c_~C~0.base))) (and (or (<= c_~maxc~0 .cse0) (forall ((~C~0.offset Int) (v_ArrVal_567 Int)) (or (< .cse1 v_ArrVal_567) (<= c_~maxb~0 (select (select (store |c_#memory_int| c_~C~0.base (store .cse2 (+ ~C~0.offset 4) v_ArrVal_567)) c_~B~0.base) .cse3))))) (forall ((v_ArrVal_567 Int)) (or (forall ((~C~0.offset Int)) (let ((.cse5 (+ ~C~0.offset 4))) (let ((.cse4 (store |c_#memory_int| c_~C~0.base (store .cse2 .cse5 v_ArrVal_567)))) (or (forall ((v_ArrVal_569 (Array Int Int))) (<= (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_569) c_~C~0.base) .cse5) .cse0)) (<= c_~maxb~0 (select (select .cse4 c_~B~0.base) .cse3)))))) (< .cse1 v_ArrVal_567))) (forall ((v_ArrVal_567 Int)) (or (forall ((~C~0.offset Int)) (let ((.cse7 (+ ~C~0.offset 4))) (let ((.cse8 (store |c_#memory_int| c_~C~0.base (store .cse2 .cse7 v_ArrVal_567)))) (or (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse6 (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_569))) (<= (select (select .cse6 c_~C~0.base) .cse7) (+ (select (select .cse6 c_~B~0.base) .cse3) c_~maxa~0)))) (< (select (select .cse8 c_~B~0.base) .cse3) c_~maxb~0))))) (< .cse1 v_ArrVal_567))) (forall ((v_ArrVal_567 Int)) (or (< .cse1 v_ArrVal_567) (forall ((~C~0.offset Int)) (let ((.cse9 (store |c_#memory_int| c_~C~0.base (store .cse2 (+ ~C~0.offset 4) v_ArrVal_567)))) (or (forall ((v_ArrVal_569 (Array Int Int))) (<= c_~maxc~0 (+ (select (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_569) c_~B~0.base) .cse3) c_~maxa~0))) (< (select (select .cse9 c_~B~0.base) .cse3) c_~maxb~0)))))))) is different from false [2023-08-24 10:13:20,440 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* c_thread1Thread1of1ForFork1_~i~0 4) c_~B~0.offset)) (.cse0 (+ c_~maxa~0 c_~maxb~0)) (.cse3 (+ 4 c_~B~0.offset)) (.cse4 (+ c_~A~0.offset 4))) (and (or (<= c_~maxc~0 .cse0) (forall ((~C~0.offset Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_567 Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_566))) (or (<= c_~maxb~0 (select (select (store .cse1 c_~C~0.base (store (select .cse1 c_~C~0.base) (+ ~C~0.offset 4) v_ArrVal_567)) c_~B~0.base) .cse2)) (< (+ (select (select .cse1 c_~B~0.base) .cse3) (select (select .cse1 c_~A~0.base) .cse4)) v_ArrVal_567))))) (forall ((v_ArrVal_566 (Array Int Int)) (v_ArrVal_567 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_566))) (or (forall ((~C~0.offset Int)) (let ((.cse5 (store .cse6 c_~C~0.base (store (select .cse6 c_~C~0.base) (+ ~C~0.offset 4) v_ArrVal_567)))) (or (< (select (select .cse5 c_~B~0.base) .cse2) c_~maxb~0) (forall ((v_ArrVal_569 (Array Int Int))) (<= c_~maxc~0 (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_569) c_~B~0.base) .cse2) c_~maxa~0)))))) (< (+ (select (select .cse6 c_~B~0.base) .cse3) (select (select .cse6 c_~A~0.base) .cse4)) v_ArrVal_567)))) (forall ((v_ArrVal_566 (Array Int Int)) (v_ArrVal_567 Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_566))) (or (forall ((~C~0.offset Int)) (let ((.cse8 (+ ~C~0.offset 4))) (let ((.cse9 (store .cse10 c_~C~0.base (store (select .cse10 c_~C~0.base) .cse8 v_ArrVal_567)))) (or (forall ((v_ArrVal_569 (Array Int Int))) (let ((.cse7 (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_569))) (<= (select (select .cse7 c_~C~0.base) .cse8) (+ (select (select .cse7 c_~B~0.base) .cse2) c_~maxa~0)))) (< (select (select .cse9 c_~B~0.base) .cse2) c_~maxb~0))))) (< (+ (select (select .cse10 c_~B~0.base) .cse3) (select (select .cse10 c_~A~0.base) .cse4)) v_ArrVal_567)))) (forall ((v_ArrVal_566 (Array Int Int)) (v_ArrVal_567 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_566))) (or (forall ((~C~0.offset Int)) (let ((.cse12 (+ ~C~0.offset 4))) (let ((.cse11 (store .cse13 c_~C~0.base (store (select .cse13 c_~C~0.base) .cse12 v_ArrVal_567)))) (or (<= c_~maxb~0 (select (select .cse11 c_~B~0.base) .cse2)) (forall ((v_ArrVal_569 (Array Int Int))) (<= (select (select (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_569) c_~C~0.base) .cse12) .cse0)))))) (< (+ (select (select .cse13 c_~B~0.base) .cse3) (select (select .cse13 c_~A~0.base) .cse4)) v_ArrVal_567)))))) is different from false [2023-08-24 10:13:20,532 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:13:20,533 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 4215 treesize of output 4099 [2023-08-24 10:13:20,635 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 2145 treesize of output 2097 [2023-08-24 10:13:20,703 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:13:20,703 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 2181 treesize of output 2148 [2023-08-24 10:13:20,789 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:13:20,789 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 2157 treesize of output 2148 [2023-08-24 10:13:20,854 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 2117 treesize of output 2109 [2023-08-24 10:13:20,947 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:13:20,948 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 2149 treesize of output 2140 [2023-08-24 10:13:21,047 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:13:21,048 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 2241 treesize of output 2184 [2023-08-24 10:13:21,141 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:13:21,142 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 2153 treesize of output 2000 Received shutdown request... [2023-08-24 10:26:05,774 WARN L266 SmtUtils]: Removed 2 from assertion stack [2023-08-24 10:26:05,776 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-24 10:26:05,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-24 10:26:05,794 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 10:26:05,794 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 10:26:05,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:26:05,984 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 35 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 14 for 5ms.. [2023-08-24 10:26:05,986 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-08-24 10:26:05,986 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-08-24 10:26:05,986 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-08-24 10:26:05,986 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2023-08-24 10:26:05,989 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 10:26:05,989 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 10:26:05,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 10:26:05 BasicIcfg [2023-08-24 10:26:05,992 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 10:26:05,992 INFO L158 Benchmark]: Toolchain (without parser) took 810528.52ms. Allocated memory was 369.1MB in the beginning and 1.4GB in the end (delta: 1.0GB). Free memory was 344.9MB in the beginning and 1.2GB in the end (delta: -826.2MB). Peak memory consumption was 865.9MB. Max. memory is 16.0GB. [2023-08-24 10:26:05,992 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 369.1MB. Free memory was 346.2MB in the beginning and 346.1MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 10:26:05,993 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.83ms. Allocated memory is still 369.1MB. Free memory was 344.9MB in the beginning and 333.0MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-24 10:26:05,997 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.83ms. Allocated memory is still 369.1MB. Free memory was 333.0MB in the beginning and 330.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 10:26:05,997 INFO L158 Benchmark]: Boogie Preprocessor took 54.53ms. Allocated memory is still 369.1MB. Free memory was 330.1MB in the beginning and 328.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 10:26:05,997 INFO L158 Benchmark]: RCFGBuilder took 750.94ms. Allocated memory is still 369.1MB. Free memory was 328.0MB in the beginning and 295.2MB in the end (delta: 32.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-08-24 10:26:05,998 INFO L158 Benchmark]: TraceAbstraction took 809460.45ms. Allocated memory was 369.1MB in the beginning and 1.4GB in the end (delta: 1.0GB). Free memory was 294.4MB in the beginning and 1.2GB in the end (delta: -876.7MB). Peak memory consumption was 815.6MB. Max. memory is 16.0GB. [2023-08-24 10:26:05,999 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 369.1MB. Free memory was 346.2MB in the beginning and 346.1MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 208.83ms. Allocated memory is still 369.1MB. Free memory was 344.9MB in the beginning and 333.0MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 47.83ms. Allocated memory is still 369.1MB. Free memory was 333.0MB in the beginning and 330.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 54.53ms. Allocated memory is still 369.1MB. Free memory was 330.1MB in the beginning and 328.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 750.94ms. Allocated memory is still 369.1MB. Free memory was 328.0MB in the beginning and 295.2MB in the end (delta: 32.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 809460.45ms. Allocated memory was 369.1MB in the beginning and 1.4GB in the end (delta: 1.0GB). Free memory was 294.4MB in the beginning and 1.2GB in the end (delta: -876.7MB). Peak memory consumption was 815.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.6s, 260 PlacesBefore, 37 PlacesAfterwards, 277 TransitionsBefore, 35 TransitionsAfterwards, 2904 CoEnabledTransitionPairs, 7 FixpointIterations, 184 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 54 TrivialYvCompositions, 13 ConcurrentYvCompositions, 19 ChoiceCompositions, 310 TotalNumberOfCompositions, 4130 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3175, independent: 3075, independent conditional: 0, independent unconditional: 3075, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1598, independent: 1568, independent conditional: 0, independent unconditional: 1568, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3175, independent: 1507, independent conditional: 0, independent unconditional: 1507, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 1598, unknown conditional: 0, unknown unconditional: 1598] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 111, Positive conditional cache size: 0, Positive unconditional cache size: 111, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 35 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 14 for 5ms.. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 35 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 14 for 5ms.. - TimeoutResultAtElement [Line: 106]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 35 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 14 for 5ms.. - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 35 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 14 for 5ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 312 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: 809.3s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 370 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 370 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1080 IncrementalHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 9 mSDtfsCounter, 1080 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 360 GetRequests, 284 SyntacticMatches, 5 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=342occurred in iteration=9, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 421 NumberOfCodeBlocks, 421 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 549 ConstructedInterpolants, 0 QuantifiedInterpolants, 1270 SizeOfPredicates, 16 NumberOfNonLiveVariables, 2110 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 116/136 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