/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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/safe021_power.opt_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 03:56:45,536 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 03:56:45,620 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-27 03:56:45,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 03:56:45,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 03:56:45,657 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 03:56:45,657 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 03:56:45,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 03:56:45,658 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 03:56:45,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 03:56:45,662 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 03:56:45,662 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 03:56:45,662 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 03:56:45,664 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 03:56:45,664 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 03:56:45,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 03:56:45,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 03:56:45,665 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 03:56:45,665 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 03:56:45,665 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 03:56:45,665 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 03:56:45,666 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 03:56:45,666 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 03:56:45,667 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 03:56:45,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 03:56:45,667 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 03:56:45,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 03:56:45,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:56:45,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 03:56:45,668 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 03:56:45,669 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 03:56:45,669 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 03:56:45,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 03:56:45,669 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 03:56:45,670 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 03:56:45,670 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 03:56:46,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 03:56:46,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 03:56:46,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 03:56:46,022 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 03:56:46,022 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 03:56:46,024 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_power.opt_pso.opt.i [2023-08-27 03:56:47,273 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 03:56:47,542 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 03:56:47,543 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_power.opt_pso.opt.i [2023-08-27 03:56:47,558 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0118a1432/0b29217ef637429c9e18a4e3dce6f668/FLAGc5edf1d09 [2023-08-27 03:56:47,570 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0118a1432/0b29217ef637429c9e18a4e3dce6f668 [2023-08-27 03:56:47,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 03:56:47,574 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 03:56:47,575 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 03:56:47,575 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 03:56:47,577 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 03:56:47,578 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:56:47" (1/1) ... [2023-08-27 03:56:47,579 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b0d42ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:56:47, skipping insertion in model container [2023-08-27 03:56:47,579 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:56:47" (1/1) ... [2023-08-27 03:56:47,635 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 03:56:48,018 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:56:48,031 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 03:56:48,055 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:56:48,056 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:56:48,093 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:56:48,135 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:56:48,135 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:56:48,140 INFO L206 MainTranslator]: Completed translation [2023-08-27 03:56:48,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:56:48 WrapperNode [2023-08-27 03:56:48,141 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 03:56:48,141 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 03:56:48,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 03:56:48,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 03:56:48,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:56:48" (1/1) ... [2023-08-27 03:56:48,161 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:56:48" (1/1) ... [2023-08-27 03:56:48,186 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 153 [2023-08-27 03:56:48,186 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 03:56:48,187 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 03:56:48,187 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 03:56:48,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 03:56:48,194 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:56:48" (1/1) ... [2023-08-27 03:56:48,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:56:48" (1/1) ... [2023-08-27 03:56:48,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:56:48" (1/1) ... [2023-08-27 03:56:48,198 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:56:48" (1/1) ... [2023-08-27 03:56:48,205 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:56:48" (1/1) ... [2023-08-27 03:56:48,207 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:56:48" (1/1) ... [2023-08-27 03:56:48,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:56:48" (1/1) ... [2023-08-27 03:56:48,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:56:48" (1/1) ... [2023-08-27 03:56:48,214 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 03:56:48,215 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 03:56:48,215 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 03:56:48,215 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 03:56:48,216 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:56:48" (1/1) ... [2023-08-27 03:56:48,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:56:48,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 03:56:48,250 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-27 03:56:48,283 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-27 03:56:48,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 03:56:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 03:56:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 03:56:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 03:56:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 03:56:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 03:56:48,299 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 03:56:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 03:56:48,299 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 03:56:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 03:56:48,300 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 03:56:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 03:56:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 03:56:48,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 03:56:48,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 03:56:48,302 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 03:56:48,440 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 03:56:48,441 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 03:56:48,732 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 03:56:48,888 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 03:56:48,888 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 03:56:48,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:56:48 BoogieIcfgContainer [2023-08-27 03:56:48,891 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 03:56:48,894 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 03:56:48,894 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 03:56:48,896 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 03:56:48,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 03:56:47" (1/3) ... [2023-08-27 03:56:48,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8ac942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:56:48, skipping insertion in model container [2023-08-27 03:56:48,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:56:48" (2/3) ... [2023-08-27 03:56:48,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8ac942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:56:48, skipping insertion in model container [2023-08-27 03:56:48,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:56:48" (3/3) ... [2023-08-27 03:56:48,900 INFO L112 eAbstractionObserver]: Analyzing ICFG safe021_power.opt_pso.opt.i [2023-08-27 03:56:48,914 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 03:56:48,915 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-27 03:56:48,916 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 03:56:48,976 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 03:56:49,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 118 transitions, 251 flow [2023-08-27 03:56:49,047 INFO L124 PetriNetUnfolderBase]: 3/115 cut-off events. [2023-08-27 03:56:49,047 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:56:49,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 3/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 91 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-27 03:56:49,053 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 118 transitions, 251 flow [2023-08-27 03:56:49,056 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 115 transitions, 239 flow [2023-08-27 03:56:49,059 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 03:56:49,067 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 115 transitions, 239 flow [2023-08-27 03:56:49,069 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 115 transitions, 239 flow [2023-08-27 03:56:49,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 115 transitions, 239 flow [2023-08-27 03:56:49,100 INFO L124 PetriNetUnfolderBase]: 3/115 cut-off events. [2023-08-27 03:56:49,100 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:56:49,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 3/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 91 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-27 03:56:49,103 INFO L119 LiptonReduction]: Number of co-enabled transitions 2762 [2023-08-27 03:56:52,727 INFO L134 LiptonReduction]: Checked pairs total: 10167 [2023-08-27 03:56:52,727 INFO L136 LiptonReduction]: Total number of compositions: 101 [2023-08-27 03:56:52,741 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 03:56:52,746 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;@43d72e9d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 03:56:52,746 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-27 03:56:52,749 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 03:56:52,749 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-08-27 03:56:52,749 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:56:52,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:56:52,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 03:56:52,750 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:56:52,754 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:56:52,754 INFO L85 PathProgramCache]: Analyzing trace with hash 514164562, now seen corresponding path program 1 times [2023-08-27 03:56:52,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:56:52,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860383183] [2023-08-27 03:56:52,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:56:52,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:56:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:56:53,103 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-27 03:56:53,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:56:53,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860383183] [2023-08-27 03:56:53,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860383183] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:56:53,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:56:53,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:56:53,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17055059] [2023-08-27 03:56:53,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:56:53,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:56:53,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:56:53,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:56:53,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:56:53,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 219 [2023-08-27 03:56:53,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 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-27 03:56:53,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:56:53,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 219 [2023-08-27 03:56:53,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:56:53,586 INFO L124 PetriNetUnfolderBase]: 1764/2909 cut-off events. [2023-08-27 03:56:53,587 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-27 03:56:53,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5551 conditions, 2909 events. 1764/2909 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 17416 event pairs, 232 based on Foata normal form. 0/2306 useless extension candidates. Maximal degree in co-relation 5540. Up to 2173 conditions per place. [2023-08-27 03:56:53,616 INFO L140 encePairwiseOnDemand]: 215/219 looper letters, 36 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2023-08-27 03:56:53,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 176 flow [2023-08-27 03:56:53,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:56:53,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:56:53,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2023-08-27 03:56:53,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5053272450532724 [2023-08-27 03:56:53,634 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 332 transitions. [2023-08-27 03:56:53,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 332 transitions. [2023-08-27 03:56:53,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:56:53,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 332 transitions. [2023-08-27 03:56:53,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 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-27 03:56:53,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 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-27 03:56:53,648 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 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-27 03:56:53,650 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 3 states and 332 transitions. [2023-08-27 03:56:53,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 176 flow [2023-08-27 03:56:53,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 44 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 03:56:53,655 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 68 flow [2023-08-27 03:56:53,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2023-08-27 03:56:53,661 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-08-27 03:56:53,661 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 68 flow [2023-08-27 03:56:53,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 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-27 03:56:53,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:56:53,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 03:56:53,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 03:56:53,662 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:56:53,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:56:53,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1242020802, now seen corresponding path program 1 times [2023-08-27 03:56:53,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:56:53,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688726151] [2023-08-27 03:56:53,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:56:53,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:56:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:56:53,769 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-27 03:56:53,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:56:53,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688726151] [2023-08-27 03:56:53,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688726151] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:56:53,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:56:53,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:56:53,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553329765] [2023-08-27 03:56:53,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:56:53,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:56:53,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:56:53,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:56:53,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:56:53,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 219 [2023-08-27 03:56:53,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 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-27 03:56:53,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:56:53,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 219 [2023-08-27 03:56:53,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:56:54,070 INFO L124 PetriNetUnfolderBase]: 1421/2192 cut-off events. [2023-08-27 03:56:54,071 INFO L125 PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES. [2023-08-27 03:56:54,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4552 conditions, 2192 events. 1421/2192 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 11053 event pairs, 440 based on Foata normal form. 0/1656 useless extension candidates. Maximal degree in co-relation 4542. Up to 1666 conditions per place. [2023-08-27 03:56:54,084 INFO L140 encePairwiseOnDemand]: 209/219 looper letters, 40 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2023-08-27 03:56:54,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 47 transitions, 198 flow [2023-08-27 03:56:54,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:56:54,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:56:54,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2023-08-27 03:56:54,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5007610350076104 [2023-08-27 03:56:54,089 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 329 transitions. [2023-08-27 03:56:54,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 329 transitions. [2023-08-27 03:56:54,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:56:54,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 329 transitions. [2023-08-27 03:56:54,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 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-27 03:56:54,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 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-27 03:56:54,094 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 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-27 03:56:54,094 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 68 flow. Second operand 3 states and 329 transitions. [2023-08-27 03:56:54,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 47 transitions, 198 flow [2023-08-27 03:56:54,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 47 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:56:54,097 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 100 flow [2023-08-27 03:56:54,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2023-08-27 03:56:54,098 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2023-08-27 03:56:54,099 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 100 flow [2023-08-27 03:56:54,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 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-27 03:56:54,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:56:54,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:56:54,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 03:56:54,107 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:56:54,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:56:54,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1985969404, now seen corresponding path program 1 times [2023-08-27 03:56:54,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:56:54,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500460418] [2023-08-27 03:56:54,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:56:54,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:56:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:56:54,339 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-27 03:56:54,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:56:54,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500460418] [2023-08-27 03:56:54,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500460418] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:56:54,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:56:54,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:56:54,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314152308] [2023-08-27 03:56:54,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:56:54,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:56:54,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:56:54,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:56:54,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:56:54,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 219 [2023-08-27 03:56:54,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 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-27 03:56:54,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:56:54,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 219 [2023-08-27 03:56:54,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:56:54,719 INFO L124 PetriNetUnfolderBase]: 1306/2149 cut-off events. [2023-08-27 03:56:54,719 INFO L125 PetriNetUnfolderBase]: For 260/306 co-relation queries the response was YES. [2023-08-27 03:56:54,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5113 conditions, 2149 events. 1306/2149 cut-off events. For 260/306 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11851 event pairs, 280 based on Foata normal form. 0/1809 useless extension candidates. Maximal degree in co-relation 5102. Up to 1131 conditions per place. [2023-08-27 03:56:54,733 INFO L140 encePairwiseOnDemand]: 214/219 looper letters, 61 selfloop transitions, 5 changer transitions 0/72 dead transitions. [2023-08-27 03:56:54,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 72 transitions, 361 flow [2023-08-27 03:56:54,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:56:54,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:56:54,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 518 transitions. [2023-08-27 03:56:54,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4730593607305936 [2023-08-27 03:56:54,735 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 518 transitions. [2023-08-27 03:56:54,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 518 transitions. [2023-08-27 03:56:54,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:56:54,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 518 transitions. [2023-08-27 03:56:54,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 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-27 03:56:54,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 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-27 03:56:54,741 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 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-27 03:56:54,741 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 100 flow. Second operand 5 states and 518 transitions. [2023-08-27 03:56:54,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 72 transitions, 361 flow [2023-08-27 03:56:54,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 72 transitions, 350 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:56:54,748 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 130 flow [2023-08-27 03:56:54,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=130, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2023-08-27 03:56:54,749 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-08-27 03:56:54,749 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 130 flow [2023-08-27 03:56:54,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 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-27 03:56:54,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:56:54,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:56:54,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 03:56:54,754 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:56:54,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:56:54,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1435540076, now seen corresponding path program 1 times [2023-08-27 03:56:54,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:56:54,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147052827] [2023-08-27 03:56:54,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:56:54,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:56:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:56:55,293 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-27 03:56:55,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:56:55,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147052827] [2023-08-27 03:56:55,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147052827] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:56:55,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:56:55,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:56:55,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837821795] [2023-08-27 03:56:55,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:56:55,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:56:55,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:56:55,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:56:55,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:56:55,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 219 [2023-08-27 03:56:55,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 82.2) internal successors, (411), 5 states have internal predecessors, (411), 0 states have call successors, (0), 0 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-27 03:56:55,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:56:55,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 219 [2023-08-27 03:56:55,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:56:56,117 INFO L124 PetriNetUnfolderBase]: 2919/4448 cut-off events. [2023-08-27 03:56:56,117 INFO L125 PetriNetUnfolderBase]: For 2526/2566 co-relation queries the response was YES. [2023-08-27 03:56:56,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11442 conditions, 4448 events. 2919/4448 cut-off events. For 2526/2566 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 23447 event pairs, 296 based on Foata normal form. 145/4250 useless extension candidates. Maximal degree in co-relation 11426. Up to 1997 conditions per place. [2023-08-27 03:56:56,147 INFO L140 encePairwiseOnDemand]: 208/219 looper letters, 97 selfloop transitions, 30 changer transitions 0/130 dead transitions. [2023-08-27 03:56:56,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 130 transitions, 690 flow [2023-08-27 03:56:56,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 03:56:56,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 03:56:56,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 835 transitions. [2023-08-27 03:56:56,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42364282090309485 [2023-08-27 03:56:56,151 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 835 transitions. [2023-08-27 03:56:56,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 835 transitions. [2023-08-27 03:56:56,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:56:56,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 835 transitions. [2023-08-27 03:56:56,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 92.77777777777777) internal successors, (835), 9 states have internal predecessors, (835), 0 states have call successors, (0), 0 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-27 03:56:56,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 219.0) internal successors, (2190), 10 states have internal predecessors, (2190), 0 states have call successors, (0), 0 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-27 03:56:56,157 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 219.0) internal successors, (2190), 10 states have internal predecessors, (2190), 0 states have call successors, (0), 0 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-27 03:56:56,157 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 130 flow. Second operand 9 states and 835 transitions. [2023-08-27 03:56:56,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 130 transitions, 690 flow [2023-08-27 03:56:56,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 130 transitions, 690 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 03:56:56,164 INFO L231 Difference]: Finished difference. Result has 62 places, 62 transitions, 384 flow [2023-08-27 03:56:56,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=384, PETRI_PLACES=62, PETRI_TRANSITIONS=62} [2023-08-27 03:56:56,165 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 22 predicate places. [2023-08-27 03:56:56,165 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 62 transitions, 384 flow [2023-08-27 03:56:56,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.2) internal successors, (411), 5 states have internal predecessors, (411), 0 states have call successors, (0), 0 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-27 03:56:56,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:56:56,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:56:56,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 03:56:56,166 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:56:56,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:56:56,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1436923916, now seen corresponding path program 2 times [2023-08-27 03:56:56,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:56:56,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219901587] [2023-08-27 03:56:56,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:56:56,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:56:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:56:56,510 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-27 03:56:56,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:56:56,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219901587] [2023-08-27 03:56:56,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219901587] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:56:56,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:56:56,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:56:56,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318486849] [2023-08-27 03:56:56,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:56:56,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:56:56,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:56:56,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:56:56,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:56:56,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 219 [2023-08-27 03:56:56,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 62 transitions, 384 flow. Second operand has 6 states, 6 states have (on average 81.83333333333333) internal successors, (491), 6 states have internal predecessors, (491), 0 states have call successors, (0), 0 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-27 03:56:56,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:56:56,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 219 [2023-08-27 03:56:56,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:56:57,373 INFO L124 PetriNetUnfolderBase]: 3870/5942 cut-off events. [2023-08-27 03:56:57,374 INFO L125 PetriNetUnfolderBase]: For 16690/16831 co-relation queries the response was YES. [2023-08-27 03:56:57,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22176 conditions, 5942 events. 3870/5942 cut-off events. For 16690/16831 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 33244 event pairs, 505 based on Foata normal form. 137/5512 useless extension candidates. Maximal degree in co-relation 22150. Up to 1852 conditions per place. [2023-08-27 03:56:57,426 INFO L140 encePairwiseOnDemand]: 213/219 looper letters, 132 selfloop transitions, 16 changer transitions 0/151 dead transitions. [2023-08-27 03:56:57,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 151 transitions, 1118 flow [2023-08-27 03:56:57,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:56:57,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:56:57,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 658 transitions. [2023-08-27 03:56:57,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4292237442922374 [2023-08-27 03:56:57,429 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 658 transitions. [2023-08-27 03:56:57,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 658 transitions. [2023-08-27 03:56:57,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:56:57,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 658 transitions. [2023-08-27 03:56:57,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 0 states have call successors, (0), 0 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-27 03:56:57,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 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-27 03:56:57,434 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 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-27 03:56:57,434 INFO L175 Difference]: Start difference. First operand has 62 places, 62 transitions, 384 flow. Second operand 7 states and 658 transitions. [2023-08-27 03:56:57,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 151 transitions, 1118 flow [2023-08-27 03:56:57,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 151 transitions, 1116 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-27 03:56:57,485 INFO L231 Difference]: Finished difference. Result has 72 places, 69 transitions, 500 flow [2023-08-27 03:56:57,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=500, PETRI_PLACES=72, PETRI_TRANSITIONS=69} [2023-08-27 03:56:57,487 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 32 predicate places. [2023-08-27 03:56:57,487 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 69 transitions, 500 flow [2023-08-27 03:56:57,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.83333333333333) internal successors, (491), 6 states have internal predecessors, (491), 0 states have call successors, (0), 0 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-27 03:56:57,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:56:57,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:56:57,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 03:56:57,488 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:56:57,488 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:56:57,488 INFO L85 PathProgramCache]: Analyzing trace with hash 989894234, now seen corresponding path program 1 times [2023-08-27 03:56:57,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:56:57,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581006085] [2023-08-27 03:56:57,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:56:57,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:56:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:56:57,566 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-27 03:56:57,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:56:57,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581006085] [2023-08-27 03:56:57,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581006085] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:56:57,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:56:57,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:56:57,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052640691] [2023-08-27 03:56:57,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:56:57,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:56:57,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:56:57,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:56:57,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:56:57,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 219 [2023-08-27 03:56:57,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 69 transitions, 500 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 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-27 03:56:57,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:56:57,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 219 [2023-08-27 03:56:57,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:56:58,194 INFO L124 PetriNetUnfolderBase]: 2702/4121 cut-off events. [2023-08-27 03:56:58,195 INFO L125 PetriNetUnfolderBase]: For 15628/15672 co-relation queries the response was YES. [2023-08-27 03:56:58,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16722 conditions, 4121 events. 2702/4121 cut-off events. For 15628/15672 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 23032 event pairs, 593 based on Foata normal form. 10/3701 useless extension candidates. Maximal degree in co-relation 16690. Up to 2751 conditions per place. [2023-08-27 03:56:58,231 INFO L140 encePairwiseOnDemand]: 212/219 looper letters, 88 selfloop transitions, 4 changer transitions 0/104 dead transitions. [2023-08-27 03:56:58,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 104 transitions, 977 flow [2023-08-27 03:56:58,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:56:58,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:56:58,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 416 transitions. [2023-08-27 03:56:58,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4748858447488584 [2023-08-27 03:56:58,233 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 416 transitions. [2023-08-27 03:56:58,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 416 transitions. [2023-08-27 03:56:58,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:56:58,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 416 transitions. [2023-08-27 03:56:58,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 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-27 03:56:58,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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-27 03:56:58,236 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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-27 03:56:58,236 INFO L175 Difference]: Start difference. First operand has 72 places, 69 transitions, 500 flow. Second operand 4 states and 416 transitions. [2023-08-27 03:56:58,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 104 transitions, 977 flow [2023-08-27 03:56:58,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 104 transitions, 965 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-08-27 03:56:58,306 INFO L231 Difference]: Finished difference. Result has 72 places, 66 transitions, 490 flow [2023-08-27 03:56:58,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=490, PETRI_PLACES=72, PETRI_TRANSITIONS=66} [2023-08-27 03:56:58,307 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 32 predicate places. [2023-08-27 03:56:58,307 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 66 transitions, 490 flow [2023-08-27 03:56:58,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 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-27 03:56:58,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:56:58,307 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:56:58,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 03:56:58,308 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:56:58,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:56:58,308 INFO L85 PathProgramCache]: Analyzing trace with hash -443994705, now seen corresponding path program 1 times [2023-08-27 03:56:58,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:56:58,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659202994] [2023-08-27 03:56:58,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:56:58,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:56:58,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:56:58,352 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-27 03:56:58,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:56:58,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659202994] [2023-08-27 03:56:58,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659202994] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:56:58,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:56:58,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:56:58,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111049050] [2023-08-27 03:56:58,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:56:58,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:56:58,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:56:58,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:56:58,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:56:58,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 219 [2023-08-27 03:56:58,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 66 transitions, 490 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 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-27 03:56:58,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:56:58,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 219 [2023-08-27 03:56:58,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:56:58,829 INFO L124 PetriNetUnfolderBase]: 2140/3251 cut-off events. [2023-08-27 03:56:58,830 INFO L125 PetriNetUnfolderBase]: For 12644/12672 co-relation queries the response was YES. [2023-08-27 03:56:58,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13622 conditions, 3251 events. 2140/3251 cut-off events. For 12644/12672 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 17574 event pairs, 489 based on Foata normal form. 10/3189 useless extension candidates. Maximal degree in co-relation 13588. Up to 1283 conditions per place. [2023-08-27 03:56:58,857 INFO L140 encePairwiseOnDemand]: 212/219 looper letters, 110 selfloop transitions, 7 changer transitions 0/129 dead transitions. [2023-08-27 03:56:58,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 129 transitions, 1216 flow [2023-08-27 03:56:58,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:56:58,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:56:58,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 432 transitions. [2023-08-27 03:56:58,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4931506849315068 [2023-08-27 03:56:58,859 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 432 transitions. [2023-08-27 03:56:58,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 432 transitions. [2023-08-27 03:56:58,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:56:58,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 432 transitions. [2023-08-27 03:56:58,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 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-27 03:56:58,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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-27 03:56:58,862 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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-27 03:56:58,862 INFO L175 Difference]: Start difference. First operand has 72 places, 66 transitions, 490 flow. Second operand 4 states and 432 transitions. [2023-08-27 03:56:58,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 129 transitions, 1216 flow [2023-08-27 03:56:58,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 129 transitions, 1192 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-27 03:56:58,885 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 520 flow [2023-08-27 03:56:58,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=520, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2023-08-27 03:56:58,886 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 33 predicate places. [2023-08-27 03:56:58,886 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 520 flow [2023-08-27 03:56:58,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 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-27 03:56:58,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:56:58,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:56:58,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 03:56:58,887 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:56:58,887 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:56:58,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1260506433, now seen corresponding path program 1 times [2023-08-27 03:56:58,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:56:58,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751868051] [2023-08-27 03:56:58,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:56:58,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:56:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:56:59,275 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-27 03:56:59,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:56:59,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751868051] [2023-08-27 03:56:59,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751868051] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:56:59,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:56:59,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:56:59,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015611434] [2023-08-27 03:56:59,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:56:59,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:56:59,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:56:59,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:56:59,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:56:59,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 219 [2023-08-27 03:56:59,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 520 flow. Second operand has 6 states, 6 states have (on average 89.0) internal successors, (534), 6 states have internal predecessors, (534), 0 states have call successors, (0), 0 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-27 03:56:59,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:56:59,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 219 [2023-08-27 03:56:59,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:57:00,098 INFO L124 PetriNetUnfolderBase]: 3631/5480 cut-off events. [2023-08-27 03:57:00,098 INFO L125 PetriNetUnfolderBase]: For 23324/23384 co-relation queries the response was YES. [2023-08-27 03:57:00,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24496 conditions, 5480 events. 3631/5480 cut-off events. For 23324/23384 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 29826 event pairs, 808 based on Foata normal form. 93/5454 useless extension candidates. Maximal degree in co-relation 24462. Up to 2430 conditions per place. [2023-08-27 03:57:00,151 INFO L140 encePairwiseOnDemand]: 210/219 looper letters, 144 selfloop transitions, 56 changer transitions 3/214 dead transitions. [2023-08-27 03:57:00,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 214 transitions, 1905 flow [2023-08-27 03:57:00,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 03:57:00,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 03:57:00,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 881 transitions. [2023-08-27 03:57:00,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4469812278031456 [2023-08-27 03:57:00,154 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 881 transitions. [2023-08-27 03:57:00,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 881 transitions. [2023-08-27 03:57:00,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:57:00,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 881 transitions. [2023-08-27 03:57:00,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.88888888888889) internal successors, (881), 9 states have internal predecessors, (881), 0 states have call successors, (0), 0 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-27 03:57:00,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 219.0) internal successors, (2190), 10 states have internal predecessors, (2190), 0 states have call successors, (0), 0 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-27 03:57:00,159 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 219.0) internal successors, (2190), 10 states have internal predecessors, (2190), 0 states have call successors, (0), 0 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-27 03:57:00,159 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 520 flow. Second operand 9 states and 881 transitions. [2023-08-27 03:57:00,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 214 transitions, 1905 flow [2023-08-27 03:57:00,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 214 transitions, 1873 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-27 03:57:00,231 INFO L231 Difference]: Finished difference. Result has 87 places, 128 transitions, 1244 flow [2023-08-27 03:57:00,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1244, PETRI_PLACES=87, PETRI_TRANSITIONS=128} [2023-08-27 03:57:00,232 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 47 predicate places. [2023-08-27 03:57:00,232 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 128 transitions, 1244 flow [2023-08-27 03:57:00,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.0) internal successors, (534), 6 states have internal predecessors, (534), 0 states have call successors, (0), 0 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-27 03:57:00,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:57:00,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:57:00,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 03:57:00,233 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:57:00,233 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:57:00,233 INFO L85 PathProgramCache]: Analyzing trace with hash -2096885489, now seen corresponding path program 1 times [2023-08-27 03:57:00,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:57:00,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778681452] [2023-08-27 03:57:00,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:57:00,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:57:00,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:57:00,409 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-27 03:57:00,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:57:00,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778681452] [2023-08-27 03:57:00,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778681452] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:57:00,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:57:00,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:57:00,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222952841] [2023-08-27 03:57:00,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:57:00,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:57:00,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:57:00,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:57:00,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:57:00,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 219 [2023-08-27 03:57:00,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 128 transitions, 1244 flow. Second operand has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 0 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-27 03:57:00,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:57:00,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 219 [2023-08-27 03:57:00,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:57:00,827 INFO L124 PetriNetUnfolderBase]: 1513/2516 cut-off events. [2023-08-27 03:57:00,827 INFO L125 PetriNetUnfolderBase]: For 15703/15788 co-relation queries the response was YES. [2023-08-27 03:57:00,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13026 conditions, 2516 events. 1513/2516 cut-off events. For 15703/15788 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 14399 event pairs, 198 based on Foata normal form. 211/2643 useless extension candidates. Maximal degree in co-relation 12984. Up to 1377 conditions per place. [2023-08-27 03:57:00,848 INFO L140 encePairwiseOnDemand]: 213/219 looper letters, 118 selfloop transitions, 5 changer transitions 0/137 dead transitions. [2023-08-27 03:57:00,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 137 transitions, 1477 flow [2023-08-27 03:57:00,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:57:00,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:57:00,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 415 transitions. [2023-08-27 03:57:00,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4737442922374429 [2023-08-27 03:57:00,850 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 415 transitions. [2023-08-27 03:57:00,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 415 transitions. [2023-08-27 03:57:00,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:57:00,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 415 transitions. [2023-08-27 03:57:00,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 0 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-27 03:57:00,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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-27 03:57:00,853 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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-27 03:57:00,853 INFO L175 Difference]: Start difference. First operand has 87 places, 128 transitions, 1244 flow. Second operand 4 states and 415 transitions. [2023-08-27 03:57:00,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 137 transitions, 1477 flow [2023-08-27 03:57:00,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 137 transitions, 1401 flow, removed 36 selfloop flow, removed 1 redundant places. [2023-08-27 03:57:00,897 INFO L231 Difference]: Finished difference. Result has 91 places, 96 transitions, 875 flow [2023-08-27 03:57:00,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=875, PETRI_PLACES=91, PETRI_TRANSITIONS=96} [2023-08-27 03:57:00,898 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 51 predicate places. [2023-08-27 03:57:00,898 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 96 transitions, 875 flow [2023-08-27 03:57:00,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 0 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-27 03:57:00,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:57:00,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:57:00,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 03:57:00,899 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:57:00,899 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:57:00,899 INFO L85 PathProgramCache]: Analyzing trace with hash 368681928, now seen corresponding path program 1 times [2023-08-27 03:57:00,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:57:00,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457483907] [2023-08-27 03:57:00,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:57:00,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:57:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:57:01,090 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-27 03:57:01,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:57:01,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457483907] [2023-08-27 03:57:01,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457483907] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:57:01,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:57:01,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:57:01,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542496287] [2023-08-27 03:57:01,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:57:01,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:57:01,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:57:01,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:57:01,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:57:01,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 219 [2023-08-27 03:57:01,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 96 transitions, 875 flow. Second operand has 5 states, 5 states have (on average 93.8) internal successors, (469), 5 states have internal predecessors, (469), 0 states have call successors, (0), 0 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-27 03:57:01,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:57:01,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 219 [2023-08-27 03:57:01,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:57:01,385 INFO L124 PetriNetUnfolderBase]: 867/1543 cut-off events. [2023-08-27 03:57:01,385 INFO L125 PetriNetUnfolderBase]: For 9486/9599 co-relation queries the response was YES. [2023-08-27 03:57:01,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7962 conditions, 1543 events. 867/1543 cut-off events. For 9486/9599 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 8663 event pairs, 164 based on Foata normal form. 136/1614 useless extension candidates. Maximal degree in co-relation 7917. Up to 536 conditions per place. [2023-08-27 03:57:01,397 INFO L140 encePairwiseOnDemand]: 213/219 looper letters, 89 selfloop transitions, 8 changer transitions 0/106 dead transitions. [2023-08-27 03:57:01,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 106 transitions, 1070 flow [2023-08-27 03:57:01,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:57:01,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:57:01,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 518 transitions. [2023-08-27 03:57:01,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4730593607305936 [2023-08-27 03:57:01,399 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 518 transitions. [2023-08-27 03:57:01,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 518 transitions. [2023-08-27 03:57:01,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:57:01,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 518 transitions. [2023-08-27 03:57:01,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 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-27 03:57:01,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 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-27 03:57:01,403 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 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-27 03:57:01,403 INFO L175 Difference]: Start difference. First operand has 91 places, 96 transitions, 875 flow. Second operand 5 states and 518 transitions. [2023-08-27 03:57:01,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 106 transitions, 1070 flow [2023-08-27 03:57:01,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 106 transitions, 1002 flow, removed 7 selfloop flow, removed 9 redundant places. [2023-08-27 03:57:01,418 INFO L231 Difference]: Finished difference. Result has 83 places, 68 transitions, 567 flow [2023-08-27 03:57:01,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=567, PETRI_PLACES=83, PETRI_TRANSITIONS=68} [2023-08-27 03:57:01,419 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 43 predicate places. [2023-08-27 03:57:01,419 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 68 transitions, 567 flow [2023-08-27 03:57:01,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.8) internal successors, (469), 5 states have internal predecessors, (469), 0 states have call successors, (0), 0 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-27 03:57:01,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:57:01,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:57:01,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 03:57:01,420 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:57:01,420 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:57:01,420 INFO L85 PathProgramCache]: Analyzing trace with hash -318144767, now seen corresponding path program 1 times [2023-08-27 03:57:01,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:57:01,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610570191] [2023-08-27 03:57:01,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:57:01,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:57:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:57:01,488 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-27 03:57:01,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:57:01,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610570191] [2023-08-27 03:57:01,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610570191] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:57:01,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:57:01,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:57:01,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128207801] [2023-08-27 03:57:01,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:57:01,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:57:01,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:57:01,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:57:01,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:57:01,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 219 [2023-08-27 03:57:01,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 68 transitions, 567 flow. Second operand has 5 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 0 states have call successors, (0), 0 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-27 03:57:01,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:57:01,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 219 [2023-08-27 03:57:01,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:57:01,752 INFO L124 PetriNetUnfolderBase]: 839/1469 cut-off events. [2023-08-27 03:57:01,753 INFO L125 PetriNetUnfolderBase]: For 8672/8754 co-relation queries the response was YES. [2023-08-27 03:57:01,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7938 conditions, 1469 events. 839/1469 cut-off events. For 8672/8754 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 8146 event pairs, 164 based on Foata normal form. 36/1486 useless extension candidates. Maximal degree in co-relation 7897. Up to 536 conditions per place. [2023-08-27 03:57:01,761 INFO L140 encePairwiseOnDemand]: 212/219 looper letters, 46 selfloop transitions, 10 changer transitions 39/99 dead transitions. [2023-08-27 03:57:01,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 99 transitions, 1007 flow [2023-08-27 03:57:01,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:57:01,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:57:01,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 519 transitions. [2023-08-27 03:57:01,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.473972602739726 [2023-08-27 03:57:01,763 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 519 transitions. [2023-08-27 03:57:01,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 519 transitions. [2023-08-27 03:57:01,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:57:01,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 519 transitions. [2023-08-27 03:57:01,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 0 states have call successors, (0), 0 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-27 03:57:01,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 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-27 03:57:01,767 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 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-27 03:57:01,767 INFO L175 Difference]: Start difference. First operand has 83 places, 68 transitions, 567 flow. Second operand 5 states and 519 transitions. [2023-08-27 03:57:01,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 99 transitions, 1007 flow [2023-08-27 03:57:01,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 99 transitions, 994 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 03:57:01,778 INFO L231 Difference]: Finished difference. Result has 81 places, 39 transitions, 341 flow [2023-08-27 03:57:01,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=341, PETRI_PLACES=81, PETRI_TRANSITIONS=39} [2023-08-27 03:57:01,778 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 41 predicate places. [2023-08-27 03:57:01,778 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 39 transitions, 341 flow [2023-08-27 03:57:01,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 0 states have call successors, (0), 0 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-27 03:57:01,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:57:01,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:57:01,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 03:57:01,779 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:57:01,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:57:01,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1297615644, now seen corresponding path program 1 times [2023-08-27 03:57:01,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:57:01,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654916223] [2023-08-27 03:57:01,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:57:01,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:57:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:57:02,013 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-27 03:57:02,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:57:02,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654916223] [2023-08-27 03:57:02,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654916223] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:57:02,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:57:02,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:57:02,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160132456] [2023-08-27 03:57:02,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:57:02,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:57:02,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:57:02,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:57:02,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:57:02,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 219 [2023-08-27 03:57:02,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 39 transitions, 341 flow. Second operand has 6 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 0 states have call successors, (0), 0 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-27 03:57:02,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:57:02,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 219 [2023-08-27 03:57:02,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:57:02,145 INFO L124 PetriNetUnfolderBase]: 166/314 cut-off events. [2023-08-27 03:57:02,145 INFO L125 PetriNetUnfolderBase]: For 1974/1977 co-relation queries the response was YES. [2023-08-27 03:57:02,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1732 conditions, 314 events. 166/314 cut-off events. For 1974/1977 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1177 event pairs, 44 based on Foata normal form. 11/320 useless extension candidates. Maximal degree in co-relation 1697. Up to 126 conditions per place. [2023-08-27 03:57:02,147 INFO L140 encePairwiseOnDemand]: 213/219 looper letters, 37 selfloop transitions, 11 changer transitions 2/54 dead transitions. [2023-08-27 03:57:02,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 54 transitions, 532 flow [2023-08-27 03:57:02,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:57:02,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:57:02,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 592 transitions. [2023-08-27 03:57:02,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4505327245053272 [2023-08-27 03:57:02,150 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 592 transitions. [2023-08-27 03:57:02,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 592 transitions. [2023-08-27 03:57:02,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:57:02,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 592 transitions. [2023-08-27 03:57:02,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 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-27 03:57:02,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 0 states have call successors, (0), 0 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-27 03:57:02,154 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 0 states have call successors, (0), 0 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-27 03:57:02,154 INFO L175 Difference]: Start difference. First operand has 81 places, 39 transitions, 341 flow. Second operand 6 states and 592 transitions. [2023-08-27 03:57:02,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 54 transitions, 532 flow [2023-08-27 03:57:02,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 380 flow, removed 25 selfloop flow, removed 26 redundant places. [2023-08-27 03:57:02,159 INFO L231 Difference]: Finished difference. Result has 58 places, 35 transitions, 216 flow [2023-08-27 03:57:02,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=216, PETRI_PLACES=58, PETRI_TRANSITIONS=35} [2023-08-27 03:57:02,160 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2023-08-27 03:57:02,160 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 35 transitions, 216 flow [2023-08-27 03:57:02,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 0 states have call successors, (0), 0 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-27 03:57:02,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:57:02,161 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-27 03:57:02,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 03:57:02,161 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:57:02,161 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:57:02,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1991961693, now seen corresponding path program 1 times [2023-08-27 03:57:02,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:57:02,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854048379] [2023-08-27 03:57:02,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:57:02,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:57:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:57:02,557 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-27 03:57:02,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:57:02,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854048379] [2023-08-27 03:57:02,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854048379] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:57:02,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:57:02,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:57:02,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620005212] [2023-08-27 03:57:02,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:57:02,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:57:02,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:57:02,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:57:02,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:57:02,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 219 [2023-08-27 03:57:02,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 35 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 0 states have call successors, (0), 0 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-27 03:57:02,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:57:02,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 219 [2023-08-27 03:57:02,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:57:02,809 INFO L124 PetriNetUnfolderBase]: 219/413 cut-off events. [2023-08-27 03:57:02,809 INFO L125 PetriNetUnfolderBase]: For 1199/1199 co-relation queries the response was YES. [2023-08-27 03:57:02,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1824 conditions, 413 events. 219/413 cut-off events. For 1199/1199 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1567 event pairs, 22 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 1802. Up to 245 conditions per place. [2023-08-27 03:57:02,811 INFO L140 encePairwiseOnDemand]: 212/219 looper letters, 37 selfloop transitions, 3 changer transitions 35/76 dead transitions. [2023-08-27 03:57:02,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 76 transitions, 621 flow [2023-08-27 03:57:02,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:57:02,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:57:02,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 613 transitions. [2023-08-27 03:57:02,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3998695368558382 [2023-08-27 03:57:02,813 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 613 transitions. [2023-08-27 03:57:02,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 613 transitions. [2023-08-27 03:57:02,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:57:02,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 613 transitions. [2023-08-27 03:57:02,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 87.57142857142857) internal successors, (613), 7 states have internal predecessors, (613), 0 states have call successors, (0), 0 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-27 03:57:02,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 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-27 03:57:02,817 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 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-27 03:57:02,817 INFO L175 Difference]: Start difference. First operand has 58 places, 35 transitions, 216 flow. Second operand 7 states and 613 transitions. [2023-08-27 03:57:02,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 76 transitions, 621 flow [2023-08-27 03:57:02,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 76 transitions, 477 flow, removed 32 selfloop flow, removed 11 redundant places. [2023-08-27 03:57:02,821 INFO L231 Difference]: Finished difference. Result has 51 places, 31 transitions, 146 flow [2023-08-27 03:57:02,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=146, PETRI_PLACES=51, PETRI_TRANSITIONS=31} [2023-08-27 03:57:02,822 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2023-08-27 03:57:02,822 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 31 transitions, 146 flow [2023-08-27 03:57:02,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 0 states have call successors, (0), 0 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-27 03:57:02,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:57:02,822 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-27 03:57:02,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 03:57:02,822 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:57:02,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:57:02,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1848871277, now seen corresponding path program 2 times [2023-08-27 03:57:02,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:57:02,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448791847] [2023-08-27 03:57:02,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:57:02,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:57:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:57:03,546 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-27 03:57:03,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:57:03,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448791847] [2023-08-27 03:57:03,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448791847] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:57:03,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:57:03,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 03:57:03,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257886422] [2023-08-27 03:57:03,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:57:03,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 03:57:03,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:57:03,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 03:57:03,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-27 03:57:03,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 219 [2023-08-27 03:57:03,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 31 transitions, 146 flow. Second operand has 8 states, 8 states have (on average 88.5) internal successors, (708), 8 states have internal predecessors, (708), 0 states have call successors, (0), 0 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-27 03:57:03,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:57:03,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 219 [2023-08-27 03:57:03,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:57:03,707 INFO L124 PetriNetUnfolderBase]: 173/341 cut-off events. [2023-08-27 03:57:03,707 INFO L125 PetriNetUnfolderBase]: For 391/391 co-relation queries the response was YES. [2023-08-27 03:57:03,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1202 conditions, 341 events. 173/341 cut-off events. For 391/391 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1338 event pairs, 26 based on Foata normal form. 1/336 useless extension candidates. Maximal degree in co-relation 1188. Up to 193 conditions per place. [2023-08-27 03:57:03,709 INFO L140 encePairwiseOnDemand]: 212/219 looper letters, 38 selfloop transitions, 7 changer transitions 6/53 dead transitions. [2023-08-27 03:57:03,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 53 transitions, 335 flow [2023-08-27 03:57:03,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:57:03,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:57:03,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 553 transitions. [2023-08-27 03:57:03,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4208523592085236 [2023-08-27 03:57:03,711 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 553 transitions. [2023-08-27 03:57:03,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 553 transitions. [2023-08-27 03:57:03,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:57:03,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 553 transitions. [2023-08-27 03:57:03,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 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-27 03:57:03,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 0 states have call successors, (0), 0 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-27 03:57:03,714 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 0 states have call successors, (0), 0 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-27 03:57:03,714 INFO L175 Difference]: Start difference. First operand has 51 places, 31 transitions, 146 flow. Second operand 6 states and 553 transitions. [2023-08-27 03:57:03,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 53 transitions, 335 flow [2023-08-27 03:57:03,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 53 transitions, 313 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-08-27 03:57:03,717 INFO L231 Difference]: Finished difference. Result has 50 places, 34 transitions, 177 flow [2023-08-27 03:57:03,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=177, PETRI_PLACES=50, PETRI_TRANSITIONS=34} [2023-08-27 03:57:03,717 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2023-08-27 03:57:03,717 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 34 transitions, 177 flow [2023-08-27 03:57:03,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.5) internal successors, (708), 8 states have internal predecessors, (708), 0 states have call successors, (0), 0 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-27 03:57:03,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:57:03,718 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-27 03:57:03,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 03:57:03,718 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:57:03,718 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:57:03,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1239438279, now seen corresponding path program 3 times [2023-08-27 03:57:03,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:57:03,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435975599] [2023-08-27 03:57:03,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:57:03,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:57:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:57:03,752 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 03:57:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:57:03,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 03:57:03,814 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 03:57:03,815 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (17 of 18 remaining) [2023-08-27 03:57:03,816 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2023-08-27 03:57:03,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-08-27 03:57:03,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (14 of 18 remaining) [2023-08-27 03:57:03,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-08-27 03:57:03,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-08-27 03:57:03,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-08-27 03:57:03,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-08-27 03:57:03,817 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2023-08-27 03:57:03,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2023-08-27 03:57:03,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2023-08-27 03:57:03,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-08-27 03:57:03,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-08-27 03:57:03,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (4 of 18 remaining) [2023-08-27 03:57:03,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-08-27 03:57:03,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-08-27 03:57:03,818 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-08-27 03:57:03,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-08-27 03:57:03,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 03:57:03,819 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:57:03,825 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 03:57:03,826 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 03:57:03,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 03:57:03 BasicIcfg [2023-08-27 03:57:03,890 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 03:57:03,890 INFO L158 Benchmark]: Toolchain (without parser) took 16316.76ms. Allocated memory was 348.1MB in the beginning and 702.5MB in the end (delta: 354.4MB). Free memory was 323.3MB in the beginning and 319.6MB in the end (delta: 3.7MB). Peak memory consumption was 359.6MB. Max. memory is 16.0GB. [2023-08-27 03:57:03,891 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 348.1MB. Free memory is still 324.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:57:03,891 INFO L158 Benchmark]: CACSL2BoogieTranslator took 566.11ms. Allocated memory is still 348.1MB. Free memory was 322.8MB in the beginning and 299.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 03:57:03,891 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.74ms. Allocated memory is still 348.1MB. Free memory was 299.8MB in the beginning and 297.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:57:03,891 INFO L158 Benchmark]: Boogie Preprocessor took 27.30ms. Allocated memory is still 348.1MB. Free memory was 297.2MB in the beginning and 295.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:57:03,891 INFO L158 Benchmark]: RCFGBuilder took 676.62ms. Allocated memory is still 348.1MB. Free memory was 295.1MB in the beginning and 308.0MB in the end (delta: -12.9MB). Peak memory consumption was 31.6MB. Max. memory is 16.0GB. [2023-08-27 03:57:03,892 INFO L158 Benchmark]: TraceAbstraction took 14996.55ms. Allocated memory was 348.1MB in the beginning and 702.5MB in the end (delta: 354.4MB). Free memory was 308.0MB in the beginning and 319.6MB in the end (delta: -11.7MB). Peak memory consumption was 342.7MB. Max. memory is 16.0GB. [2023-08-27 03:57:03,893 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 348.1MB. Free memory is still 324.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 566.11ms. Allocated memory is still 348.1MB. Free memory was 322.8MB in the beginning and 299.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 44.74ms. Allocated memory is still 348.1MB. Free memory was 299.8MB in the beginning and 297.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 27.30ms. Allocated memory is still 348.1MB. Free memory was 297.2MB in the beginning and 295.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 676.62ms. Allocated memory is still 348.1MB. Free memory was 295.1MB in the beginning and 308.0MB in the end (delta: -12.9MB). Peak memory consumption was 31.6MB. Max. memory is 16.0GB. * TraceAbstraction took 14996.55ms. Allocated memory was 348.1MB in the beginning and 702.5MB in the end (delta: 354.4MB). Free memory was 308.0MB in the beginning and 319.6MB in the end (delta: -11.7MB). Peak memory consumption was 342.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 122 PlacesBefore, 40 PlacesAfterwards, 115 TransitionsBefore, 31 TransitionsAfterwards, 2762 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 2 ChoiceCompositions, 101 TotalNumberOfCompositions, 10167 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3354, independent: 3077, independent conditional: 0, independent unconditional: 3077, dependent: 277, dependent conditional: 0, dependent unconditional: 277, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1479, independent: 1437, independent conditional: 0, independent unconditional: 1437, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3354, independent: 1640, independent conditional: 0, independent unconditional: 1640, dependent: 235, dependent conditional: 0, dependent unconditional: 235, unknown: 1479, unknown conditional: 0, unknown unconditional: 1479] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 136, Positive conditional cache size: 0, Positive unconditional cache size: 136, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t2284; [L821] FCALL, FORK 0 pthread_create(&t2284, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2284, ((void *)0), P0, ((void *)0))=-3, t2284={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L822] 0 pthread_t t2285; [L823] FCALL, FORK 0 pthread_create(&t2285, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2285, ((void *)0), P1, ((void *)0))=-2, t2284={5:0}, t2285={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L824] 0 pthread_t t2286; [L825] FCALL, FORK 0 pthread_create(&t2286, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2286, ((void *)0), P2, ((void *)0))=-1, t2284={5:0}, t2285={6:0}, t2286={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L792] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L795] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L785] EXPR 2 __unbuffered_cnt + 1 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L798] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L756] EXPR 1 __unbuffered_cnt + 1 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L805] EXPR 3 __unbuffered_cnt + 1 [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2284={5:0}, t2285={6:0}, t2286={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L835] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2284={5:0}, t2285={6:0}, t2286={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 x$flush_delayed = weak$$choice2 [L841] 0 x$mem_tmp = x [L842] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L843] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L844] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L845] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L846] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L848] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L850] 0 x = x$flush_delayed ? x$mem_tmp : x [L851] 0 x$flush_delayed = (_Bool)0 [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe021_power.opt_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 756]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 756]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 785]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 785]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 805]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 805]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 825]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 150 locations, 18 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: 14.8s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 571 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 571 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1321 IncrementalHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 24 mSDtfsCounter, 1321 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1244occurred in iteration=8, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 211 NumberOfCodeBlocks, 211 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 175 ConstructedInterpolants, 0 QuantifiedInterpolants, 1326 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-27 03:57:03,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...