/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 10:10:52,281 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 10:10:52,346 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-27 10:10:52,351 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 10:10:52,352 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 10:10:52,381 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 10:10:52,382 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 10:10:52,382 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 10:10:52,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 10:10:52,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 10:10:52,385 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 10:10:52,386 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 10:10:52,386 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 10:10:52,387 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 10:10:52,387 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 10:10:52,387 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 10:10:52,387 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 10:10:52,387 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 10:10:52,388 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 10:10:52,388 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 10:10:52,388 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 10:10:52,389 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 10:10:52,389 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 10:10:52,389 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 10:10:52,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 10:10:52,390 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 10:10:52,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 10:10:52,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:10:52,390 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 10:10:52,390 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 10:10:52,391 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 10:10:52,391 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 10:10:52,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 10:10:52,391 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 10:10:52,392 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 10:10:52,392 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 10:10:52,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 10:10:52,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 10:10:52,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 10:10:52,645 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 10:10:52,645 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 10:10:52,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i [2023-08-27 10:10:53,805 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 10:10:53,982 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 10:10:53,983 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i [2023-08-27 10:10:53,993 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/595c28fca/be861a2b905048f9b35da4c35d577662/FLAGf8f109cb7 [2023-08-27 10:10:54,016 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/595c28fca/be861a2b905048f9b35da4c35d577662 [2023-08-27 10:10:54,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 10:10:54,019 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 10:10:54,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 10:10:54,020 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 10:10:54,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 10:10:54,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:10:54" (1/1) ... [2023-08-27 10:10:54,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dd316c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:10:54, skipping insertion in model container [2023-08-27 10:10:54,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:10:54" (1/1) ... [2023-08-27 10:10:54,053 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 10:10:54,370 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:10:54,382 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 10:10:54,405 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 10:10:54,407 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 10:10:54,448 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:10:54,470 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:10:54,471 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:10:54,476 INFO L206 MainTranslator]: Completed translation [2023-08-27 10:10:54,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:10:54 WrapperNode [2023-08-27 10:10:54,476 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 10:10:54,477 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 10:10:54,477 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 10:10:54,477 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 10:10:54,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:10:54" (1/1) ... [2023-08-27 10:10:54,496 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:10:54" (1/1) ... [2023-08-27 10:10:54,527 INFO L138 Inliner]: procedures = 177, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2023-08-27 10:10:54,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 10:10:54,527 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 10:10:54,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 10:10:54,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 10:10:54,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:10:54" (1/1) ... [2023-08-27 10:10:54,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:10:54" (1/1) ... [2023-08-27 10:10:54,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:10:54" (1/1) ... [2023-08-27 10:10:54,549 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:10:54" (1/1) ... [2023-08-27 10:10:54,567 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:10:54" (1/1) ... [2023-08-27 10:10:54,568 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:10:54" (1/1) ... [2023-08-27 10:10:54,570 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:10:54" (1/1) ... [2023-08-27 10:10:54,571 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:10:54" (1/1) ... [2023-08-27 10:10:54,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 10:10:54,573 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 10:10:54,574 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 10:10:54,574 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 10:10:54,574 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:10:54" (1/1) ... [2023-08-27 10:10:54,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:10:54,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 10:10:54,613 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-27 10:10:54,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-27 10:10:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 10:10:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 10:10:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 10:10:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 10:10:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 10:10:54,650 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 10:10:54,650 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 10:10:54,651 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 10:10:54,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 10:10:54,651 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 10:10:54,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 10:10:54,651 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-27 10:10:54,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-27 10:10:54,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 10:10:54,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 10:10:54,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 10:10:54,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 10:10:54,652 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 10:10:54,758 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 10:10:54,760 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 10:10:54,983 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 10:10:55,070 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 10:10:55,070 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 10:10:55,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:10:55 BoogieIcfgContainer [2023-08-27 10:10:55,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 10:10:55,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 10:10:55,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 10:10:55,076 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 10:10:55,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 10:10:54" (1/3) ... [2023-08-27 10:10:55,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa1a7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:10:55, skipping insertion in model container [2023-08-27 10:10:55,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:10:54" (2/3) ... [2023-08-27 10:10:55,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa1a7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:10:55, skipping insertion in model container [2023-08-27 10:10:55,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:10:55" (3/3) ... [2023-08-27 10:10:55,078 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055_power.oepc_pso.oepc_rmo.oepc.i [2023-08-27 10:10:55,090 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 10:10:55,090 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-27 10:10:55,090 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 10:10:55,141 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 10:10:55,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 140 transitions, 300 flow [2023-08-27 10:10:55,237 INFO L124 PetriNetUnfolderBase]: 3/136 cut-off events. [2023-08-27 10:10:55,237 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:10:55,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 3/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2023-08-27 10:10:55,243 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 140 transitions, 300 flow [2023-08-27 10:10:55,248 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 136 transitions, 284 flow [2023-08-27 10:10:55,251 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 10:10:55,261 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 136 transitions, 284 flow [2023-08-27 10:10:55,264 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 136 transitions, 284 flow [2023-08-27 10:10:55,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 136 transitions, 284 flow [2023-08-27 10:10:55,305 INFO L124 PetriNetUnfolderBase]: 3/136 cut-off events. [2023-08-27 10:10:55,305 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:10:55,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 3/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2023-08-27 10:10:55,309 INFO L119 LiptonReduction]: Number of co-enabled transitions 4414 [2023-08-27 10:10:58,498 INFO L134 LiptonReduction]: Checked pairs total: 16840 [2023-08-27 10:10:58,498 INFO L136 LiptonReduction]: Total number of compositions: 122 [2023-08-27 10:10:58,506 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 10:10:58,510 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;@3b3a65bf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 10:10:58,510 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-27 10:10:58,512 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 10:10:58,512 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-27 10:10:58,512 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:10:58,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:10:58,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 10:10:58,513 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:10:58,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:10:58,516 INFO L85 PathProgramCache]: Analyzing trace with hash 622594, now seen corresponding path program 1 times [2023-08-27 10:10:58,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:10:58,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980896095] [2023-08-27 10:10:58,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:10:58,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:10:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:10:58,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:10:58,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:10:58,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980896095] [2023-08-27 10:10:58,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980896095] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:10:58,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:10:58,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:10:58,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29744385] [2023-08-27 10:10:58,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:10:58,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:10:58,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:10:58,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:10:58,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:10:58,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 262 [2023-08-27 10:10:58,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:10:58,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:10:58,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 262 [2023-08-27 10:10:58,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:00,240 INFO L124 PetriNetUnfolderBase]: 12064/17436 cut-off events. [2023-08-27 10:11:00,241 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2023-08-27 10:11:00,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33879 conditions, 17436 events. 12064/17436 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 822. Compared 107793 event pairs, 4950 based on Foata normal form. 0/13631 useless extension candidates. Maximal degree in co-relation 33867. Up to 13549 conditions per place. [2023-08-27 10:11:00,334 INFO L140 encePairwiseOnDemand]: 258/262 looper letters, 50 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-08-27 10:11:00,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 59 transitions, 243 flow [2023-08-27 10:11:00,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:11:00,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:11:00,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2023-08-27 10:11:00,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5089058524173028 [2023-08-27 10:11:00,343 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2023-08-27 10:11:00,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2023-08-27 10:11:00,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:00,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2023-08-27 10:11:00,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:00,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 262.0) internal successors, (1048), 4 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:00,352 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 262.0) internal successors, (1048), 4 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:00,353 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 88 flow. Second operand 3 states and 400 transitions. [2023-08-27 10:11:00,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 59 transitions, 243 flow [2023-08-27 10:11:00,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 236 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 10:11:00,357 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 84 flow [2023-08-27 10:11:00,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2023-08-27 10:11:00,360 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2023-08-27 10:11:00,360 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 84 flow [2023-08-27 10:11:00,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:00,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:00,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 10:11:00,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 10:11:00,361 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:11:00,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:00,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1368293428, now seen corresponding path program 1 times [2023-08-27 10:11:00,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:00,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107722506] [2023-08-27 10:11:00,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:00,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:00,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:11:00,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:00,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107722506] [2023-08-27 10:11:00,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107722506] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:00,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:00,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:11:00,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84217755] [2023-08-27 10:11:00,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:00,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:11:00,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:00,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:11:00,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:11:00,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 262 [2023-08-27 10:11:00,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:00,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:00,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 262 [2023-08-27 10:11:00,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:01,604 INFO L124 PetriNetUnfolderBase]: 12064/16159 cut-off events. [2023-08-27 10:11:01,604 INFO L125 PetriNetUnfolderBase]: For 811/811 co-relation queries the response was YES. [2023-08-27 10:11:01,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33412 conditions, 16159 events. 12064/16159 cut-off events. For 811/811 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 83327 event pairs, 12064 based on Foata normal form. 0/12321 useless extension candidates. Maximal degree in co-relation 33402. Up to 16125 conditions per place. [2023-08-27 10:11:01,667 INFO L140 encePairwiseOnDemand]: 257/262 looper letters, 28 selfloop transitions, 1 changer transitions 0/32 dead transitions. [2023-08-27 10:11:01,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 32 transitions, 134 flow [2023-08-27 10:11:01,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:11:01,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:11:01,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2023-08-27 10:11:01,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4618320610687023 [2023-08-27 10:11:01,669 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2023-08-27 10:11:01,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2023-08-27 10:11:01,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:01,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2023-08-27 10:11:01,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 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-27 10:11:01,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 262.0) internal successors, (1048), 4 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:01,672 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 262.0) internal successors, (1048), 4 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:01,672 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 84 flow. Second operand 3 states and 363 transitions. [2023-08-27 10:11:01,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 32 transitions, 134 flow [2023-08-27 10:11:01,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:11:01,674 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 74 flow [2023-08-27 10:11:01,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2023-08-27 10:11:01,674 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -7 predicate places. [2023-08-27 10:11:01,675 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 74 flow [2023-08-27 10:11:01,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:01,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:01,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 10:11:01,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 10:11:01,675 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:11:01,676 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:01,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1368293429, now seen corresponding path program 1 times [2023-08-27 10:11:01,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:01,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330082475] [2023-08-27 10:11:01,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:01,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:01,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:11:01,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:01,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330082475] [2023-08-27 10:11:01,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330082475] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:01,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:01,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:11:01,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951658815] [2023-08-27 10:11:01,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:01,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:11:01,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:01,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:11:01,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:11:01,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 262 [2023-08-27 10:11:01,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:01,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:01,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 262 [2023-08-27 10:11:01,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:02,479 INFO L124 PetriNetUnfolderBase]: 7784/10717 cut-off events. [2023-08-27 10:11:02,480 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:11:02,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21638 conditions, 10717 events. 7784/10717 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 56510 event pairs, 2133 based on Foata normal form. 0/8751 useless extension candidates. Maximal degree in co-relation 21632. Up to 8563 conditions per place. [2023-08-27 10:11:02,517 INFO L140 encePairwiseOnDemand]: 253/262 looper letters, 47 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2023-08-27 10:11:02,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 55 transitions, 230 flow [2023-08-27 10:11:02,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:11:02,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:11:02,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2023-08-27 10:11:02,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4910941475826972 [2023-08-27 10:11:02,519 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 386 transitions. [2023-08-27 10:11:02,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 386 transitions. [2023-08-27 10:11:02,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:02,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 386 transitions. [2023-08-27 10:11:02,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:02,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 262.0) internal successors, (1048), 4 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:02,521 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 262.0) internal successors, (1048), 4 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:02,521 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 74 flow. Second operand 3 states and 386 transitions. [2023-08-27 10:11:02,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 55 transitions, 230 flow [2023-08-27 10:11:02,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 229 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:11:02,523 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 112 flow [2023-08-27 10:11:02,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2023-08-27 10:11:02,524 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2023-08-27 10:11:02,524 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 112 flow [2023-08-27 10:11:02,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:02,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:02,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:11:02,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 10:11:02,528 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:11:02,528 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:02,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1260883290, now seen corresponding path program 1 times [2023-08-27 10:11:02,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:02,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518151532] [2023-08-27 10:11:02,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:02,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:02,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:11:02,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:02,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518151532] [2023-08-27 10:11:02,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518151532] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:02,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:02,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:11:02,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480892180] [2023-08-27 10:11:02,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:02,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:11:02,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:02,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:11:02,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:11:02,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 262 [2023-08-27 10:11:02,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:02,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:02,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 262 [2023-08-27 10:11:02,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:04,774 INFO L124 PetriNetUnfolderBase]: 25102/34421 cut-off events. [2023-08-27 10:11:04,774 INFO L125 PetriNetUnfolderBase]: For 3244/3244 co-relation queries the response was YES. [2023-08-27 10:11:04,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82100 conditions, 34421 events. 25102/34421 cut-off events. For 3244/3244 co-relation queries the response was YES. Maximal size of possible extension queue 1082. Compared 195929 event pairs, 8588 based on Foata normal form. 0/29789 useless extension candidates. Maximal degree in co-relation 82092. Up to 18661 conditions per place. [2023-08-27 10:11:04,938 INFO L140 encePairwiseOnDemand]: 253/262 looper letters, 59 selfloop transitions, 8 changer transitions 0/67 dead transitions. [2023-08-27 10:11:04,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 67 transitions, 340 flow [2023-08-27 10:11:04,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:11:04,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:11:04,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2023-08-27 10:11:04,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48091603053435117 [2023-08-27 10:11:04,940 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2023-08-27 10:11:04,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2023-08-27 10:11:04,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:04,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2023-08-27 10:11:04,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:04,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 262.0) internal successors, (1048), 4 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:04,943 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 262.0) internal successors, (1048), 4 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:04,943 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 112 flow. Second operand 3 states and 378 transitions. [2023-08-27 10:11:04,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 67 transitions, 340 flow [2023-08-27 10:11:04,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 67 transitions, 331 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:11:04,959 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 169 flow [2023-08-27 10:11:04,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2023-08-27 10:11:04,960 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2023-08-27 10:11:04,961 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 169 flow [2023-08-27 10:11:04,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:04,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:04,961 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:11:04,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 10:11:04,962 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:11:04,962 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:04,962 INFO L85 PathProgramCache]: Analyzing trace with hash -357036580, now seen corresponding path program 1 times [2023-08-27 10:11:04,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:04,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972489780] [2023-08-27 10:11:04,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:04,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:05,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:11:05,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:05,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972489780] [2023-08-27 10:11:05,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972489780] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:05,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:05,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:11:05,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976686280] [2023-08-27 10:11:05,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:05,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:11:05,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:05,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:11:05,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:11:05,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 262 [2023-08-27 10:11:05,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:05,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:05,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 262 [2023-08-27 10:11:05,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:06,776 INFO L124 PetriNetUnfolderBase]: 15065/21188 cut-off events. [2023-08-27 10:11:06,776 INFO L125 PetriNetUnfolderBase]: For 10792/10921 co-relation queries the response was YES. [2023-08-27 10:11:06,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56707 conditions, 21188 events. 15065/21188 cut-off events. For 10792/10921 co-relation queries the response was YES. Maximal size of possible extension queue 946. Compared 127639 event pairs, 3703 based on Foata normal form. 4/19815 useless extension candidates. Maximal degree in co-relation 56696. Up to 8183 conditions per place. [2023-08-27 10:11:06,950 INFO L140 encePairwiseOnDemand]: 253/262 looper letters, 76 selfloop transitions, 9 changer transitions 0/91 dead transitions. [2023-08-27 10:11:06,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 91 transitions, 505 flow [2023-08-27 10:11:06,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:11:06,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:11:06,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 517 transitions. [2023-08-27 10:11:06,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4933206106870229 [2023-08-27 10:11:06,953 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 517 transitions. [2023-08-27 10:11:06,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 517 transitions. [2023-08-27 10:11:06,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:06,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 517 transitions. [2023-08-27 10:11:06,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:06,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 262.0) internal successors, (1310), 5 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:06,959 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 262.0) internal successors, (1310), 5 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:06,959 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 169 flow. Second operand 4 states and 517 transitions. [2023-08-27 10:11:06,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 91 transitions, 505 flow [2023-08-27 10:11:06,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 91 transitions, 473 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:11:06,978 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 211 flow [2023-08-27 10:11:06,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2023-08-27 10:11:06,980 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 0 predicate places. [2023-08-27 10:11:06,980 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 211 flow [2023-08-27 10:11:06,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:06,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:06,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:11:06,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 10:11:06,981 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:11:06,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:06,981 INFO L85 PathProgramCache]: Analyzing trace with hash 603399820, now seen corresponding path program 1 times [2023-08-27 10:11:06,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:06,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501455013] [2023-08-27 10:11:06,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:06,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:07,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:11:07,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:07,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501455013] [2023-08-27 10:11:07,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501455013] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:07,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:07,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:11:07,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641695818] [2023-08-27 10:11:07,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:07,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:11:07,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:07,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:11:07,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:11:07,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 262 [2023-08-27 10:11:07,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 211 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:07,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:07,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 262 [2023-08-27 10:11:07,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:08,863 INFO L124 PetriNetUnfolderBase]: 16173/22586 cut-off events. [2023-08-27 10:11:08,863 INFO L125 PetriNetUnfolderBase]: For 18001/18001 co-relation queries the response was YES. [2023-08-27 10:11:08,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64881 conditions, 22586 events. 16173/22586 cut-off events. For 18001/18001 co-relation queries the response was YES. Maximal size of possible extension queue 871. Compared 128814 event pairs, 3780 based on Foata normal form. 0/20968 useless extension candidates. Maximal degree in co-relation 64869. Up to 20536 conditions per place. [2023-08-27 10:11:08,963 INFO L140 encePairwiseOnDemand]: 258/262 looper letters, 57 selfloop transitions, 5 changer transitions 0/66 dead transitions. [2023-08-27 10:11:08,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 66 transitions, 409 flow [2023-08-27 10:11:08,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:11:08,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:11:08,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2023-08-27 10:11:08,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4847328244274809 [2023-08-27 10:11:08,965 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 381 transitions. [2023-08-27 10:11:08,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 381 transitions. [2023-08-27 10:11:08,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:08,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 381 transitions. [2023-08-27 10:11:08,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.0) internal successors, (381), 3 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-27 10:11:08,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 262.0) internal successors, (1048), 4 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:08,967 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 262.0) internal successors, (1048), 4 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:08,968 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 211 flow. Second operand 3 states and 381 transitions. [2023-08-27 10:11:08,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 66 transitions, 409 flow [2023-08-27 10:11:08,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 66 transitions, 383 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-27 10:11:08,977 INFO L231 Difference]: Finished difference. Result has 51 places, 51 transitions, 234 flow [2023-08-27 10:11:08,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=51, PETRI_TRANSITIONS=51} [2023-08-27 10:11:08,978 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2023-08-27 10:11:08,978 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 51 transitions, 234 flow [2023-08-27 10:11:08,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:08,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:08,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:11:08,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 10:11:08,979 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:11:08,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:08,979 INFO L85 PathProgramCache]: Analyzing trace with hash 432674117, now seen corresponding path program 1 times [2023-08-27 10:11:08,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:08,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239423185] [2023-08-27 10:11:08,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:08,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:09,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:11:09,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:09,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239423185] [2023-08-27 10:11:09,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239423185] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:09,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:09,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:11:09,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533036826] [2023-08-27 10:11:09,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:09,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:11:09,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:09,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:11:09,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:11:09,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 262 [2023-08-27 10:11:09,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 51 transitions, 234 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:09,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:09,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 262 [2023-08-27 10:11:09,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:10,858 INFO L124 PetriNetUnfolderBase]: 17902/24537 cut-off events. [2023-08-27 10:11:10,858 INFO L125 PetriNetUnfolderBase]: For 15498/15498 co-relation queries the response was YES. [2023-08-27 10:11:10,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70838 conditions, 24537 events. 17902/24537 cut-off events. For 15498/15498 co-relation queries the response was YES. Maximal size of possible extension queue 791. Compared 133772 event pairs, 2818 based on Foata normal form. 40/23925 useless extension candidates. Maximal degree in co-relation 70825. Up to 13009 conditions per place. [2023-08-27 10:11:10,941 INFO L140 encePairwiseOnDemand]: 253/262 looper letters, 94 selfloop transitions, 14 changer transitions 0/108 dead transitions. [2023-08-27 10:11:10,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 108 transitions, 680 flow [2023-08-27 10:11:10,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:11:10,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:11:10,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 504 transitions. [2023-08-27 10:11:10,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48091603053435117 [2023-08-27 10:11:10,943 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 504 transitions. [2023-08-27 10:11:10,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 504 transitions. [2023-08-27 10:11:10,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:10,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 504 transitions. [2023-08-27 10:11:10,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:10,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 262.0) internal successors, (1310), 5 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:10,946 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 262.0) internal successors, (1310), 5 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:10,946 INFO L175 Difference]: Start difference. First operand has 51 places, 51 transitions, 234 flow. Second operand 4 states and 504 transitions. [2023-08-27 10:11:10,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 108 transitions, 680 flow [2023-08-27 10:11:10,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 108 transitions, 673 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:11:10,950 INFO L231 Difference]: Finished difference. Result has 56 places, 60 transitions, 343 flow [2023-08-27 10:11:10,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=343, PETRI_PLACES=56, PETRI_TRANSITIONS=60} [2023-08-27 10:11:10,951 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2023-08-27 10:11:10,951 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 60 transitions, 343 flow [2023-08-27 10:11:10,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:10,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:10,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:11:10,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 10:11:10,951 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:11:10,952 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:10,952 INFO L85 PathProgramCache]: Analyzing trace with hash 527988725, now seen corresponding path program 1 times [2023-08-27 10:11:10,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:10,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985106511] [2023-08-27 10:11:10,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:10,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:11,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:11:11,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:11,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985106511] [2023-08-27 10:11:11,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985106511] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:11,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:11,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:11:11,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166302863] [2023-08-27 10:11:11,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:11,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:11:11,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:11,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:11:11,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:11:11,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 262 [2023-08-27 10:11:11,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 60 transitions, 343 flow. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:11,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:11,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 262 [2023-08-27 10:11:11,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:12,235 INFO L124 PetriNetUnfolderBase]: 11298/16759 cut-off events. [2023-08-27 10:11:12,235 INFO L125 PetriNetUnfolderBase]: For 20418/21345 co-relation queries the response was YES. [2023-08-27 10:11:12,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51636 conditions, 16759 events. 11298/16759 cut-off events. For 20418/21345 co-relation queries the response was YES. Maximal size of possible extension queue 743. Compared 105942 event pairs, 1921 based on Foata normal form. 1369/17088 useless extension candidates. Maximal degree in co-relation 51619. Up to 11572 conditions per place. [2023-08-27 10:11:12,312 INFO L140 encePairwiseOnDemand]: 255/262 looper letters, 117 selfloop transitions, 10 changer transitions 0/138 dead transitions. [2023-08-27 10:11:12,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 138 transitions, 1013 flow [2023-08-27 10:11:12,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:11:12,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:11:12,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 621 transitions. [2023-08-27 10:11:12,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47404580152671755 [2023-08-27 10:11:12,314 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 621 transitions. [2023-08-27 10:11:12,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 621 transitions. [2023-08-27 10:11:12,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:12,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 621 transitions. [2023-08-27 10:11:12,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:12,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 262.0) internal successors, (1572), 6 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:12,317 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 262.0) internal successors, (1572), 6 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:12,318 INFO L175 Difference]: Start difference. First operand has 56 places, 60 transitions, 343 flow. Second operand 5 states and 621 transitions. [2023-08-27 10:11:12,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 138 transitions, 1013 flow [2023-08-27 10:11:12,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 138 transitions, 1013 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 10:11:12,342 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 410 flow [2023-08-27 10:11:12,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=410, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2023-08-27 10:11:12,343 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places. [2023-08-27 10:11:12,343 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 410 flow [2023-08-27 10:11:12,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:12,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:12,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:11:12,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 10:11:12,344 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:11:12,347 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:12,347 INFO L85 PathProgramCache]: Analyzing trace with hash -401920014, now seen corresponding path program 1 times [2023-08-27 10:11:12,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:12,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080008] [2023-08-27 10:11:12,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:12,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:12,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:11:12,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:12,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080008] [2023-08-27 10:11:12,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080008] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:12,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:12,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:11:12,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531102701] [2023-08-27 10:11:12,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:12,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:11:12,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:12,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:11:12,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:11:12,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 262 [2023-08-27 10:11:12,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:12,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:12,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 262 [2023-08-27 10:11:12,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:14,638 INFO L124 PetriNetUnfolderBase]: 17224/25691 cut-off events. [2023-08-27 10:11:14,638 INFO L125 PetriNetUnfolderBase]: For 40840/41273 co-relation queries the response was YES. [2023-08-27 10:11:14,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86588 conditions, 25691 events. 17224/25691 cut-off events. For 40840/41273 co-relation queries the response was YES. Maximal size of possible extension queue 1030. Compared 171779 event pairs, 7106 based on Foata normal form. 483/24404 useless extension candidates. Maximal degree in co-relation 86566. Up to 13203 conditions per place. [2023-08-27 10:11:14,814 INFO L140 encePairwiseOnDemand]: 259/262 looper letters, 94 selfloop transitions, 6 changer transitions 0/107 dead transitions. [2023-08-27 10:11:14,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 107 transitions, 850 flow [2023-08-27 10:11:14,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:11:14,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:11:14,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2023-08-27 10:11:14,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49872773536895676 [2023-08-27 10:11:14,815 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2023-08-27 10:11:14,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2023-08-27 10:11:14,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:14,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2023-08-27 10:11:14,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:14,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 262.0) internal successors, (1048), 4 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:14,818 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 262.0) internal successors, (1048), 4 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:14,818 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 410 flow. Second operand 3 states and 392 transitions. [2023-08-27 10:11:14,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 107 transitions, 850 flow [2023-08-27 10:11:14,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 107 transitions, 824 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:11:14,958 INFO L231 Difference]: Finished difference. Result has 64 places, 65 transitions, 416 flow [2023-08-27 10:11:14,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=416, PETRI_PLACES=64, PETRI_TRANSITIONS=65} [2023-08-27 10:11:14,958 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 14 predicate places. [2023-08-27 10:11:14,958 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 65 transitions, 416 flow [2023-08-27 10:11:14,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:14,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:14,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:11:14,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 10:11:14,959 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:11:14,959 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:14,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1340442813, now seen corresponding path program 1 times [2023-08-27 10:11:14,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:14,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913344678] [2023-08-27 10:11:14,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:14,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:15,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:11:15,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:15,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913344678] [2023-08-27 10:11:15,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913344678] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:15,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:15,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:11:15,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859781979] [2023-08-27 10:11:15,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:15,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:11:15,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:15,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:11:15,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:11:15,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 262 [2023-08-27 10:11:15,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 65 transitions, 416 flow. Second operand has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:15,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:15,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 262 [2023-08-27 10:11:15,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:16,788 INFO L124 PetriNetUnfolderBase]: 11910/18540 cut-off events. [2023-08-27 10:11:16,788 INFO L125 PetriNetUnfolderBase]: For 29000/29980 co-relation queries the response was YES. [2023-08-27 10:11:16,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63147 conditions, 18540 events. 11910/18540 cut-off events. For 29000/29980 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 129457 event pairs, 1956 based on Foata normal form. 1399/18201 useless extension candidates. Maximal degree in co-relation 63125. Up to 6582 conditions per place. [2023-08-27 10:11:16,865 INFO L140 encePairwiseOnDemand]: 255/262 looper letters, 145 selfloop transitions, 19 changer transitions 0/175 dead transitions. [2023-08-27 10:11:16,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 175 transitions, 1352 flow [2023-08-27 10:11:16,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:11:16,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:11:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 868 transitions. [2023-08-27 10:11:16,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4732824427480916 [2023-08-27 10:11:16,868 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 868 transitions. [2023-08-27 10:11:16,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 868 transitions. [2023-08-27 10:11:16,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:16,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 868 transitions. [2023-08-27 10:11:16,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:16,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 262.0) internal successors, (2096), 8 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:16,872 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 262.0) internal successors, (2096), 8 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:16,872 INFO L175 Difference]: Start difference. First operand has 64 places, 65 transitions, 416 flow. Second operand 7 states and 868 transitions. [2023-08-27 10:11:16,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 175 transitions, 1352 flow [2023-08-27 10:11:17,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 175 transitions, 1324 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-27 10:11:17,035 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 494 flow [2023-08-27 10:11:17,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=494, PETRI_PLACES=72, PETRI_TRANSITIONS=70} [2023-08-27 10:11:17,036 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 22 predicate places. [2023-08-27 10:11:17,036 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 494 flow [2023-08-27 10:11:17,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:17,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:17,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:11:17,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 10:11:17,037 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:11:17,037 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:17,037 INFO L85 PathProgramCache]: Analyzing trace with hash 890673722, now seen corresponding path program 1 times [2023-08-27 10:11:17,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:17,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956589110] [2023-08-27 10:11:17,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:17,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:17,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:11:17,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:17,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956589110] [2023-08-27 10:11:17,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956589110] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:17,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:17,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:11:17,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486838162] [2023-08-27 10:11:17,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:17,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:11:17,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:17,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:11:17,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:11:17,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 262 [2023-08-27 10:11:17,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 70 transitions, 494 flow. Second operand has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:17,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:17,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 262 [2023-08-27 10:11:17,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:18,287 INFO L124 PetriNetUnfolderBase]: 10218/15675 cut-off events. [2023-08-27 10:11:18,288 INFO L125 PetriNetUnfolderBase]: For 38401/39329 co-relation queries the response was YES. [2023-08-27 10:11:18,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59251 conditions, 15675 events. 10218/15675 cut-off events. For 38401/39329 co-relation queries the response was YES. Maximal size of possible extension queue 728. Compared 104683 event pairs, 1831 based on Foata normal form. 289/15598 useless extension candidates. Maximal degree in co-relation 59225. Up to 5519 conditions per place. [2023-08-27 10:11:18,375 INFO L140 encePairwiseOnDemand]: 253/262 looper letters, 105 selfloop transitions, 21 changer transitions 0/137 dead transitions. [2023-08-27 10:11:18,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 137 transitions, 1090 flow [2023-08-27 10:11:18,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:11:18,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:11:18,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 640 transitions. [2023-08-27 10:11:18,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48854961832061067 [2023-08-27 10:11:18,377 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 640 transitions. [2023-08-27 10:11:18,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 640 transitions. [2023-08-27 10:11:18,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:18,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 640 transitions. [2023-08-27 10:11:18,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:18,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 262.0) internal successors, (1572), 6 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:18,380 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 262.0) internal successors, (1572), 6 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:18,380 INFO L175 Difference]: Start difference. First operand has 72 places, 70 transitions, 494 flow. Second operand 5 states and 640 transitions. [2023-08-27 10:11:18,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 137 transitions, 1090 flow [2023-08-27 10:11:18,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 137 transitions, 1056 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-27 10:11:18,776 INFO L231 Difference]: Finished difference. Result has 73 places, 74 transitions, 554 flow [2023-08-27 10:11:18,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=554, PETRI_PLACES=73, PETRI_TRANSITIONS=74} [2023-08-27 10:11:18,776 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 23 predicate places. [2023-08-27 10:11:18,776 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 74 transitions, 554 flow [2023-08-27 10:11:18,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:18,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:18,777 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-27 10:11:18,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 10:11:18,777 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:11:18,777 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:18,777 INFO L85 PathProgramCache]: Analyzing trace with hash -20947698, now seen corresponding path program 1 times [2023-08-27 10:11:18,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:18,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808682612] [2023-08-27 10:11:18,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:18,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:18,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:11:18,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:18,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808682612] [2023-08-27 10:11:18,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808682612] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:18,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:18,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:11:18,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64040399] [2023-08-27 10:11:18,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:18,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:11:18,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:18,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:11:18,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:11:18,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 262 [2023-08-27 10:11:18,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 74 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:18,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:18,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 262 [2023-08-27 10:11:18,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:20,740 INFO L124 PetriNetUnfolderBase]: 15293/23330 cut-off events. [2023-08-27 10:11:20,740 INFO L125 PetriNetUnfolderBase]: For 70546/70992 co-relation queries the response was YES. [2023-08-27 10:11:20,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93131 conditions, 23330 events. 15293/23330 cut-off events. For 70546/70992 co-relation queries the response was YES. Maximal size of possible extension queue 1024. Compared 160878 event pairs, 5302 based on Foata normal form. 362/23355 useless extension candidates. Maximal degree in co-relation 93104. Up to 11469 conditions per place. [2023-08-27 10:11:20,846 INFO L140 encePairwiseOnDemand]: 259/262 looper letters, 108 selfloop transitions, 8 changer transitions 0/122 dead transitions. [2023-08-27 10:11:20,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 122 transitions, 1152 flow [2023-08-27 10:11:20,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:11:20,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:11:20,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-08-27 10:11:20,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49363867684478374 [2023-08-27 10:11:20,848 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-08-27 10:11:20,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-08-27 10:11:20,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:20,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-08-27 10:11:20,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:20,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 262.0) internal successors, (1048), 4 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:20,850 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 262.0) internal successors, (1048), 4 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:20,850 INFO L175 Difference]: Start difference. First operand has 73 places, 74 transitions, 554 flow. Second operand 3 states and 388 transitions. [2023-08-27 10:11:20,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 122 transitions, 1152 flow [2023-08-27 10:11:22,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 122 transitions, 1062 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-27 10:11:22,248 INFO L231 Difference]: Finished difference. Result has 73 places, 74 transitions, 534 flow [2023-08-27 10:11:22,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=73, PETRI_TRANSITIONS=74} [2023-08-27 10:11:22,249 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 23 predicate places. [2023-08-27 10:11:22,249 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 74 transitions, 534 flow [2023-08-27 10:11:22,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:22,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:22,249 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-27 10:11:22,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 10:11:22,249 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:11:22,250 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:22,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1491622521, now seen corresponding path program 1 times [2023-08-27 10:11:22,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:22,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140093410] [2023-08-27 10:11:22,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:22,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:22,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:11:22,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:22,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140093410] [2023-08-27 10:11:22,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140093410] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:22,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:22,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:11:22,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445358980] [2023-08-27 10:11:22,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:22,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:11:22,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:22,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:11:22,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:11:22,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 262 [2023-08-27 10:11:22,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 74 transitions, 534 flow. Second operand has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:22,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:22,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 262 [2023-08-27 10:11:22,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:24,046 INFO L124 PetriNetUnfolderBase]: 12310/18904 cut-off events. [2023-08-27 10:11:24,047 INFO L125 PetriNetUnfolderBase]: For 42801/43815 co-relation queries the response was YES. [2023-08-27 10:11:24,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69865 conditions, 18904 events. 12310/18904 cut-off events. For 42801/43815 co-relation queries the response was YES. Maximal size of possible extension queue 1034. Compared 132773 event pairs, 1151 based on Foata normal form. 873/19255 useless extension candidates. Maximal degree in co-relation 69838. Up to 4531 conditions per place. [2023-08-27 10:11:24,234 INFO L140 encePairwiseOnDemand]: 255/262 looper letters, 166 selfloop transitions, 28 changer transitions 4/209 dead transitions. [2023-08-27 10:11:24,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 209 transitions, 1699 flow [2023-08-27 10:11:24,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 10:11:24,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 10:11:24,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1113 transitions. [2023-08-27 10:11:24,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4720101781170484 [2023-08-27 10:11:24,237 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1113 transitions. [2023-08-27 10:11:24,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1113 transitions. [2023-08-27 10:11:24,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:24,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1113 transitions. [2023-08-27 10:11:24,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 123.66666666666667) internal successors, (1113), 9 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:24,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 262.0) internal successors, (2620), 10 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:24,241 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 262.0) internal successors, (2620), 10 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:24,241 INFO L175 Difference]: Start difference. First operand has 73 places, 74 transitions, 534 flow. Second operand 9 states and 1113 transitions. [2023-08-27 10:11:24,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 209 transitions, 1699 flow [2023-08-27 10:11:26,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 209 transitions, 1634 flow, removed 20 selfloop flow, removed 1 redundant places. [2023-08-27 10:11:26,633 INFO L231 Difference]: Finished difference. Result has 83 places, 78 transitions, 620 flow [2023-08-27 10:11:26,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=620, PETRI_PLACES=83, PETRI_TRANSITIONS=78} [2023-08-27 10:11:26,633 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2023-08-27 10:11:26,633 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 78 transitions, 620 flow [2023-08-27 10:11:26,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:26,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:26,634 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:11:26,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 10:11:26,634 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:11:26,634 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:26,634 INFO L85 PathProgramCache]: Analyzing trace with hash 2147351904, now seen corresponding path program 1 times [2023-08-27 10:11:26,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:26,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916365111] [2023-08-27 10:11:26,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:26,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:27,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:11:27,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:27,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916365111] [2023-08-27 10:11:27,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916365111] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:27,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:27,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:11:27,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257437603] [2023-08-27 10:11:27,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:27,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 10:11:27,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:27,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 10:11:27,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-27 10:11:27,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 262 [2023-08-27 10:11:27,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 78 transitions, 620 flow. Second operand has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 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-27 10:11:27,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:27,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 262 [2023-08-27 10:11:27,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:30,711 INFO L124 PetriNetUnfolderBase]: 21812/34592 cut-off events. [2023-08-27 10:11:30,711 INFO L125 PetriNetUnfolderBase]: For 123468/124200 co-relation queries the response was YES. [2023-08-27 10:11:30,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146181 conditions, 34592 events. 21812/34592 cut-off events. For 123468/124200 co-relation queries the response was YES. Maximal size of possible extension queue 2057. Compared 278577 event pairs, 3031 based on Foata normal form. 360/34004 useless extension candidates. Maximal degree in co-relation 146150. Up to 14078 conditions per place. [2023-08-27 10:11:30,994 INFO L140 encePairwiseOnDemand]: 254/262 looper letters, 245 selfloop transitions, 11 changer transitions 3/270 dead transitions. [2023-08-27 10:11:30,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 270 transitions, 2666 flow [2023-08-27 10:11:30,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:11:30,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:11:30,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 756 transitions. [2023-08-27 10:11:30,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48091603053435117 [2023-08-27 10:11:30,996 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 756 transitions. [2023-08-27 10:11:30,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 756 transitions. [2023-08-27 10:11:30,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:30,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 756 transitions. [2023-08-27 10:11:30,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.0) internal successors, (756), 6 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-27 10:11:30,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 262.0) internal successors, (1834), 7 states have internal predecessors, (1834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:30,999 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 262.0) internal successors, (1834), 7 states have internal predecessors, (1834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:30,999 INFO L175 Difference]: Start difference. First operand has 83 places, 78 transitions, 620 flow. Second operand 6 states and 756 transitions. [2023-08-27 10:11:30,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 270 transitions, 2666 flow [2023-08-27 10:11:38,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 270 transitions, 2426 flow, removed 10 selfloop flow, removed 6 redundant places. [2023-08-27 10:11:38,473 INFO L231 Difference]: Finished difference. Result has 85 places, 87 transitions, 671 flow [2023-08-27 10:11:38,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=671, PETRI_PLACES=85, PETRI_TRANSITIONS=87} [2023-08-27 10:11:38,474 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 35 predicate places. [2023-08-27 10:11:38,474 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 87 transitions, 671 flow [2023-08-27 10:11:38,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 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-27 10:11:38,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:38,474 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:11:38,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 10:11:38,475 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:11:38,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:38,475 INFO L85 PathProgramCache]: Analyzing trace with hash 925911064, now seen corresponding path program 2 times [2023-08-27 10:11:38,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:38,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405274387] [2023-08-27 10:11:38,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:38,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:38,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:11:38,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:38,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405274387] [2023-08-27 10:11:38,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405274387] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:38,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:38,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 10:11:38,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191620481] [2023-08-27 10:11:38,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:38,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 10:11:38,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:38,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 10:11:38,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-27 10:11:38,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 262 [2023-08-27 10:11:38,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 87 transitions, 671 flow. Second operand has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 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-27 10:11:38,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:38,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 262 [2023-08-27 10:11:38,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:41,589 INFO L124 PetriNetUnfolderBase]: 21351/33021 cut-off events. [2023-08-27 10:11:41,589 INFO L125 PetriNetUnfolderBase]: For 103989/105370 co-relation queries the response was YES. [2023-08-27 10:11:41,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139293 conditions, 33021 events. 21351/33021 cut-off events. For 103989/105370 co-relation queries the response was YES. Maximal size of possible extension queue 2102. Compared 259216 event pairs, 1218 based on Foata normal form. 685/33200 useless extension candidates. Maximal degree in co-relation 139259. Up to 8986 conditions per place. [2023-08-27 10:11:41,787 INFO L140 encePairwiseOnDemand]: 251/262 looper letters, 122 selfloop transitions, 30 changer transitions 96/254 dead transitions. [2023-08-27 10:11:41,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 254 transitions, 2260 flow [2023-08-27 10:11:41,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 10:11:41,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 10:11:41,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1330 transitions. [2023-08-27 10:11:41,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4614850798056905 [2023-08-27 10:11:41,790 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1330 transitions. [2023-08-27 10:11:41,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1330 transitions. [2023-08-27 10:11:41,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:41,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1330 transitions. [2023-08-27 10:11:41,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 120.9090909090909) internal successors, (1330), 11 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:41,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 262.0) internal successors, (3144), 12 states have internal predecessors, (3144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:41,795 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 262.0) internal successors, (3144), 12 states have internal predecessors, (3144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:41,795 INFO L175 Difference]: Start difference. First operand has 85 places, 87 transitions, 671 flow. Second operand 11 states and 1330 transitions. [2023-08-27 10:11:41,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 254 transitions, 2260 flow [2023-08-27 10:11:53,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 254 transitions, 2218 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-27 10:11:53,309 INFO L231 Difference]: Finished difference. Result has 92 places, 64 transitions, 534 flow [2023-08-27 10:11:53,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=534, PETRI_PLACES=92, PETRI_TRANSITIONS=64} [2023-08-27 10:11:53,309 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 42 predicate places. [2023-08-27 10:11:53,309 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 64 transitions, 534 flow [2023-08-27 10:11:53,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 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-27 10:11:53,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:53,310 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:11:53,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 10:11:53,310 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:11:53,310 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:53,310 INFO L85 PathProgramCache]: Analyzing trace with hash 169981820, now seen corresponding path program 1 times [2023-08-27 10:11:53,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:53,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443363736] [2023-08-27 10:11:53,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:53,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:53,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:11:53,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:53,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443363736] [2023-08-27 10:11:53,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443363736] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:53,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:53,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:11:53,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749978064] [2023-08-27 10:11:53,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:53,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:11:53,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:53,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:11:53,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:11:53,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 262 [2023-08-27 10:11:53,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 64 transitions, 534 flow. Second operand has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:53,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:53,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 262 [2023-08-27 10:11:53,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:54,083 INFO L124 PetriNetUnfolderBase]: 4787/7415 cut-off events. [2023-08-27 10:11:54,083 INFO L125 PetriNetUnfolderBase]: For 32608/32608 co-relation queries the response was YES. [2023-08-27 10:11:54,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34001 conditions, 7415 events. 4787/7415 cut-off events. For 32608/32608 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 43861 event pairs, 332 based on Foata normal form. 2/7417 useless extension candidates. Maximal degree in co-relation 33967. Up to 3154 conditions per place. [2023-08-27 10:11:54,110 INFO L140 encePairwiseOnDemand]: 253/262 looper letters, 58 selfloop transitions, 5 changer transitions 108/171 dead transitions. [2023-08-27 10:11:54,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 171 transitions, 1752 flow [2023-08-27 10:11:54,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:11:54,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:11:54,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 704 transitions. [2023-08-27 10:11:54,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44783715012722647 [2023-08-27 10:11:54,111 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 704 transitions. [2023-08-27 10:11:54,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 704 transitions. [2023-08-27 10:11:54,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:54,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 704 transitions. [2023-08-27 10:11:54,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:54,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 262.0) internal successors, (1834), 7 states have internal predecessors, (1834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:54,114 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 262.0) internal successors, (1834), 7 states have internal predecessors, (1834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:54,115 INFO L175 Difference]: Start difference. First operand has 92 places, 64 transitions, 534 flow. Second operand 6 states and 704 transitions. [2023-08-27 10:11:54,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 171 transitions, 1752 flow [2023-08-27 10:11:54,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 171 transitions, 1340 flow, removed 41 selfloop flow, removed 20 redundant places. [2023-08-27 10:11:54,302 INFO L231 Difference]: Finished difference. Result has 76 places, 41 transitions, 236 flow [2023-08-27 10:11:54,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=236, PETRI_PLACES=76, PETRI_TRANSITIONS=41} [2023-08-27 10:11:54,303 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 26 predicate places. [2023-08-27 10:11:54,303 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 41 transitions, 236 flow [2023-08-27 10:11:54,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:54,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:54,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:11:54,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 10:11:54,304 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:11:54,304 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:54,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1571923926, now seen corresponding path program 2 times [2023-08-27 10:11:54,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:54,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957827463] [2023-08-27 10:11:54,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:54,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:54,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:11:54,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:54,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957827463] [2023-08-27 10:11:54,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957827463] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:54,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:54,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 10:11:54,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627008397] [2023-08-27 10:11:54,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:54,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 10:11:54,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:54,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 10:11:54,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-27 10:11:54,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 262 [2023-08-27 10:11:54,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 41 transitions, 236 flow. Second operand has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:54,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:54,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 262 [2023-08-27 10:11:54,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:54,998 INFO L124 PetriNetUnfolderBase]: 586/1028 cut-off events. [2023-08-27 10:11:54,998 INFO L125 PetriNetUnfolderBase]: For 1791/1791 co-relation queries the response was YES. [2023-08-27 10:11:54,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3777 conditions, 1028 events. 586/1028 cut-off events. For 1791/1791 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4702 event pairs, 65 based on Foata normal form. 1/1025 useless extension candidates. Maximal degree in co-relation 3754. Up to 323 conditions per place. [2023-08-27 10:11:55,001 INFO L140 encePairwiseOnDemand]: 254/262 looper letters, 76 selfloop transitions, 6 changer transitions 40/125 dead transitions. [2023-08-27 10:11:55,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 125 transitions, 968 flow [2023-08-27 10:11:55,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:11:55,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:11:55,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 809 transitions. [2023-08-27 10:11:55,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4411123227917121 [2023-08-27 10:11:55,003 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 809 transitions. [2023-08-27 10:11:55,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 809 transitions. [2023-08-27 10:11:55,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:55,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 809 transitions. [2023-08-27 10:11:55,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.57142857142857) internal successors, (809), 7 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:55,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 262.0) internal successors, (2096), 8 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:55,007 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 262.0) internal successors, (2096), 8 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:55,007 INFO L175 Difference]: Start difference. First operand has 76 places, 41 transitions, 236 flow. Second operand 7 states and 809 transitions. [2023-08-27 10:11:55,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 125 transitions, 968 flow [2023-08-27 10:11:55,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 125 transitions, 859 flow, removed 37 selfloop flow, removed 15 redundant places. [2023-08-27 10:11:55,013 INFO L231 Difference]: Finished difference. Result has 61 places, 44 transitions, 227 flow [2023-08-27 10:11:55,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=227, PETRI_PLACES=61, PETRI_TRANSITIONS=44} [2023-08-27 10:11:55,014 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2023-08-27 10:11:55,014 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 44 transitions, 227 flow [2023-08-27 10:11:55,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:55,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:55,015 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:11:55,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 10:11:55,015 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:11:55,015 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:55,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1659709392, now seen corresponding path program 3 times [2023-08-27 10:11:55,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:55,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064899363] [2023-08-27 10:11:55,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:55,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:55,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:11:55,061 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 10:11:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:11:55,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 10:11:55,148 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 10:11:55,149 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-27 10:11:55,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (21 of 23 remaining) [2023-08-27 10:11:55,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-27 10:11:55,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2023-08-27 10:11:55,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-27 10:11:55,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2023-08-27 10:11:55,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-27 10:11:55,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 23 remaining) [2023-08-27 10:11:55,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-27 10:11:55,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-27 10:11:55,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-27 10:11:55,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-27 10:11:55,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-27 10:11:55,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-27 10:11:55,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (8 of 23 remaining) [2023-08-27 10:11:55,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-27 10:11:55,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2023-08-27 10:11:55,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-27 10:11:55,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2023-08-27 10:11:55,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-27 10:11:55,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 23 remaining) [2023-08-27 10:11:55,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-27 10:11:55,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-27 10:11:55,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-27 10:11:55,152 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:11:55,156 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 10:11:55,156 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 10:11:55,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 10:11:55 BasicIcfg [2023-08-27 10:11:55,226 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 10:11:55,227 INFO L158 Benchmark]: Toolchain (without parser) took 61207.97ms. Allocated memory was 362.8MB in the beginning and 7.6GB in the end (delta: 7.2GB). Free memory was 318.9MB in the beginning and 6.6GB in the end (delta: -6.3GB). Peak memory consumption was 904.0MB. Max. memory is 16.0GB. [2023-08-27 10:11:55,227 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 362.8MB. Free memory was 340.8MB in the beginning and 340.6MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 10:11:55,227 INFO L158 Benchmark]: CACSL2BoogieTranslator took 457.21ms. Allocated memory is still 362.8MB. Free memory was 318.9MB in the beginning and 294.8MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 10:11:55,227 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.93ms. Allocated memory is still 362.8MB. Free memory was 294.8MB in the beginning and 292.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:11:55,227 INFO L158 Benchmark]: Boogie Preprocessor took 45.51ms. Allocated memory is still 362.8MB. Free memory was 292.7MB in the beginning and 290.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:11:55,227 INFO L158 Benchmark]: RCFGBuilder took 498.45ms. Allocated memory is still 362.8MB. Free memory was 290.6MB in the beginning and 246.5MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.0GB. [2023-08-27 10:11:55,228 INFO L158 Benchmark]: TraceAbstraction took 60152.63ms. Allocated memory was 362.8MB in the beginning and 7.6GB in the end (delta: 7.2GB). Free memory was 245.5MB in the beginning and 6.6GB in the end (delta: -6.4GB). Peak memory consumption was 830.6MB. Max. memory is 16.0GB. [2023-08-27 10:11:55,228 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.10ms. Allocated memory is still 362.8MB. Free memory was 340.8MB in the beginning and 340.6MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 457.21ms. Allocated memory is still 362.8MB. Free memory was 318.9MB in the beginning and 294.8MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 49.93ms. Allocated memory is still 362.8MB. Free memory was 294.8MB in the beginning and 292.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 45.51ms. Allocated memory is still 362.8MB. Free memory was 292.7MB in the beginning and 290.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 498.45ms. Allocated memory is still 362.8MB. Free memory was 290.6MB in the beginning and 246.5MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.0GB. * TraceAbstraction took 60152.63ms. Allocated memory was 362.8MB in the beginning and 7.6GB in the end (delta: 7.2GB). Free memory was 245.5MB in the beginning and 6.6GB in the end (delta: -6.4GB). Peak memory consumption was 830.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 146 PlacesBefore, 50 PlacesAfterwards, 136 TransitionsBefore, 38 TransitionsAfterwards, 4414 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 2 ChoiceCompositions, 122 TotalNumberOfCompositions, 16840 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5735, independent: 5367, independent conditional: 0, independent unconditional: 5367, dependent: 368, dependent conditional: 0, dependent unconditional: 368, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2457, independent: 2386, independent conditional: 0, independent unconditional: 2386, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5735, independent: 2981, independent conditional: 0, independent unconditional: 2981, dependent: 297, dependent conditional: 0, dependent unconditional: 297, unknown: 2457, unknown conditional: 0, unknown unconditional: 2457] , Statistics on independence cache: Total cache size (in pairs): 235, Positive cache size: 207, Positive conditional cache size: 0, Positive unconditional cache size: 207, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L859] 0 pthread_t t1457; [L860] FCALL, FORK 0 pthread_create(&t1457, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1457, ((void *)0), P0, ((void *)0))=-2, t1457={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1458; [L862] FCALL, FORK 0 pthread_create(&t1458, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1458, ((void *)0), P1, ((void *)0))=-1, t1457={5:0}, t1458={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1459; [L864] FCALL, FORK 0 pthread_create(&t1459, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1459, ((void *)0), P2, ((void *)0))=0, t1457={5:0}, t1458={6:0}, t1459={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t1460; [L866] FCALL, FORK 0 pthread_create(&t1460, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1460, ((void *)0), P3, ((void *)0))=1, t1457={5:0}, t1458={6:0}, t1459={7:0}, t1460={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L752] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L752] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, y=0, z=0] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, y=0, z=0] [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, y=0, z=0] [L798] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L791] EXPR 2 __unbuffered_cnt + 1 [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L818] 4 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 a$flush_delayed = weak$$choice2 [L824] 4 a$mem_tmp = a [L825] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L826] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L827] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L828] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L829] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L831] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = a [L833] 4 a = a$flush_delayed ? a$mem_tmp : a [L834] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, y=1, z=2] [L837] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L839] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L840] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L841] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, y=1, z=2] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0: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=2, y=1, z=2] [L771] EXPR 1 __unbuffered_cnt + 1 [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L811] EXPR 3 __unbuffered_cnt + 1 [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L844] EXPR 4 __unbuffered_cnt + 1 [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L874] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L875] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L876] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1457={5:0}, t1458={6:0}, t1459={7:0}, t1460={3:0}, weak$$choice2=0, x=2, y=1, z=2] [L879] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix055_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0: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=2, y=1, z=2] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 791]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 791]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 862]: 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: 860]: 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: 866]: 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: 864]: 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 9 procedures, 183 locations, 23 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: 60.0s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 53.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 719 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 719 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2001 IncrementalHoareTripleChecker+Invalid, 2107 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 106 mSolverCounterUnsat, 16 mSDtfsCounter, 2001 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=671occurred in iteration=14, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 246 ConstructedInterpolants, 0 QuantifiedInterpolants, 1741 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-27 10:11:55,247 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...