/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 -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/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 21:28:27,685 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 21:28:27,762 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-26 21:28:27,767 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 21:28:27,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 21:28:27,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 21:28:27,805 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 21:28:27,805 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 21:28:27,806 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 21:28:27,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 21:28:27,806 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 21:28:27,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 21:28:27,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 21:28:27,807 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 21:28:27,808 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 21:28:27,808 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 21:28:27,808 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 21:28:27,809 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 21:28:27,809 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 21:28:27,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 21:28:27,810 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 21:28:27,813 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 21:28:27,814 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 21:28:27,814 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 21:28:27,818 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 21:28:27,818 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 21:28:27,818 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 21:28:27,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:28:27,819 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 21:28:27,819 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 21:28:27,820 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 21:28:27,820 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 21:28:27,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 21:28:27,820 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 21:28:27,820 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 21:28:27,821 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.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-26 21:28:28,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 21:28:28,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 21:28:28,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 21:28:28,179 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 21:28:28,179 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 21:28:28,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-26 21:28:29,279 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 21:28:29,553 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 21:28:29,554 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-26 21:28:29,571 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25e1cc7fe/1769a76ef1c247a9886f5aead640753a/FLAG973a4b30f [2023-08-26 21:28:29,583 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25e1cc7fe/1769a76ef1c247a9886f5aead640753a [2023-08-26 21:28:29,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 21:28:29,586 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 21:28:29,587 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 21:28:29,587 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 21:28:29,589 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 21:28:29,590 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:28:29" (1/1) ... [2023-08-26 21:28:29,591 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f99d24f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:28:29, skipping insertion in model container [2023-08-26 21:28:29,591 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:28:29" (1/1) ... [2023-08-26 21:28:29,642 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 21:28:30,052 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:28:30,071 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 21:28:30,100 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 21:28:30,101 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 21:28:30,164 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:28:30,199 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:28:30,201 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:28:30,206 INFO L206 MainTranslator]: Completed translation [2023-08-26 21:28:30,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:28:30 WrapperNode [2023-08-26 21:28:30,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 21:28:30,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 21:28:30,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 21:28:30,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 21:28:30,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:28:30" (1/1) ... [2023-08-26 21:28:30,239 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:28:30" (1/1) ... [2023-08-26 21:28:30,272 INFO L138 Inliner]: procedures = 176, calls = 57, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 153 [2023-08-26 21:28:30,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 21:28:30,274 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 21:28:30,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 21:28:30,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 21:28:30,281 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:28:30" (1/1) ... [2023-08-26 21:28:30,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:28:30" (1/1) ... [2023-08-26 21:28:30,285 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:28:30" (1/1) ... [2023-08-26 21:28:30,285 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:28:30" (1/1) ... [2023-08-26 21:28:30,308 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:28:30" (1/1) ... [2023-08-26 21:28:30,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:28:30" (1/1) ... [2023-08-26 21:28:30,312 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:28:30" (1/1) ... [2023-08-26 21:28:30,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:28:30" (1/1) ... [2023-08-26 21:28:30,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 21:28:30,317 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 21:28:30,317 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 21:28:30,317 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 21:28:30,318 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:28:30" (1/1) ... [2023-08-26 21:28:30,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:28:30,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 21:28:30,353 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-26 21:28:30,363 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-26 21:28:30,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 21:28:30,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 21:28:30,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 21:28:30,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 21:28:30,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 21:28:30,387 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 21:28:30,387 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 21:28:30,387 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 21:28:30,387 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 21:28:30,388 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 21:28:30,388 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 21:28:30,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 21:28:30,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 21:28:30,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 21:28:30,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 21:28:30,391 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 21:28:30,500 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 21:28:30,501 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 21:28:30,892 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 21:28:31,114 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 21:28:31,115 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 21:28:31,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:28:31 BoogieIcfgContainer [2023-08-26 21:28:31,117 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 21:28:31,119 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 21:28:31,119 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 21:28:31,122 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 21:28:31,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:28:29" (1/3) ... [2023-08-26 21:28:31,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60673ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:28:31, skipping insertion in model container [2023-08-26 21:28:31,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:28:30" (2/3) ... [2023-08-26 21:28:31,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60673ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:28:31, skipping insertion in model container [2023-08-26 21:28:31,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:28:31" (3/3) ... [2023-08-26 21:28:31,124 INFO L112 eAbstractionObserver]: Analyzing ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-26 21:28:31,140 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 21:28:31,140 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-26 21:28:31,140 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 21:28:31,192 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 21:28:31,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 119 transitions, 253 flow [2023-08-26 21:28:31,285 INFO L124 PetriNetUnfolderBase]: 3/116 cut-off events. [2023-08-26 21:28:31,285 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:28:31,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 3/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2023-08-26 21:28:31,293 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 119 transitions, 253 flow [2023-08-26 21:28:31,298 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 116 transitions, 241 flow [2023-08-26 21:28:31,301 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 21:28:31,314 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 116 transitions, 241 flow [2023-08-26 21:28:31,318 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 116 transitions, 241 flow [2023-08-26 21:28:31,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 116 transitions, 241 flow [2023-08-26 21:28:31,365 INFO L124 PetriNetUnfolderBase]: 3/116 cut-off events. [2023-08-26 21:28:31,365 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:28:31,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 3/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2023-08-26 21:28:31,368 INFO L119 LiptonReduction]: Number of co-enabled transitions 2894 [2023-08-26 21:28:35,526 INFO L134 LiptonReduction]: Checked pairs total: 10694 [2023-08-26 21:28:35,526 INFO L136 LiptonReduction]: Total number of compositions: 105 [2023-08-26 21:28:35,546 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 21:28:35,552 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;@342d2afd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 21:28:35,553 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-26 21:28:35,556 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 21:28:35,556 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-26 21:28:35,556 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:28:35,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:28:35,557 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 21:28:35,558 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:28:35,562 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:28:35,562 INFO L85 PathProgramCache]: Analyzing trace with hash 593348586, now seen corresponding path program 1 times [2023-08-26 21:28:35,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:28:35,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380479069] [2023-08-26 21:28:35,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:28:35,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:28:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:28:35,949 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-26 21:28:35,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:28:35,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380479069] [2023-08-26 21:28:35,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380479069] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:28:35,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:28:35,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:28:35,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942062633] [2023-08-26 21:28:35,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:28:35,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:28:35,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:28:35,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:28:35,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:28:35,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 224 [2023-08-26 21:28:35,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:35,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:28:35,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 224 [2023-08-26 21:28:35,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:28:36,622 INFO L124 PetriNetUnfolderBase]: 2534/4157 cut-off events. [2023-08-26 21:28:36,622 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2023-08-26 21:28:36,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7917 conditions, 4157 events. 2534/4157 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 25114 event pairs, 338 based on Foata normal form. 0/3386 useless extension candidates. Maximal degree in co-relation 7906. Up to 3093 conditions per place. [2023-08-26 21:28:36,650 INFO L140 encePairwiseOnDemand]: 221/224 looper letters, 40 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-08-26 21:28:36,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 46 transitions, 188 flow [2023-08-26 21:28:36,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:28:36,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:28:36,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2023-08-26 21:28:36,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2023-08-26 21:28:36,662 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 328 transitions. [2023-08-26 21:28:36,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 328 transitions. [2023-08-26 21:28:36,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:28:36,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 328 transitions. [2023-08-26 21:28:36,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:36,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:36,673 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:36,675 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 69 flow. Second operand 3 states and 328 transitions. [2023-08-26 21:28:36,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 46 transitions, 188 flow [2023-08-26 21:28:36,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 46 transitions, 184 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 21:28:36,679 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 68 flow [2023-08-26 21:28:36,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, 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-26 21:28:36,683 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-08-26 21:28:36,684 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 68 flow [2023-08-26 21:28:36,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:36,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:28:36,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:28:36,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 21:28:36,685 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-26 21:28:36,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:28:36,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1076181747, now seen corresponding path program 1 times [2023-08-26 21:28:36,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:28:36,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395980358] [2023-08-26 21:28:36,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:28:36,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:28:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:28:36,810 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-26 21:28:36,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:28:36,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395980358] [2023-08-26 21:28:36,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395980358] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:28:36,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:28:36,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:28:36,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823866693] [2023-08-26 21:28:36,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:28:36,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:28:36,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:28:36,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:28:36,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:28:36,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 224 [2023-08-26 21:28:36,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:36,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:28:36,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 224 [2023-08-26 21:28:36,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:28:37,292 INFO L124 PetriNetUnfolderBase]: 1969/2974 cut-off events. [2023-08-26 21:28:37,293 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-08-26 21:28:37,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6198 conditions, 2974 events. 1969/2974 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 14318 event pairs, 753 based on Foata normal form. 0/2385 useless extension candidates. Maximal degree in co-relation 6188. Up to 1970 conditions per place. [2023-08-26 21:28:37,311 INFO L140 encePairwiseOnDemand]: 214/224 looper letters, 44 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2023-08-26 21:28:37,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 210 flow [2023-08-26 21:28:37,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:28:37,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:28:37,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2023-08-26 21:28:37,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48660714285714285 [2023-08-26 21:28:37,318 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 327 transitions. [2023-08-26 21:28:37,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 327 transitions. [2023-08-26 21:28:37,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:28:37,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 327 transitions. [2023-08-26 21:28:37,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:37,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:37,323 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:37,323 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 68 flow. Second operand 3 states and 327 transitions. [2023-08-26 21:28:37,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 49 transitions, 210 flow [2023-08-26 21:28:37,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:28:37,326 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 100 flow [2023-08-26 21:28:37,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, 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-26 21:28:37,327 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2023-08-26 21:28:37,328 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 100 flow [2023-08-26 21:28:37,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:37,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:28:37,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:28:37,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 21:28:37,337 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-26 21:28:37,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:28:37,337 INFO L85 PathProgramCache]: Analyzing trace with hash 827793347, now seen corresponding path program 1 times [2023-08-26 21:28:37,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:28:37,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915337970] [2023-08-26 21:28:37,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:28:37,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:28:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:28:38,292 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-26 21:28:38,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:28:38,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915337970] [2023-08-26 21:28:38,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915337970] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:28:38,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:28:38,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:28:38,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404973181] [2023-08-26 21:28:38,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:28:38,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:28:38,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:28:38,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:28:38,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:28:38,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 224 [2023-08-26 21:28:38,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:38,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:28:38,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 224 [2023-08-26 21:28:38,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:28:38,756 INFO L124 PetriNetUnfolderBase]: 1666/2655 cut-off events. [2023-08-26 21:28:38,756 INFO L125 PetriNetUnfolderBase]: For 251/267 co-relation queries the response was YES. [2023-08-26 21:28:38,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6343 conditions, 2655 events. 1666/2655 cut-off events. For 251/267 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 14190 event pairs, 675 based on Foata normal form. 0/2316 useless extension candidates. Maximal degree in co-relation 6332. Up to 1481 conditions per place. [2023-08-26 21:28:38,770 INFO L140 encePairwiseOnDemand]: 214/224 looper letters, 52 selfloop transitions, 9 changer transitions 0/65 dead transitions. [2023-08-26 21:28:38,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 65 transitions, 327 flow [2023-08-26 21:28:38,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:28:38,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:28:38,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 390 transitions. [2023-08-26 21:28:38,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43526785714285715 [2023-08-26 21:28:38,772 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 390 transitions. [2023-08-26 21:28:38,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 390 transitions. [2023-08-26 21:28:38,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:28:38,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 390 transitions. [2023-08-26 21:28:38,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:38,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:38,775 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:38,775 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 100 flow. Second operand 4 states and 390 transitions. [2023-08-26 21:28:38,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 65 transitions, 327 flow [2023-08-26 21:28:38,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 65 transitions, 318 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:28:38,777 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 162 flow [2023-08-26 21:28:38,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, 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=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2023-08-26 21:28:38,777 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2023-08-26 21:28:38,778 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 162 flow [2023-08-26 21:28:38,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:38,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:28:38,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:28:38,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 21:28:38,778 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-26 21:28:38,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:28:38,779 INFO L85 PathProgramCache]: Analyzing trace with hash 510331061, now seen corresponding path program 1 times [2023-08-26 21:28:38,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:28:38,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184469230] [2023-08-26 21:28:38,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:28:38,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:28:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:28:38,942 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-26 21:28:38,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:28:38,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184469230] [2023-08-26 21:28:38,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184469230] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:28:38,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:28:38,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:28:38,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993036243] [2023-08-26 21:28:38,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:28:38,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:28:38,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:28:38,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:28:38,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:28:38,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 224 [2023-08-26 21:28:38,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:38,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:28:38,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 224 [2023-08-26 21:28:38,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:28:39,297 INFO L124 PetriNetUnfolderBase]: 1638/2604 cut-off events. [2023-08-26 21:28:39,297 INFO L125 PetriNetUnfolderBase]: For 1195/1225 co-relation queries the response was YES. [2023-08-26 21:28:39,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7444 conditions, 2604 events. 1638/2604 cut-off events. For 1195/1225 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13536 event pairs, 355 based on Foata normal form. 14/2361 useless extension candidates. Maximal degree in co-relation 7429. Up to 2039 conditions per place. [2023-08-26 21:28:39,316 INFO L140 encePairwiseOnDemand]: 221/224 looper letters, 51 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2023-08-26 21:28:39,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 58 transitions, 348 flow [2023-08-26 21:28:39,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:28:39,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:28:39,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2023-08-26 21:28:39,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47767857142857145 [2023-08-26 21:28:39,318 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2023-08-26 21:28:39,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2023-08-26 21:28:39,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:28:39,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2023-08-26 21:28:39,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:39,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:39,321 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:39,321 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 162 flow. Second operand 3 states and 321 transitions. [2023-08-26 21:28:39,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 58 transitions, 348 flow [2023-08-26 21:28:39,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 345 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:28:39,326 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 171 flow [2023-08-26 21:28:39,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=171, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2023-08-26 21:28:39,328 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-08-26 21:28:39,328 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 171 flow [2023-08-26 21:28:39,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:39,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:28:39,328 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:28:39,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 21:28:39,329 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-26 21:28:39,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:28:39,329 INFO L85 PathProgramCache]: Analyzing trace with hash 2034710521, now seen corresponding path program 1 times [2023-08-26 21:28:39,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:28:39,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078946325] [2023-08-26 21:28:39,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:28:39,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:28:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:28:39,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-26 21:28:39,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:28:39,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078946325] [2023-08-26 21:28:39,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078946325] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:28:39,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:28:39,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:28:39,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672457084] [2023-08-26 21:28:39,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:28:39,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:28:39,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:28:39,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:28:39,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:28:39,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 224 [2023-08-26 21:28:39,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:39,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:28:39,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 224 [2023-08-26 21:28:39,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:28:40,187 INFO L124 PetriNetUnfolderBase]: 2825/4506 cut-off events. [2023-08-26 21:28:40,187 INFO L125 PetriNetUnfolderBase]: For 2270/2351 co-relation queries the response was YES. [2023-08-26 21:28:40,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13022 conditions, 4506 events. 2825/4506 cut-off events. For 2270/2351 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 25597 event pairs, 747 based on Foata normal form. 89/4144 useless extension candidates. Maximal degree in co-relation 13005. Up to 1770 conditions per place. [2023-08-26 21:28:40,214 INFO L140 encePairwiseOnDemand]: 220/224 looper letters, 79 selfloop transitions, 4 changer transitions 0/86 dead transitions. [2023-08-26 21:28:40,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 86 transitions, 535 flow [2023-08-26 21:28:40,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:28:40,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:28:40,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 428 transitions. [2023-08-26 21:28:40,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47767857142857145 [2023-08-26 21:28:40,216 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 428 transitions. [2023-08-26 21:28:40,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 428 transitions. [2023-08-26 21:28:40,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:28:40,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 428 transitions. [2023-08-26 21:28:40,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:40,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:40,219 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:40,219 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 171 flow. Second operand 4 states and 428 transitions. [2023-08-26 21:28:40,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 86 transitions, 535 flow [2023-08-26 21:28:40,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 86 transitions, 525 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:28:40,226 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 198 flow [2023-08-26 21:28:40,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=198, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-08-26 21:28:40,228 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2023-08-26 21:28:40,228 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 198 flow [2023-08-26 21:28:40,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:40,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:28:40,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:28:40,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 21:28:40,229 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-26 21:28:40,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:28:40,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1794945945, now seen corresponding path program 1 times [2023-08-26 21:28:40,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:28:40,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236673259] [2023-08-26 21:28:40,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:28:40,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:28:40,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:28:40,298 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-26 21:28:40,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:28:40,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236673259] [2023-08-26 21:28:40,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236673259] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:28:40,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:28:40,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:28:40,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681679358] [2023-08-26 21:28:40,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:28:40,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:28:40,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:28:40,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:28:40,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:28:40,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 224 [2023-08-26 21:28:40,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:40,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:28:40,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 224 [2023-08-26 21:28:40,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:28:40,864 INFO L124 PetriNetUnfolderBase]: 2348/3617 cut-off events. [2023-08-26 21:28:40,864 INFO L125 PetriNetUnfolderBase]: For 2632/2650 co-relation queries the response was YES. [2023-08-26 21:28:40,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11054 conditions, 3617 events. 2348/3617 cut-off events. For 2632/2650 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 18755 event pairs, 812 based on Foata normal form. 14/3301 useless extension candidates. Maximal degree in co-relation 11035. Up to 2349 conditions per place. [2023-08-26 21:28:40,889 INFO L140 encePairwiseOnDemand]: 217/224 looper letters, 59 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2023-08-26 21:28:40,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 64 transitions, 441 flow [2023-08-26 21:28:40,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:28:40,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:28:40,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 412 transitions. [2023-08-26 21:28:40,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45982142857142855 [2023-08-26 21:28:40,892 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 412 transitions. [2023-08-26 21:28:40,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 412 transitions. [2023-08-26 21:28:40,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:28:40,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 412 transitions. [2023-08-26 21:28:40,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:40,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:40,898 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:40,898 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 198 flow. Second operand 4 states and 412 transitions. [2023-08-26 21:28:40,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 64 transitions, 441 flow [2023-08-26 21:28:40,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 64 transitions, 434 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:28:40,902 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 189 flow [2023-08-26 21:28:40,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-08-26 21:28:40,904 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2023-08-26 21:28:40,907 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 189 flow [2023-08-26 21:28:40,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:40,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:28:40,908 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:28:40,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 21:28:40,908 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-26 21:28:40,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:28:40,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1501779254, now seen corresponding path program 1 times [2023-08-26 21:28:40,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:28:40,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239111720] [2023-08-26 21:28:40,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:28:40,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:28:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:28:40,996 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-26 21:28:40,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:28:40,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239111720] [2023-08-26 21:28:40,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239111720] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:28:40,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:28:40,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:28:40,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978820836] [2023-08-26 21:28:40,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:28:40,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:28:40,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:28:40,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:28:40,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:28:40,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 224 [2023-08-26 21:28:41,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 189 flow. Second operand has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:41,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:28:41,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 224 [2023-08-26 21:28:41,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:28:41,459 INFO L124 PetriNetUnfolderBase]: 1922/2932 cut-off events. [2023-08-26 21:28:41,460 INFO L125 PetriNetUnfolderBase]: For 2768/2784 co-relation queries the response was YES. [2023-08-26 21:28:41,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9283 conditions, 2932 events. 1922/2932 cut-off events. For 2768/2784 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 14500 event pairs, 735 based on Foata normal form. 12/2906 useless extension candidates. Maximal degree in co-relation 9264. Up to 1252 conditions per place. [2023-08-26 21:28:41,476 INFO L140 encePairwiseOnDemand]: 217/224 looper letters, 81 selfloop transitions, 7 changer transitions 0/89 dead transitions. [2023-08-26 21:28:41,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 89 transitions, 609 flow [2023-08-26 21:28:41,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:28:41,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:28:41,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 430 transitions. [2023-08-26 21:28:41,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4799107142857143 [2023-08-26 21:28:41,478 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 430 transitions. [2023-08-26 21:28:41,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 430 transitions. [2023-08-26 21:28:41,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:28:41,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 430 transitions. [2023-08-26 21:28:41,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:41,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:41,481 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:41,481 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 189 flow. Second operand 4 states and 430 transitions. [2023-08-26 21:28:41,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 89 transitions, 609 flow [2023-08-26 21:28:41,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 89 transitions, 604 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:28:41,484 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 228 flow [2023-08-26 21:28:41,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=228, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-08-26 21:28:41,485 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2023-08-26 21:28:41,486 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 228 flow [2023-08-26 21:28:41,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:41,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:28:41,486 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:28:41,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 21:28:41,486 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-26 21:28:41,487 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:28:41,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1947160433, now seen corresponding path program 1 times [2023-08-26 21:28:41,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:28:41,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861126550] [2023-08-26 21:28:41,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:28:41,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:28:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:28:42,716 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-26 21:28:42,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:28:42,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861126550] [2023-08-26 21:28:42,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861126550] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:28:42,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:28:42,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:28:42,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545371013] [2023-08-26 21:28:42,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:28:42,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 21:28:42,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:28:42,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 21:28:42,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-26 21:28:42,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 224 [2023-08-26 21:28:42,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 228 flow. Second operand has 8 states, 8 states have (on average 86.75) internal successors, (694), 8 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:42,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:28:42,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 224 [2023-08-26 21:28:42,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:28:43,579 INFO L124 PetriNetUnfolderBase]: 2632/4095 cut-off events. [2023-08-26 21:28:43,579 INFO L125 PetriNetUnfolderBase]: For 4950/4961 co-relation queries the response was YES. [2023-08-26 21:28:43,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14012 conditions, 4095 events. 2632/4095 cut-off events. For 4950/4961 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 22676 event pairs, 298 based on Foata normal form. 25/4087 useless extension candidates. Maximal degree in co-relation 13992. Up to 2640 conditions per place. [2023-08-26 21:28:43,604 INFO L140 encePairwiseOnDemand]: 214/224 looper letters, 82 selfloop transitions, 19 changer transitions 0/102 dead transitions. [2023-08-26 21:28:43,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 102 transitions, 730 flow [2023-08-26 21:28:43,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:28:43,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:28:43,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 579 transitions. [2023-08-26 21:28:43,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43080357142857145 [2023-08-26 21:28:43,606 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 579 transitions. [2023-08-26 21:28:43,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 579 transitions. [2023-08-26 21:28:43,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:28:43,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 579 transitions. [2023-08-26 21:28:43,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 96.5) internal successors, (579), 6 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:43,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:43,610 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:43,610 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 228 flow. Second operand 6 states and 579 transitions. [2023-08-26 21:28:43,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 102 transitions, 730 flow [2023-08-26 21:28:43,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 102 transitions, 695 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-26 21:28:43,619 INFO L231 Difference]: Finished difference. Result has 55 places, 57 transitions, 377 flow [2023-08-26 21:28:43,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=377, PETRI_PLACES=55, PETRI_TRANSITIONS=57} [2023-08-26 21:28:43,620 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2023-08-26 21:28:43,621 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 57 transitions, 377 flow [2023-08-26 21:28:43,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.75) internal successors, (694), 8 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:43,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:28:43,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:28:43,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 21:28:43,621 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-26 21:28:43,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:28:43,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1196026909, now seen corresponding path program 1 times [2023-08-26 21:28:43,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:28:43,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530487493] [2023-08-26 21:28:43,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:28:43,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:28:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:28:43,868 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-26 21:28:43,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:28:43,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530487493] [2023-08-26 21:28:43,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530487493] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:28:43,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:28:43,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:28:43,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63773649] [2023-08-26 21:28:43,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:28:43,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:28:43,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:28:43,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:28:43,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:28:43,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 224 [2023-08-26 21:28:43,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 57 transitions, 377 flow. Second operand has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:43,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:28:43,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 224 [2023-08-26 21:28:43,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:28:44,346 INFO L124 PetriNetUnfolderBase]: 1824/3012 cut-off events. [2023-08-26 21:28:44,346 INFO L125 PetriNetUnfolderBase]: For 7360/7371 co-relation queries the response was YES. [2023-08-26 21:28:44,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12139 conditions, 3012 events. 1824/3012 cut-off events. For 7360/7371 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16813 event pairs, 222 based on Foata normal form. 276/3244 useless extension candidates. Maximal degree in co-relation 12116. Up to 1827 conditions per place. [2023-08-26 21:28:44,366 INFO L140 encePairwiseOnDemand]: 218/224 looper letters, 124 selfloop transitions, 8 changer transitions 3/136 dead transitions. [2023-08-26 21:28:44,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 136 transitions, 1155 flow [2023-08-26 21:28:44,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:28:44,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:28:44,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 506 transitions. [2023-08-26 21:28:44,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4517857142857143 [2023-08-26 21:28:44,368 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 506 transitions. [2023-08-26 21:28:44,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 506 transitions. [2023-08-26 21:28:44,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:28:44,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 506 transitions. [2023-08-26 21:28:44,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:44,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:44,371 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:44,371 INFO L175 Difference]: Start difference. First operand has 55 places, 57 transitions, 377 flow. Second operand 5 states and 506 transitions. [2023-08-26 21:28:44,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 136 transitions, 1155 flow [2023-08-26 21:28:44,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 136 transitions, 1154 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:28:44,377 INFO L231 Difference]: Finished difference. Result has 61 places, 61 transitions, 433 flow [2023-08-26 21:28:44,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=433, PETRI_PLACES=61, PETRI_TRANSITIONS=61} [2023-08-26 21:28:44,378 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 21 predicate places. [2023-08-26 21:28:44,378 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 61 transitions, 433 flow [2023-08-26 21:28:44,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:44,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:28:44,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:28:44,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 21:28:44,379 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-26 21:28:44,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:28:44,379 INFO L85 PathProgramCache]: Analyzing trace with hash 465561033, now seen corresponding path program 1 times [2023-08-26 21:28:44,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:28:44,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337663439] [2023-08-26 21:28:44,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:28:44,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:28:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:28:45,648 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-26 21:28:45,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:28:45,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337663439] [2023-08-26 21:28:45,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337663439] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:28:45,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:28:45,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 21:28:45,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255342008] [2023-08-26 21:28:45,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:28:45,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 21:28:45,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:28:45,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 21:28:45,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-26 21:28:45,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 224 [2023-08-26 21:28:45,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 61 transitions, 433 flow. Second operand has 9 states, 9 states have (on average 87.77777777777777) internal successors, (790), 9 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:45,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:28:45,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 224 [2023-08-26 21:28:45,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:28:46,367 INFO L124 PetriNetUnfolderBase]: 2049/3447 cut-off events. [2023-08-26 21:28:46,367 INFO L125 PetriNetUnfolderBase]: For 8534/8545 co-relation queries the response was YES. [2023-08-26 21:28:46,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15164 conditions, 3447 events. 2049/3447 cut-off events. For 8534/8545 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 20497 event pairs, 381 based on Foata normal form. 12/3420 useless extension candidates. Maximal degree in co-relation 15137. Up to 2818 conditions per place. [2023-08-26 21:28:46,390 INFO L140 encePairwiseOnDemand]: 215/224 looper letters, 125 selfloop transitions, 27 changer transitions 0/153 dead transitions. [2023-08-26 21:28:46,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 153 transitions, 1368 flow [2023-08-26 21:28:46,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:28:46,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:28:46,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 596 transitions. [2023-08-26 21:28:46,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44345238095238093 [2023-08-26 21:28:46,393 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 596 transitions. [2023-08-26 21:28:46,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 596 transitions. [2023-08-26 21:28:46,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:28:46,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 596 transitions. [2023-08-26 21:28:46,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.33333333333333) internal successors, (596), 6 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:46,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:46,397 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:46,397 INFO L175 Difference]: Start difference. First operand has 61 places, 61 transitions, 433 flow. Second operand 6 states and 596 transitions. [2023-08-26 21:28:46,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 153 transitions, 1368 flow [2023-08-26 21:28:46,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 153 transitions, 1336 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:28:46,409 INFO L231 Difference]: Finished difference. Result has 67 places, 83 transitions, 710 flow [2023-08-26 21:28:46,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=710, PETRI_PLACES=67, PETRI_TRANSITIONS=83} [2023-08-26 21:28:46,410 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places. [2023-08-26 21:28:46,410 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 83 transitions, 710 flow [2023-08-26 21:28:46,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 87.77777777777777) internal successors, (790), 9 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:46,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:28:46,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:28:46,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 21:28:46,411 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:28:46,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:28:46,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1414219854, now seen corresponding path program 1 times [2023-08-26 21:28:46,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:28:46,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878020288] [2023-08-26 21:28:46,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:28:46,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:28:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:28:46,565 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-26 21:28:46,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:28:46,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878020288] [2023-08-26 21:28:46,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878020288] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:28:46,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:28:46,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:28:46,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642891824] [2023-08-26 21:28:46,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:28:46,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:28:46,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:28:46,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:28:46,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:28:46,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 224 [2023-08-26 21:28:46,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 83 transitions, 710 flow. Second operand has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:46,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:28:46,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 224 [2023-08-26 21:28:46,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:28:47,066 INFO L124 PetriNetUnfolderBase]: 1443/2459 cut-off events. [2023-08-26 21:28:47,066 INFO L125 PetriNetUnfolderBase]: For 10881/10884 co-relation queries the response was YES. [2023-08-26 21:28:47,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12029 conditions, 2459 events. 1443/2459 cut-off events. For 10881/10884 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 13820 event pairs, 121 based on Foata normal form. 161/2573 useless extension candidates. Maximal degree in co-relation 11999. Up to 1029 conditions per place. [2023-08-26 21:28:47,081 INFO L140 encePairwiseOnDemand]: 218/224 looper letters, 194 selfloop transitions, 15 changer transitions 3/213 dead transitions. [2023-08-26 21:28:47,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 213 transitions, 2179 flow [2023-08-26 21:28:47,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:28:47,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:28:47,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 707 transitions. [2023-08-26 21:28:47,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45089285714285715 [2023-08-26 21:28:47,084 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 707 transitions. [2023-08-26 21:28:47,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 707 transitions. [2023-08-26 21:28:47,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:28:47,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 707 transitions. [2023-08-26 21:28:47,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:47,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:47,090 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:47,090 INFO L175 Difference]: Start difference. First operand has 67 places, 83 transitions, 710 flow. Second operand 7 states and 707 transitions. [2023-08-26 21:28:47,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 213 transitions, 2179 flow [2023-08-26 21:28:47,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 213 transitions, 2155 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-08-26 21:28:47,112 INFO L231 Difference]: Finished difference. Result has 76 places, 77 transitions, 664 flow [2023-08-26 21:28:47,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=664, PETRI_PLACES=76, PETRI_TRANSITIONS=77} [2023-08-26 21:28:47,113 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 36 predicate places. [2023-08-26 21:28:47,113 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 77 transitions, 664 flow [2023-08-26 21:28:47,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:47,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:28:47,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:28:47,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 21:28:47,113 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:28:47,114 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:28:47,114 INFO L85 PathProgramCache]: Analyzing trace with hash 474725311, now seen corresponding path program 1 times [2023-08-26 21:28:47,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:28:47,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709142810] [2023-08-26 21:28:47,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:28:47,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:28:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:28:47,189 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-26 21:28:47,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:28:47,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709142810] [2023-08-26 21:28:47,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709142810] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:28:47,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:28:47,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:28:47,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550424193] [2023-08-26 21:28:47,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:28:47,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:28:47,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:28:47,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:28:47,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:28:47,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 224 [2023-08-26 21:28:47,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 77 transitions, 664 flow. Second operand has 5 states, 5 states have (on average 94.6) internal successors, (473), 5 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:47,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:28:47,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 224 [2023-08-26 21:28:47,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:28:47,588 INFO L124 PetriNetUnfolderBase]: 1422/2413 cut-off events. [2023-08-26 21:28:47,588 INFO L125 PetriNetUnfolderBase]: For 11401/11404 co-relation queries the response was YES. [2023-08-26 21:28:47,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12900 conditions, 2413 events. 1422/2413 cut-off events. For 11401/11404 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 13386 event pairs, 275 based on Foata normal form. 1/2412 useless extension candidates. Maximal degree in co-relation 12865. Up to 1029 conditions per place. [2023-08-26 21:28:47,600 INFO L140 encePairwiseOnDemand]: 217/224 looper letters, 71 selfloop transitions, 10 changer transitions 47/129 dead transitions. [2023-08-26 21:28:47,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 129 transitions, 1346 flow [2023-08-26 21:28:47,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:28:47,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:28:47,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 516 transitions. [2023-08-26 21:28:47,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4607142857142857 [2023-08-26 21:28:47,603 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 516 transitions. [2023-08-26 21:28:47,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 516 transitions. [2023-08-26 21:28:47,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:28:47,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 516 transitions. [2023-08-26 21:28:47,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.2) internal successors, (516), 5 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:47,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:47,606 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:47,606 INFO L175 Difference]: Start difference. First operand has 76 places, 77 transitions, 664 flow. Second operand 5 states and 516 transitions. [2023-08-26 21:28:47,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 129 transitions, 1346 flow [2023-08-26 21:28:47,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 129 transitions, 1319 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-26 21:28:47,632 INFO L231 Difference]: Finished difference. Result has 73 places, 45 transitions, 370 flow [2023-08-26 21:28:47,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=370, PETRI_PLACES=73, PETRI_TRANSITIONS=45} [2023-08-26 21:28:47,633 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 33 predicate places. [2023-08-26 21:28:47,633 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 45 transitions, 370 flow [2023-08-26 21:28:47,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.6) internal successors, (473), 5 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:47,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:28:47,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:28:47,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 21:28:47,633 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-26 21:28:47,634 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:28:47,634 INFO L85 PathProgramCache]: Analyzing trace with hash -148760734, now seen corresponding path program 1 times [2023-08-26 21:28:47,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:28:47,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888802592] [2023-08-26 21:28:47,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:28:47,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:28:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:28:47,809 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-26 21:28:47,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:28:47,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888802592] [2023-08-26 21:28:47,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888802592] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:28:47,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:28:47,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:28:47,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22217148] [2023-08-26 21:28:47,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:28:47,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:28:47,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:28:47,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:28:47,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:28:47,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 224 [2023-08-26 21:28:47,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 45 transitions, 370 flow. Second operand has 6 states, 6 states have (on average 90.0) internal successors, (540), 6 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:47,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:28:47,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 224 [2023-08-26 21:28:47,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:28:48,001 INFO L124 PetriNetUnfolderBase]: 309/554 cut-off events. [2023-08-26 21:28:48,001 INFO L125 PetriNetUnfolderBase]: For 2309/2311 co-relation queries the response was YES. [2023-08-26 21:28:48,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2824 conditions, 554 events. 309/554 cut-off events. For 2309/2311 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2236 event pairs, 69 based on Foata normal form. 14/566 useless extension candidates. Maximal degree in co-relation 2789. Up to 257 conditions per place. [2023-08-26 21:28:48,005 INFO L140 encePairwiseOnDemand]: 218/224 looper letters, 68 selfloop transitions, 10 changer transitions 14/93 dead transitions. [2023-08-26 21:28:48,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 93 transitions, 911 flow [2023-08-26 21:28:48,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:28:48,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:28:48,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 673 transitions. [2023-08-26 21:28:48,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4292091836734694 [2023-08-26 21:28:48,008 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 673 transitions. [2023-08-26 21:28:48,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 673 transitions. [2023-08-26 21:28:48,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:28:48,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 673 transitions. [2023-08-26 21:28:48,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.14285714285714) internal successors, (673), 7 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:48,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:48,012 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:48,012 INFO L175 Difference]: Start difference. First operand has 73 places, 45 transitions, 370 flow. Second operand 7 states and 673 transitions. [2023-08-26 21:28:48,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 93 transitions, 911 flow [2023-08-26 21:28:48,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 93 transitions, 774 flow, removed 31 selfloop flow, removed 17 redundant places. [2023-08-26 21:28:48,017 INFO L231 Difference]: Finished difference. Result has 59 places, 45 transitions, 306 flow [2023-08-26 21:28:48,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=306, PETRI_PLACES=59, PETRI_TRANSITIONS=45} [2023-08-26 21:28:48,017 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 19 predicate places. [2023-08-26 21:28:48,018 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 306 flow [2023-08-26 21:28:48,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.0) internal successors, (540), 6 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:48,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:28:48,018 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-26 21:28:48,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 21:28:48,018 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-26 21:28:48,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:28:48,019 INFO L85 PathProgramCache]: Analyzing trace with hash 881549471, now seen corresponding path program 1 times [2023-08-26 21:28:48,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:28:48,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665057256] [2023-08-26 21:28:48,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:28:48,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:28:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:28:49,088 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-26 21:28:49,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:28:49,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665057256] [2023-08-26 21:28:49,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665057256] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:28:49,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:28:49,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:28:49,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876466289] [2023-08-26 21:28:49,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:28:49,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:28:49,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:28:49,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:28:49,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:28:49,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 224 [2023-08-26 21:28:49,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 45 transitions, 306 flow. Second operand has 7 states, 7 states have (on average 89.0) internal successors, (623), 7 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:49,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:28:49,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 224 [2023-08-26 21:28:49,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:28:49,447 INFO L124 PetriNetUnfolderBase]: 352/641 cut-off events. [2023-08-26 21:28:49,447 INFO L125 PetriNetUnfolderBase]: For 1664/1664 co-relation queries the response was YES. [2023-08-26 21:28:49,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2944 conditions, 641 events. 352/641 cut-off events. For 1664/1664 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2752 event pairs, 34 based on Foata normal form. 1/642 useless extension candidates. Maximal degree in co-relation 2920. Up to 288 conditions per place. [2023-08-26 21:28:49,451 INFO L140 encePairwiseOnDemand]: 218/224 looper letters, 69 selfloop transitions, 15 changer transitions 14/99 dead transitions. [2023-08-26 21:28:49,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 99 transitions, 856 flow [2023-08-26 21:28:49,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:28:49,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:28:49,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 669 transitions. [2023-08-26 21:28:49,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42665816326530615 [2023-08-26 21:28:49,454 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 669 transitions. [2023-08-26 21:28:49,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 669 transitions. [2023-08-26 21:28:49,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:28:49,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 669 transitions. [2023-08-26 21:28:49,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.57142857142857) internal successors, (669), 7 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:49,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:49,458 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:49,458 INFO L175 Difference]: Start difference. First operand has 59 places, 45 transitions, 306 flow. Second operand 7 states and 669 transitions. [2023-08-26 21:28:49,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 99 transitions, 856 flow [2023-08-26 21:28:49,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 99 transitions, 798 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-08-26 21:28:49,463 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 368 flow [2023-08-26 21:28:49,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=368, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2023-08-26 21:28:49,465 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 19 predicate places. [2023-08-26 21:28:49,465 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 368 flow [2023-08-26 21:28:49,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.0) internal successors, (623), 7 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:49,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:28:49,465 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-26 21:28:49,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 21:28:49,465 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-26 21:28:49,466 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:28:49,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1111729369, now seen corresponding path program 2 times [2023-08-26 21:28:49,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:28:49,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378971070] [2023-08-26 21:28:49,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:28:49,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:28:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:28:49,926 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-26 21:28:49,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:28:49,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378971070] [2023-08-26 21:28:49,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378971070] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:28:49,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:28:49,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:28:49,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771473311] [2023-08-26 21:28:49,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:28:49,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:28:49,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:28:49,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:28:49,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:28:49,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 224 [2023-08-26 21:28:49,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 368 flow. Second operand has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:49,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:28:49,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 224 [2023-08-26 21:28:49,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:28:50,199 INFO L124 PetriNetUnfolderBase]: 436/806 cut-off events. [2023-08-26 21:28:50,199 INFO L125 PetriNetUnfolderBase]: For 2279/2279 co-relation queries the response was YES. [2023-08-26 21:28:50,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3745 conditions, 806 events. 436/806 cut-off events. For 2279/2279 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3779 event pairs, 73 based on Foata normal form. 1/807 useless extension candidates. Maximal degree in co-relation 3721. Up to 442 conditions per place. [2023-08-26 21:28:50,203 INFO L140 encePairwiseOnDemand]: 214/224 looper letters, 55 selfloop transitions, 17 changer transitions 39/112 dead transitions. [2023-08-26 21:28:50,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 112 transitions, 1004 flow [2023-08-26 21:28:50,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:28:50,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:28:50,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 681 transitions. [2023-08-26 21:28:50,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4343112244897959 [2023-08-26 21:28:50,208 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 681 transitions. [2023-08-26 21:28:50,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 681 transitions. [2023-08-26 21:28:50,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:28:50,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 681 transitions. [2023-08-26 21:28:50,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.28571428571429) internal successors, (681), 7 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:50,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:50,212 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:50,213 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 368 flow. Second operand 7 states and 681 transitions. [2023-08-26 21:28:50,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 112 transitions, 1004 flow [2023-08-26 21:28:50,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 112 transitions, 986 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-26 21:28:50,220 INFO L231 Difference]: Finished difference. Result has 65 places, 58 transitions, 501 flow [2023-08-26 21:28:50,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=501, PETRI_PLACES=65, PETRI_TRANSITIONS=58} [2023-08-26 21:28:50,221 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 25 predicate places. [2023-08-26 21:28:50,221 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 58 transitions, 501 flow [2023-08-26 21:28:50,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:50,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:28:50,221 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-26 21:28:50,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 21:28:50,221 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:28:50,222 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:28:50,222 INFO L85 PathProgramCache]: Analyzing trace with hash 631629345, now seen corresponding path program 3 times [2023-08-26 21:28:50,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:28:50,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842859104] [2023-08-26 21:28:50,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:28:50,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:28:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:28:51,733 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-26 21:28:51,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:28:51,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842859104] [2023-08-26 21:28:51,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842859104] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:28:51,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:28:51,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 21:28:51,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388774892] [2023-08-26 21:28:51,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:28:51,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 21:28:51,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:28:51,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 21:28:51,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-08-26 21:28:51,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 224 [2023-08-26 21:28:51,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 58 transitions, 501 flow. Second operand has 10 states, 10 states have (on average 85.1) internal successors, (851), 10 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:51,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:28:51,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 224 [2023-08-26 21:28:51,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:28:52,096 INFO L124 PetriNetUnfolderBase]: 374/697 cut-off events. [2023-08-26 21:28:52,096 INFO L125 PetriNetUnfolderBase]: For 2843/2843 co-relation queries the response was YES. [2023-08-26 21:28:52,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3562 conditions, 697 events. 374/697 cut-off events. For 2843/2843 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3195 event pairs, 49 based on Foata normal form. 1/698 useless extension candidates. Maximal degree in co-relation 3541. Up to 242 conditions per place. [2023-08-26 21:28:52,101 INFO L140 encePairwiseOnDemand]: 215/224 looper letters, 68 selfloop transitions, 15 changer transitions 21/105 dead transitions. [2023-08-26 21:28:52,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 105 transitions, 977 flow [2023-08-26 21:28:52,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 21:28:52,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 21:28:52,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 897 transitions. [2023-08-26 21:28:52,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4004464285714286 [2023-08-26 21:28:52,104 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 897 transitions. [2023-08-26 21:28:52,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 897 transitions. [2023-08-26 21:28:52,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:28:52,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 897 transitions. [2023-08-26 21:28:52,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 89.7) internal successors, (897), 10 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:52,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 224.0) internal successors, (2464), 11 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:52,110 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 224.0) internal successors, (2464), 11 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:52,110 INFO L175 Difference]: Start difference. First operand has 65 places, 58 transitions, 501 flow. Second operand 10 states and 897 transitions. [2023-08-26 21:28:52,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 105 transitions, 977 flow [2023-08-26 21:28:52,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 105 transitions, 962 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-08-26 21:28:52,119 INFO L231 Difference]: Finished difference. Result has 72 places, 56 transitions, 508 flow [2023-08-26 21:28:52,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=508, PETRI_PLACES=72, PETRI_TRANSITIONS=56} [2023-08-26 21:28:52,120 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 32 predicate places. [2023-08-26 21:28:52,120 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 508 flow [2023-08-26 21:28:52,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 85.1) internal successors, (851), 10 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:52,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:28:52,120 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-26 21:28:52,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 21:28:52,121 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:28:52,121 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:28:52,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1635447007, now seen corresponding path program 4 times [2023-08-26 21:28:52,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:28:52,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917135752] [2023-08-26 21:28:52,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:28:52,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:28:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:28:53,304 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-26 21:28:53,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:28:53,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917135752] [2023-08-26 21:28:53,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917135752] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:28:53,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:28:53,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 21:28:53,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527456260] [2023-08-26 21:28:53,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:28:53,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 21:28:53,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:28:53,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 21:28:53,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-26 21:28:53,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 224 [2023-08-26 21:28:53,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 56 transitions, 508 flow. Second operand has 9 states, 9 states have (on average 87.33333333333333) internal successors, (786), 9 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:53,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:28:53,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 224 [2023-08-26 21:28:53,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:28:53,743 INFO L124 PetriNetUnfolderBase]: 457/867 cut-off events. [2023-08-26 21:28:53,743 INFO L125 PetriNetUnfolderBase]: For 3630/3630 co-relation queries the response was YES. [2023-08-26 21:28:53,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4518 conditions, 867 events. 457/867 cut-off events. For 3630/3630 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4261 event pairs, 66 based on Foata normal form. 2/869 useless extension candidates. Maximal degree in co-relation 4493. Up to 335 conditions per place. [2023-08-26 21:28:53,748 INFO L140 encePairwiseOnDemand]: 215/224 looper letters, 69 selfloop transitions, 11 changer transitions 47/128 dead transitions. [2023-08-26 21:28:53,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 128 transitions, 1246 flow [2023-08-26 21:28:53,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 21:28:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 21:28:53,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 756 transitions. [2023-08-26 21:28:53,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.421875 [2023-08-26 21:28:53,751 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 756 transitions. [2023-08-26 21:28:53,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 756 transitions. [2023-08-26 21:28:53,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:28:53,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 756 transitions. [2023-08-26 21:28:53,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.5) internal successors, (756), 8 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:53,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 224.0) internal successors, (2016), 9 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:53,756 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 224.0) internal successors, (2016), 9 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:53,756 INFO L175 Difference]: Start difference. First operand has 72 places, 56 transitions, 508 flow. Second operand 8 states and 756 transitions. [2023-08-26 21:28:53,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 128 transitions, 1246 flow [2023-08-26 21:28:53,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 128 transitions, 1190 flow, removed 16 selfloop flow, removed 8 redundant places. [2023-08-26 21:28:53,767 INFO L231 Difference]: Finished difference. Result has 72 places, 51 transitions, 455 flow [2023-08-26 21:28:53,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=455, PETRI_PLACES=72, PETRI_TRANSITIONS=51} [2023-08-26 21:28:53,768 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 32 predicate places. [2023-08-26 21:28:53,768 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 51 transitions, 455 flow [2023-08-26 21:28:53,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 87.33333333333333) internal successors, (786), 9 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:53,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:28:53,769 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-26 21:28:53,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 21:28:53,769 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:28:53,769 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:28:53,769 INFO L85 PathProgramCache]: Analyzing trace with hash 637557759, now seen corresponding path program 5 times [2023-08-26 21:28:53,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:28:53,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862046728] [2023-08-26 21:28:53,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:28:53,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:28:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:28:55,191 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-26 21:28:55,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:28:55,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862046728] [2023-08-26 21:28:55,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862046728] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:28:55,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:28:55,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 21:28:55,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051558777] [2023-08-26 21:28:55,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:28:55,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 21:28:55,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:28:55,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 21:28:55,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-26 21:28:55,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 224 [2023-08-26 21:28:55,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 51 transitions, 455 flow. Second operand has 9 states, 9 states have (on average 85.33333333333333) internal successors, (768), 9 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:55,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:28:55,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 224 [2023-08-26 21:28:55,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:28:55,595 INFO L124 PetriNetUnfolderBase]: 409/779 cut-off events. [2023-08-26 21:28:55,596 INFO L125 PetriNetUnfolderBase]: For 3279/3279 co-relation queries the response was YES. [2023-08-26 21:28:55,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4072 conditions, 779 events. 409/779 cut-off events. For 3279/3279 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3776 event pairs, 43 based on Foata normal form. 2/781 useless extension candidates. Maximal degree in co-relation 4045. Up to 399 conditions per place. [2023-08-26 21:28:55,600 INFO L140 encePairwiseOnDemand]: 218/224 looper letters, 49 selfloop transitions, 10 changer transitions 29/89 dead transitions. [2023-08-26 21:28:55,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 89 transitions, 878 flow [2023-08-26 21:28:55,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:28:55,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:28:55,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 635 transitions. [2023-08-26 21:28:55,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4049744897959184 [2023-08-26 21:28:55,602 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 635 transitions. [2023-08-26 21:28:55,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 635 transitions. [2023-08-26 21:28:55,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:28:55,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 635 transitions. [2023-08-26 21:28:55,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 90.71428571428571) internal successors, (635), 7 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:55,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:55,607 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:55,607 INFO L175 Difference]: Start difference. First operand has 72 places, 51 transitions, 455 flow. Second operand 7 states and 635 transitions. [2023-08-26 21:28:55,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 89 transitions, 878 flow [2023-08-26 21:28:55,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 89 transitions, 820 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-08-26 21:28:55,617 INFO L231 Difference]: Finished difference. Result has 68 places, 46 transitions, 397 flow [2023-08-26 21:28:55,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=397, PETRI_PLACES=68, PETRI_TRANSITIONS=46} [2023-08-26 21:28:55,618 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 28 predicate places. [2023-08-26 21:28:55,618 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 46 transitions, 397 flow [2023-08-26 21:28:55,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 85.33333333333333) internal successors, (768), 9 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:55,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:28:55,619 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-26 21:28:55,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 21:28:55,619 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:28:55,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:28:55,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1931081769, now seen corresponding path program 6 times [2023-08-26 21:28:55,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:28:55,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637015091] [2023-08-26 21:28:55,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:28:55,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:28:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:28:56,577 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-26 21:28:56,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:28:56,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637015091] [2023-08-26 21:28:56,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637015091] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:28:56,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:28:56,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 21:28:56,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109225033] [2023-08-26 21:28:56,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:28:56,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 21:28:56,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:28:56,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 21:28:56,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-26 21:28:56,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 224 [2023-08-26 21:28:56,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 46 transitions, 397 flow. Second operand has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 9 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:56,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:28:56,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 224 [2023-08-26 21:28:56,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:28:56,968 INFO L124 PetriNetUnfolderBase]: 365/689 cut-off events. [2023-08-26 21:28:56,968 INFO L125 PetriNetUnfolderBase]: For 3564/3564 co-relation queries the response was YES. [2023-08-26 21:28:56,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3610 conditions, 689 events. 365/689 cut-off events. For 3564/3564 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3225 event pairs, 10 based on Foata normal form. 1/690 useless extension candidates. Maximal degree in co-relation 3586. Up to 337 conditions per place. [2023-08-26 21:28:56,971 INFO L140 encePairwiseOnDemand]: 216/224 looper letters, 71 selfloop transitions, 19 changer transitions 23/114 dead transitions. [2023-08-26 21:28:56,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 114 transitions, 1121 flow [2023-08-26 21:28:56,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 21:28:56,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 21:28:56,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 833 transitions. [2023-08-26 21:28:56,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4131944444444444 [2023-08-26 21:28:56,989 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 833 transitions. [2023-08-26 21:28:56,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 833 transitions. [2023-08-26 21:28:56,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:28:56,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 833 transitions. [2023-08-26 21:28:56,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 92.55555555555556) internal successors, (833), 9 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:56,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 224.0) internal successors, (2240), 10 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:57,000 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 224.0) internal successors, (2240), 10 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:57,000 INFO L175 Difference]: Start difference. First operand has 68 places, 46 transitions, 397 flow. Second operand 9 states and 833 transitions. [2023-08-26 21:28:57,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 114 transitions, 1121 flow [2023-08-26 21:28:57,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 114 transitions, 1018 flow, removed 21 selfloop flow, removed 10 redundant places. [2023-08-26 21:28:57,010 INFO L231 Difference]: Finished difference. Result has 69 places, 52 transitions, 484 flow [2023-08-26 21:28:57,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=484, PETRI_PLACES=69, PETRI_TRANSITIONS=52} [2023-08-26 21:28:57,010 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 29 predicate places. [2023-08-26 21:28:57,011 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 52 transitions, 484 flow [2023-08-26 21:28:57,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 9 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:57,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:28:57,023 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-26 21:28:57,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 21:28:57,023 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:28:57,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:28:57,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1473180073, now seen corresponding path program 7 times [2023-08-26 21:28:57,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:28:57,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900182859] [2023-08-26 21:28:57,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:28:57,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:28:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:28:57,672 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-26 21:28:57,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:28:57,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900182859] [2023-08-26 21:28:57,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900182859] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:28:57,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:28:57,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 21:28:57,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373603722] [2023-08-26 21:28:57,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:28:57,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 21:28:57,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:28:57,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 21:28:57,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-26 21:28:57,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 224 [2023-08-26 21:28:57,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 52 transitions, 484 flow. Second operand has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 9 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:57,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:28:57,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 224 [2023-08-26 21:28:57,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:28:57,968 INFO L124 PetriNetUnfolderBase]: 395/764 cut-off events. [2023-08-26 21:28:57,969 INFO L125 PetriNetUnfolderBase]: For 3265/3265 co-relation queries the response was YES. [2023-08-26 21:28:57,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4049 conditions, 764 events. 395/764 cut-off events. For 3265/3265 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3698 event pairs, 118 based on Foata normal form. 2/766 useless extension candidates. Maximal degree in co-relation 4021. Up to 434 conditions per place. [2023-08-26 21:28:57,973 INFO L140 encePairwiseOnDemand]: 217/224 looper letters, 53 selfloop transitions, 8 changer transitions 35/97 dead transitions. [2023-08-26 21:28:57,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 97 transitions, 1043 flow [2023-08-26 21:28:57,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:28:57,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:28:57,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 643 transitions. [2023-08-26 21:28:57,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4100765306122449 [2023-08-26 21:28:57,975 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 643 transitions. [2023-08-26 21:28:57,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 643 transitions. [2023-08-26 21:28:57,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:28:57,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 643 transitions. [2023-08-26 21:28:57,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:57,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:57,979 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:57,979 INFO L175 Difference]: Start difference. First operand has 69 places, 52 transitions, 484 flow. Second operand 7 states and 643 transitions. [2023-08-26 21:28:57,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 97 transitions, 1043 flow [2023-08-26 21:28:57,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 97 transitions, 926 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-08-26 21:28:57,989 INFO L231 Difference]: Finished difference. Result has 70 places, 49 transitions, 424 flow [2023-08-26 21:28:57,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=424, PETRI_PLACES=70, PETRI_TRANSITIONS=49} [2023-08-26 21:28:57,989 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 30 predicate places. [2023-08-26 21:28:57,989 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 49 transitions, 424 flow [2023-08-26 21:28:57,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 9 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:57,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:28:57,990 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-26 21:28:57,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 21:28:57,990 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:28:57,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:28:57,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1039189633, now seen corresponding path program 8 times [2023-08-26 21:28:57,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:28:57,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282300485] [2023-08-26 21:28:57,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:28:57,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:28:58,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:28:58,553 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-26 21:28:58,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:28:58,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282300485] [2023-08-26 21:28:58,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282300485] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:28:58,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:28:58,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:28:58,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635096633] [2023-08-26 21:28:58,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:28:58,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:28:58,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:28:58,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:28:58,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:28:58,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 224 [2023-08-26 21:28:58,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 49 transitions, 424 flow. Second operand has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:58,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:28:58,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 224 [2023-08-26 21:28:58,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:28:58,807 INFO L124 PetriNetUnfolderBase]: 334/669 cut-off events. [2023-08-26 21:28:58,808 INFO L125 PetriNetUnfolderBase]: For 2300/2300 co-relation queries the response was YES. [2023-08-26 21:28:58,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3371 conditions, 669 events. 334/669 cut-off events. For 2300/2300 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3202 event pairs, 77 based on Foata normal form. 2/671 useless extension candidates. Maximal degree in co-relation 3344. Up to 286 conditions per place. [2023-08-26 21:28:58,811 INFO L140 encePairwiseOnDemand]: 214/224 looper letters, 55 selfloop transitions, 11 changer transitions 42/109 dead transitions. [2023-08-26 21:28:58,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 109 transitions, 1109 flow [2023-08-26 21:28:58,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 21:28:58,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 21:28:58,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 764 transitions. [2023-08-26 21:28:58,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4263392857142857 [2023-08-26 21:28:58,814 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 764 transitions. [2023-08-26 21:28:58,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 764 transitions. [2023-08-26 21:28:58,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:28:58,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 764 transitions. [2023-08-26 21:28:58,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 95.5) internal successors, (764), 8 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:58,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 224.0) internal successors, (2016), 9 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:58,818 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 224.0) internal successors, (2016), 9 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:58,818 INFO L175 Difference]: Start difference. First operand has 70 places, 49 transitions, 424 flow. Second operand 8 states and 764 transitions. [2023-08-26 21:28:58,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 109 transitions, 1109 flow [2023-08-26 21:28:58,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 109 transitions, 1061 flow, removed 5 selfloop flow, removed 8 redundant places. [2023-08-26 21:28:58,825 INFO L231 Difference]: Finished difference. Result has 71 places, 45 transitions, 389 flow [2023-08-26 21:28:58,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=389, PETRI_PLACES=71, PETRI_TRANSITIONS=45} [2023-08-26 21:28:58,826 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 31 predicate places. [2023-08-26 21:28:58,826 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 45 transitions, 389 flow [2023-08-26 21:28:58,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:58,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:28:58,826 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-26 21:28:58,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 21:28:58,826 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:28:58,827 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:28:58,827 INFO L85 PathProgramCache]: Analyzing trace with hash 2055740125, now seen corresponding path program 9 times [2023-08-26 21:28:58,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:28:58,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315666132] [2023-08-26 21:28:58,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:28:58,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:28:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:28:59,740 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-26 21:28:59,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:28:59,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315666132] [2023-08-26 21:28:59,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315666132] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:28:59,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:28:59,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 21:28:59,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165100603] [2023-08-26 21:28:59,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:28:59,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 21:28:59,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:28:59,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 21:28:59,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-26 21:28:59,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 224 [2023-08-26 21:28:59,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 45 transitions, 389 flow. Second operand has 9 states, 9 states have (on average 87.33333333333333) internal successors, (786), 9 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:28:59,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:28:59,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 224 [2023-08-26 21:28:59,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:00,005 INFO L124 PetriNetUnfolderBase]: 216/449 cut-off events. [2023-08-26 21:29:00,006 INFO L125 PetriNetUnfolderBase]: For 1734/1734 co-relation queries the response was YES. [2023-08-26 21:29:00,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2363 conditions, 449 events. 216/449 cut-off events. For 1734/1734 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2011 event pairs, 22 based on Foata normal form. 1/450 useless extension candidates. Maximal degree in co-relation 2338. Up to 181 conditions per place. [2023-08-26 21:29:00,008 INFO L140 encePairwiseOnDemand]: 217/224 looper letters, 46 selfloop transitions, 11 changer transitions 35/93 dead transitions. [2023-08-26 21:29:00,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 93 transitions, 891 flow [2023-08-26 21:29:00,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 21:29:00,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 21:29:00,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 739 transitions. [2023-08-26 21:29:00,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41238839285714285 [2023-08-26 21:29:00,010 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 739 transitions. [2023-08-26 21:29:00,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 739 transitions. [2023-08-26 21:29:00,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:00,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 739 transitions. [2023-08-26 21:29:00,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 92.375) internal successors, (739), 8 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:00,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 224.0) internal successors, (2016), 9 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:00,014 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 224.0) internal successors, (2016), 9 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:00,014 INFO L175 Difference]: Start difference. First operand has 71 places, 45 transitions, 389 flow. Second operand 8 states and 739 transitions. [2023-08-26 21:29:00,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 93 transitions, 891 flow [2023-08-26 21:29:00,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 93 transitions, 804 flow, removed 27 selfloop flow, removed 10 redundant places. [2023-08-26 21:29:00,020 INFO L231 Difference]: Finished difference. Result has 64 places, 39 transitions, 295 flow [2023-08-26 21:29:00,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=295, PETRI_PLACES=64, PETRI_TRANSITIONS=39} [2023-08-26 21:29:00,021 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 24 predicate places. [2023-08-26 21:29:00,021 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 39 transitions, 295 flow [2023-08-26 21:29:00,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 87.33333333333333) internal successors, (786), 9 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:00,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:00,021 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-26 21:29:00,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-26 21:29:00,021 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:29:00,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:00,022 INFO L85 PathProgramCache]: Analyzing trace with hash 812696959, now seen corresponding path program 10 times [2023-08-26 21:29:00,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:00,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877589463] [2023-08-26 21:29:00,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:00,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:00,659 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-26 21:29:00,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:00,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877589463] [2023-08-26 21:29:00,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877589463] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:00,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:00,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:29:00,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294317161] [2023-08-26 21:29:00,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:00,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 21:29:00,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:00,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 21:29:00,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-26 21:29:00,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 224 [2023-08-26 21:29:00,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 39 transitions, 295 flow. Second operand has 8 states, 8 states have (on average 88.625) internal successors, (709), 8 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:00,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:00,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 224 [2023-08-26 21:29:00,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:00,857 INFO L124 PetriNetUnfolderBase]: 122/259 cut-off events. [2023-08-26 21:29:00,857 INFO L125 PetriNetUnfolderBase]: For 934/934 co-relation queries the response was YES. [2023-08-26 21:29:00,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1301 conditions, 259 events. 122/259 cut-off events. For 934/934 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 988 event pairs, 4 based on Foata normal form. 1/260 useless extension candidates. Maximal degree in co-relation 1278. Up to 130 conditions per place. [2023-08-26 21:29:00,858 INFO L140 encePairwiseOnDemand]: 217/224 looper letters, 44 selfloop transitions, 13 changer transitions 11/69 dead transitions. [2023-08-26 21:29:00,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 69 transitions, 636 flow [2023-08-26 21:29:00,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:29:00,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:29:00,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 647 transitions. [2023-08-26 21:29:00,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41262755102040816 [2023-08-26 21:29:00,862 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 647 transitions. [2023-08-26 21:29:00,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 647 transitions. [2023-08-26 21:29:00,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:00,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 647 transitions. [2023-08-26 21:29:00,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 92.42857142857143) internal successors, (647), 7 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:00,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:00,865 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 224.0) internal successors, (1792), 8 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:00,865 INFO L175 Difference]: Start difference. First operand has 64 places, 39 transitions, 295 flow. Second operand 7 states and 647 transitions. [2023-08-26 21:29:00,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 69 transitions, 636 flow [2023-08-26 21:29:00,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 69 transitions, 535 flow, removed 25 selfloop flow, removed 13 redundant places. [2023-08-26 21:29:00,868 INFO L231 Difference]: Finished difference. Result has 60 places, 44 transitions, 307 flow [2023-08-26 21:29:00,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=307, PETRI_PLACES=60, PETRI_TRANSITIONS=44} [2023-08-26 21:29:00,869 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2023-08-26 21:29:00,869 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 44 transitions, 307 flow [2023-08-26 21:29:00,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.625) internal successors, (709), 8 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:00,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:00,869 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-26 21:29:00,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-26 21:29:00,870 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:29:00,870 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:00,870 INFO L85 PathProgramCache]: Analyzing trace with hash -659026243, now seen corresponding path program 11 times [2023-08-26 21:29:00,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:00,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696958342] [2023-08-26 21:29:00,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:00,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:29:02,047 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-26 21:29:02,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:29:02,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696958342] [2023-08-26 21:29:02,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696958342] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:29:02,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:29:02,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 21:29:02,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089636309] [2023-08-26 21:29:02,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:29:02,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 21:29:02,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:29:02,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 21:29:02,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-26 21:29:02,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 224 [2023-08-26 21:29:02,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 44 transitions, 307 flow. Second operand has 9 states, 9 states have (on average 87.33333333333333) internal successors, (786), 9 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:02,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:29:02,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 224 [2023-08-26 21:29:02,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:29:02,418 INFO L124 PetriNetUnfolderBase]: 118/262 cut-off events. [2023-08-26 21:29:02,419 INFO L125 PetriNetUnfolderBase]: For 640/640 co-relation queries the response was YES. [2023-08-26 21:29:02,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1253 conditions, 262 events. 118/262 cut-off events. For 640/640 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1064 event pairs, 11 based on Foata normal form. 2/264 useless extension candidates. Maximal degree in co-relation 1234. Up to 108 conditions per place. [2023-08-26 21:29:02,420 INFO L140 encePairwiseOnDemand]: 216/224 looper letters, 50 selfloop transitions, 9 changer transitions 28/88 dead transitions. [2023-08-26 21:29:02,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 88 transitions, 747 flow [2023-08-26 21:29:02,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 21:29:02,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 21:29:02,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 818 transitions. [2023-08-26 21:29:02,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40575396825396826 [2023-08-26 21:29:02,422 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 818 transitions. [2023-08-26 21:29:02,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 818 transitions. [2023-08-26 21:29:02,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:29:02,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 818 transitions. [2023-08-26 21:29:02,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 90.88888888888889) internal successors, (818), 9 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:02,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 224.0) internal successors, (2240), 10 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:02,426 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 224.0) internal successors, (2240), 10 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:02,426 INFO L175 Difference]: Start difference. First operand has 60 places, 44 transitions, 307 flow. Second operand 9 states and 818 transitions. [2023-08-26 21:29:02,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 88 transitions, 747 flow [2023-08-26 21:29:02,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 88 transitions, 695 flow, removed 17 selfloop flow, removed 5 redundant places. [2023-08-26 21:29:02,429 INFO L231 Difference]: Finished difference. Result has 66 places, 39 transitions, 248 flow [2023-08-26 21:29:02,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=248, PETRI_PLACES=66, PETRI_TRANSITIONS=39} [2023-08-26 21:29:02,430 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 26 predicate places. [2023-08-26 21:29:02,430 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 39 transitions, 248 flow [2023-08-26 21:29:02,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 87.33333333333333) internal successors, (786), 9 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:29:02,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:29:02,430 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-26 21:29:02,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-26 21:29:02,431 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-26 21:29:02,431 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:29:02,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1457831613, now seen corresponding path program 12 times [2023-08-26 21:29:02,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:29:02,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815824522] [2023-08-26 21:29:02,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:29:02,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:29:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:29:02,475 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 21:29:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:29:02,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 21:29:02,544 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 21:29:02,547 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (17 of 18 remaining) [2023-08-26 21:29:02,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2023-08-26 21:29:02,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-08-26 21:29:02,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (14 of 18 remaining) [2023-08-26 21:29:02,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-08-26 21:29:02,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-08-26 21:29:02,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-08-26 21:29:02,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-08-26 21:29:02,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2023-08-26 21:29:02,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2023-08-26 21:29:02,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2023-08-26 21:29:02,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-08-26 21:29:02,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-08-26 21:29:02,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (4 of 18 remaining) [2023-08-26 21:29:02,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-08-26 21:29:02,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-08-26 21:29:02,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-08-26 21:29:02,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-08-26 21:29:02,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-26 21:29:02,553 INFO L445 BasicCegarLoop]: Path program histogram: [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:29:02,559 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 21:29:02,559 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 21:29:02,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:29:02 BasicIcfg [2023-08-26 21:29:02,618 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 21:29:02,618 INFO L158 Benchmark]: Toolchain (without parser) took 33032.39ms. Allocated memory was 381.7MB in the beginning and 931.1MB in the end (delta: 549.5MB). Free memory was 356.8MB in the beginning and 611.2MB in the end (delta: -254.3MB). Peak memory consumption was 296.7MB. Max. memory is 16.0GB. [2023-08-26 21:29:02,618 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 381.7MB. Free memory is still 359.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 21:29:02,618 INFO L158 Benchmark]: CACSL2BoogieTranslator took 621.89ms. Allocated memory is still 381.7MB. Free memory was 356.8MB in the beginning and 330.3MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-26 21:29:02,619 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.30ms. Allocated memory is still 381.7MB. Free memory was 330.3MB in the beginning and 327.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 21:29:02,619 INFO L158 Benchmark]: Boogie Preprocessor took 42.59ms. Allocated memory is still 381.7MB. Free memory was 327.5MB in the beginning and 325.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:29:02,619 INFO L158 Benchmark]: RCFGBuilder took 799.81ms. Allocated memory is still 381.7MB. Free memory was 325.4MB in the beginning and 328.0MB in the end (delta: -2.6MB). Peak memory consumption was 32.5MB. Max. memory is 16.0GB. [2023-08-26 21:29:02,619 INFO L158 Benchmark]: TraceAbstraction took 31498.59ms. Allocated memory was 381.7MB in the beginning and 931.1MB in the end (delta: 549.5MB). Free memory was 328.0MB in the beginning and 611.2MB in the end (delta: -283.2MB). Peak memory consumption was 268.3MB. Max. memory is 16.0GB. [2023-08-26 21:29:02,620 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.15ms. Allocated memory is still 381.7MB. Free memory is still 359.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 621.89ms. Allocated memory is still 381.7MB. Free memory was 356.8MB in the beginning and 330.3MB in the end (delta: 26.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 63.30ms. Allocated memory is still 381.7MB. Free memory was 330.3MB in the beginning and 327.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 42.59ms. Allocated memory is still 381.7MB. Free memory was 327.5MB in the beginning and 325.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 799.81ms. Allocated memory is still 381.7MB. Free memory was 325.4MB in the beginning and 328.0MB in the end (delta: -2.6MB). Peak memory consumption was 32.5MB. Max. memory is 16.0GB. * TraceAbstraction took 31498.59ms. Allocated memory was 381.7MB in the beginning and 931.1MB in the end (delta: 549.5MB). Free memory was 328.0MB in the beginning and 611.2MB in the end (delta: -283.2MB). Peak memory consumption was 268.3MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 123 PlacesBefore, 40 PlacesAfterwards, 116 TransitionsBefore, 30 TransitionsAfterwards, 2894 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 105 TotalNumberOfCompositions, 10694 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3606, independent: 3305, independent conditional: 0, independent unconditional: 3305, dependent: 301, dependent conditional: 0, dependent unconditional: 301, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1548, independent: 1492, independent conditional: 0, independent unconditional: 1492, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3606, independent: 1813, independent conditional: 0, independent unconditional: 1813, dependent: 245, dependent conditional: 0, dependent unconditional: 245, unknown: 1548, unknown conditional: 0, unknown unconditional: 1548] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 123, Positive conditional cache size: 0, Positive unconditional cache size: 123, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$r_buff1_thd3; [L733] 0 _Bool y$read_delayed; [L734] 0 int *y$read_delayed_var; [L735] 0 int y$w_buff0; [L736] 0 _Bool y$w_buff0_used; [L737] 0 int y$w_buff1; [L738] 0 _Bool y$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2321; [L855] FCALL, FORK 0 pthread_create(&t2321, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2321, ((void *)0), P0, ((void *)0))=-3, t2321={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L856] 0 pthread_t t2322; [L857] FCALL, FORK 0 pthread_create(&t2322, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2322, ((void *)0), P1, ((void *)0))=-2, t2321={5:0}, t2322={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L858] 0 pthread_t t2323; [L859] FCALL, FORK 0 pthread_create(&t2323, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t2323, ((void *)0), P2, ((void *)0))=-1, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L796] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L813] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L744] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L747] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L832] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L839] EXPR 3 __unbuffered_cnt + 1 [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 3 return 0; [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L770] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __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$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L806] EXPR 2 __unbuffered_cnt + 1 [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; [L777] EXPR 1 __unbuffered_cnt + 1 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __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, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={66:67}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __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=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 777]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 806]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 806]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 857]: 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: 855]: 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: 859]: 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, 152 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: 31.3s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 983 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 983 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 383 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3269 IncrementalHoareTripleChecker+Invalid, 3652 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 383 mSolverCounterUnsat, 4 mSDtfsCounter, 3269 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=710occurred in iteration=10, InterpolantAutomatonStates: 148, 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.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 439 NumberOfCodeBlocks, 439 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 393 ConstructedInterpolants, 0 QuantifiedInterpolants, 4804 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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-26 21:29:02,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...