/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/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 10:12:57,910 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 10:12:57,987 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:12:57,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 10:12:57,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 10:12:58,019 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 10:12:58,020 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 10:12:58,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 10:12:58,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 10:12:58,023 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 10:12:58,023 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 10:12:58,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 10:12:58,024 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 10:12:58,024 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 10:12:58,024 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 10:12:58,024 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 10:12:58,025 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 10:12:58,025 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 10:12:58,025 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 10:12:58,025 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 10:12:58,026 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 10:12:58,026 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 10:12:58,026 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 10:12:58,027 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 10:12:58,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 10:12:58,027 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 10:12:58,028 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 10:12:58,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:12:58,028 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 10:12:58,028 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 10:12:58,028 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 10:12:58,029 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 10:12:58,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 10:12:58,029 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 10:12:58,029 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 10:12:58,029 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:12:58,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 10:12:58,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 10:12:58,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 10:12:58,288 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 10:12:58,288 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 10:12:58,289 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-27 10:12:59,293 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 10:12:59,439 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 10:12:59,439 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-27 10:12:59,448 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed9a1c95d/590ae4cc3889452aa33a0656f1c6c096/FLAG48beda47a [2023-08-27 10:12:59,458 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed9a1c95d/590ae4cc3889452aa33a0656f1c6c096 [2023-08-27 10:12:59,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 10:12:59,460 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 10:12:59,461 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 10:12:59,461 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 10:12:59,463 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 10:12:59,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:12:59" (1/1) ... [2023-08-27 10:12:59,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bc75f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:12:59, skipping insertion in model container [2023-08-27 10:12:59,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:12:59" (1/1) ... [2023-08-27 10:12:59,510 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 10:12:59,813 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:12:59,822 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 10:12:59,846 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 10:12:59,847 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 10:12:59,878 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:12:59,906 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:12:59,906 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:12:59,911 INFO L206 MainTranslator]: Completed translation [2023-08-27 10:12:59,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:12:59 WrapperNode [2023-08-27 10:12:59,911 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 10:12:59,912 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 10:12:59,912 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 10:12:59,912 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 10:12:59,917 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:12:59" (1/1) ... [2023-08-27 10:12:59,941 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:12:59" (1/1) ... [2023-08-27 10:12:59,967 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 157 [2023-08-27 10:12:59,967 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 10:12:59,968 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 10:12:59,968 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 10:12:59,968 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 10:12:59,974 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:12:59" (1/1) ... [2023-08-27 10:12:59,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:12:59" (1/1) ... [2023-08-27 10:12:59,986 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:12:59" (1/1) ... [2023-08-27 10:12:59,986 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:12:59" (1/1) ... [2023-08-27 10:12:59,991 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:12:59" (1/1) ... [2023-08-27 10:12:59,992 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:12:59" (1/1) ... [2023-08-27 10:12:59,993 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:12:59" (1/1) ... [2023-08-27 10:12:59,994 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:12:59" (1/1) ... [2023-08-27 10:13:00,008 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 10:13:00,009 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 10:13:00,009 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 10:13:00,009 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 10:13:00,009 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:12:59" (1/1) ... [2023-08-27 10:13:00,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:13:00,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 10:13:00,030 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:13:00,048 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:13:00,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 10:13:00,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 10:13:00,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 10:13:00,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 10:13:00,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 10:13:00,057 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 10:13:00,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 10:13:00,058 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 10:13:00,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 10:13:00,058 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 10:13:00,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 10:13:00,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 10:13:00,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 10:13:00,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 10:13:00,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 10:13:00,060 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:13:00,180 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 10:13:00,181 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 10:13:00,416 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 10:13:00,552 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 10:13:00,552 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 10:13:00,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:13:00 BoogieIcfgContainer [2023-08-27 10:13:00,553 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 10:13:00,555 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 10:13:00,555 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 10:13:00,557 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 10:13:00,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 10:12:59" (1/3) ... [2023-08-27 10:13:00,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c4da22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:13:00, skipping insertion in model container [2023-08-27 10:13:00,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:12:59" (2/3) ... [2023-08-27 10:13:00,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c4da22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:13:00, skipping insertion in model container [2023-08-27 10:13:00,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:13:00" (3/3) ... [2023-08-27 10:13:00,559 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-27 10:13:00,570 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 10:13:00,570 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-27 10:13:00,571 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 10:13:00,614 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 10:13:00,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 118 transitions, 251 flow [2023-08-27 10:13:00,694 INFO L124 PetriNetUnfolderBase]: 3/115 cut-off events. [2023-08-27 10:13:00,694 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:13:00,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 3/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2023-08-27 10:13:00,698 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 118 transitions, 251 flow [2023-08-27 10:13:00,701 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 115 transitions, 239 flow [2023-08-27 10:13:00,704 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 10:13:00,715 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 115 transitions, 239 flow [2023-08-27 10:13:00,718 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 115 transitions, 239 flow [2023-08-27 10:13:00,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 115 transitions, 239 flow [2023-08-27 10:13:00,749 INFO L124 PetriNetUnfolderBase]: 3/115 cut-off events. [2023-08-27 10:13:00,749 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:13:00,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 3/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2023-08-27 10:13:00,751 INFO L119 LiptonReduction]: Number of co-enabled transitions 2640 [2023-08-27 10:13:03,585 INFO L134 LiptonReduction]: Checked pairs total: 9559 [2023-08-27 10:13:03,585 INFO L136 LiptonReduction]: Total number of compositions: 104 [2023-08-27 10:13:03,593 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 10:13:03,597 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;@5bd90de0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 10:13:03,597 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-27 10:13:03,600 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 10:13:03,600 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-27 10:13:03,600 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:13:03,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:13:03,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 10:13:03,601 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:13:03,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:13:03,604 INFO L85 PathProgramCache]: Analyzing trace with hash 540732200, now seen corresponding path program 1 times [2023-08-27 10:13:03,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:13:03,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959162177] [2023-08-27 10:13:03,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:13:03,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:13:03,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:13:03,871 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:13:03,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:13:03,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959162177] [2023-08-27 10:13:03,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959162177] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:13:03,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:13:03,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:13:03,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700837579] [2023-08-27 10:13:03,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:13:03,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:13:03,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:13:03,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:13:03,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:13:03,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 222 [2023-08-27 10:13:03,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:13:03,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:13:03,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 222 [2023-08-27 10:13:03,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:13:04,215 INFO L124 PetriNetUnfolderBase]: 1652/2604 cut-off events. [2023-08-27 10:13:04,216 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-08-27 10:13:04,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5273 conditions, 2604 events. 1652/2604 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 12874 event pairs, 699 based on Foata normal form. 158/1904 useless extension candidates. Maximal degree in co-relation 5262. Up to 2276 conditions per place. [2023-08-27 10:13:04,231 INFO L140 encePairwiseOnDemand]: 210/222 looper letters, 41 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2023-08-27 10:13:04,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 197 flow [2023-08-27 10:13:04,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:13:04,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:13:04,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2023-08-27 10:13:04,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-27 10:13:04,241 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 333 transitions. [2023-08-27 10:13:04,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 333 transitions. [2023-08-27 10:13:04,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:13:04,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 333 transitions. [2023-08-27 10:13:04,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states 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:13:04,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states 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:13:04,249 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states 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:13:04,250 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 3 states and 333 transitions. [2023-08-27 10:13:04,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 197 flow [2023-08-27 10:13:04,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 46 transitions, 192 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 10:13:04,253 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 104 flow [2023-08-27 10:13:04,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-08-27 10:13:04,256 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-08-27 10:13:04,256 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 104 flow [2023-08-27 10:13:04,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:13:04,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:13:04,257 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 10:13:04,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 10:13:04,257 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:13:04,257 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:13:04,257 INFO L85 PathProgramCache]: Analyzing trace with hash 540777315, now seen corresponding path program 1 times [2023-08-27 10:13:04,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:13:04,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811987575] [2023-08-27 10:13:04,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:13:04,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:13:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:13:04,350 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:13:04,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:13:04,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811987575] [2023-08-27 10:13:04,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811987575] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:13:04,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:13:04,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:13:04,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833746589] [2023-08-27 10:13:04,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:13:04,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:13:04,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:13:04,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:13:04,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:13:04,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 222 [2023-08-27 10:13:04,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:13:04,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:13:04,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 222 [2023-08-27 10:13:04,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:13:04,595 INFO L124 PetriNetUnfolderBase]: 1235/2112 cut-off events. [2023-08-27 10:13:04,595 INFO L125 PetriNetUnfolderBase]: For 223/296 co-relation queries the response was YES. [2023-08-27 10:13:04,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4985 conditions, 2112 events. 1235/2112 cut-off events. For 223/296 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 11835 event pairs, 268 based on Foata normal form. 0/1733 useless extension candidates. Maximal degree in co-relation 4974. Up to 1684 conditions per place. [2023-08-27 10:13:04,603 INFO L140 encePairwiseOnDemand]: 219/222 looper letters, 44 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-08-27 10:13:04,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 248 flow [2023-08-27 10:13:04,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:13:04,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:13:04,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2023-08-27 10:13:04,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-27 10:13:04,605 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 333 transitions. [2023-08-27 10:13:04,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 333 transitions. [2023-08-27 10:13:04,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:13:04,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 333 transitions. [2023-08-27 10:13:04,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states 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:13:04,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states 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:13:04,608 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states 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:13:04,608 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 104 flow. Second operand 3 states and 333 transitions. [2023-08-27 10:13:04,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 248 flow [2023-08-27 10:13:04,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:13:04,609 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 102 flow [2023-08-27 10:13:04,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2023-08-27 10:13:04,610 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-08-27 10:13:04,610 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 102 flow [2023-08-27 10:13:04,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:13:04,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:13:04,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:13:04,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 10:13:04,611 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:13:04,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:13:04,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1176575377, now seen corresponding path program 1 times [2023-08-27 10:13:04,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:13:04,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187567192] [2023-08-27 10:13:04,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:13:04,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:13:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:13:04,671 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:13:04,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:13:04,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187567192] [2023-08-27 10:13:04,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187567192] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:13:04,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:13:04,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:13:04,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553186784] [2023-08-27 10:13:04,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:13:04,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:13:04,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:13:04,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:13:04,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:13:04,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 222 [2023-08-27 10:13:04,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 states 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:13:04,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:13:04,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 222 [2023-08-27 10:13:04,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:13:04,857 INFO L124 PetriNetUnfolderBase]: 1058/1682 cut-off events. [2023-08-27 10:13:04,857 INFO L125 PetriNetUnfolderBase]: For 234/234 co-relation queries the response was YES. [2023-08-27 10:13:04,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4070 conditions, 1682 events. 1058/1682 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7735 event pairs, 387 based on Foata normal form. 0/1399 useless extension candidates. Maximal degree in co-relation 4058. Up to 1417 conditions per place. [2023-08-27 10:13:04,863 INFO L140 encePairwiseOnDemand]: 215/222 looper letters, 36 selfloop transitions, 4 changer transitions 0/41 dead transitions. [2023-08-27 10:13:04,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 200 flow [2023-08-27 10:13:04,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:13:04,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:13:04,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 415 transitions. [2023-08-27 10:13:04,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46734234234234234 [2023-08-27 10:13:04,865 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 415 transitions. [2023-08-27 10:13:04,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 415 transitions. [2023-08-27 10:13:04,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:13:04,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 415 transitions. [2023-08-27 10:13:04,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:13:04,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states 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:13:04,868 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states 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:13:04,868 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 102 flow. Second operand 4 states and 415 transitions. [2023-08-27 10:13:04,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 200 flow [2023-08-27 10:13:04,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:13:04,869 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 94 flow [2023-08-27 10:13:04,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2023-08-27 10:13:04,870 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-08-27 10:13:04,870 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 94 flow [2023-08-27 10:13:04,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 states 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:13:04,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:13:04,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:13:04,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 10:13:04,870 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:13:04,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:13:04,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1912632752, now seen corresponding path program 1 times [2023-08-27 10:13:04,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:13:04,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284474633] [2023-08-27 10:13:04,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:13:04,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:13:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:13:04,914 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:13:04,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:13:04,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284474633] [2023-08-27 10:13:04,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284474633] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:13:04,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:13:04,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:13:04,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079579903] [2023-08-27 10:13:04,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:13:04,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:13:04,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:13:04,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:13:04,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:13:04,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 222 [2023-08-27 10:13:04,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 0 states have call successors, (0), 0 states 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:13:04,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:13:04,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 222 [2023-08-27 10:13:04,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:13:05,018 INFO L124 PetriNetUnfolderBase]: 425/716 cut-off events. [2023-08-27 10:13:05,019 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2023-08-27 10:13:05,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1746 conditions, 716 events. 425/716 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2829 event pairs, 173 based on Foata normal form. 33/711 useless extension candidates. Maximal degree in co-relation 1734. Up to 256 conditions per place. [2023-08-27 10:13:05,021 INFO L140 encePairwiseOnDemand]: 214/222 looper letters, 46 selfloop transitions, 7 changer transitions 0/54 dead transitions. [2023-08-27 10:13:05,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 262 flow [2023-08-27 10:13:05,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:13:05,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:13:05,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 429 transitions. [2023-08-27 10:13:05,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4831081081081081 [2023-08-27 10:13:05,023 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 429 transitions. [2023-08-27 10:13:05,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 429 transitions. [2023-08-27 10:13:05,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:13:05,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 429 transitions. [2023-08-27 10:13:05,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 0 states have call successors, (0), 0 states 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:13:05,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states 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:13:05,025 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states 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:13:05,025 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 94 flow. Second operand 4 states and 429 transitions. [2023-08-27 10:13:05,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 262 flow [2023-08-27 10:13:05,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 54 transitions, 257 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:13:05,027 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 135 flow [2023-08-27 10:13:05,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2023-08-27 10:13:05,027 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-08-27 10:13:05,027 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 135 flow [2023-08-27 10:13:05,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 0 states have call successors, (0), 0 states 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:13:05,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:13:05,028 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:13:05,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 10:13:05,028 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:13:05,028 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:13:05,028 INFO L85 PathProgramCache]: Analyzing trace with hash -242068036, now seen corresponding path program 1 times [2023-08-27 10:13:05,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:13:05,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168974085] [2023-08-27 10:13:05,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:13:05,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:13:05,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:13:05,185 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:13:05,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:13:05,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168974085] [2023-08-27 10:13:05,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168974085] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:13:05,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:13:05,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:13:05,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14079650] [2023-08-27 10:13:05,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:13:05,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:13:05,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:13:05,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:13:05,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:13:05,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 222 [2023-08-27 10:13:05,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 92.2) internal successors, (461), 5 states have internal predecessors, (461), 0 states have call successors, (0), 0 states 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:13:05,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:13:05,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 222 [2023-08-27 10:13:05,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:13:05,326 INFO L124 PetriNetUnfolderBase]: 509/847 cut-off events. [2023-08-27 10:13:05,327 INFO L125 PetriNetUnfolderBase]: For 564/564 co-relation queries the response was YES. [2023-08-27 10:13:05,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2313 conditions, 847 events. 509/847 cut-off events. For 564/564 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3347 event pairs, 145 based on Foata normal form. 0/811 useless extension candidates. Maximal degree in co-relation 2300. Up to 609 conditions per place. [2023-08-27 10:13:05,330 INFO L140 encePairwiseOnDemand]: 218/222 looper letters, 49 selfloop transitions, 4 changer transitions 1/54 dead transitions. [2023-08-27 10:13:05,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 323 flow [2023-08-27 10:13:05,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:13:05,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:13:05,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 493 transitions. [2023-08-27 10:13:05,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44414414414414416 [2023-08-27 10:13:05,331 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 493 transitions. [2023-08-27 10:13:05,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 493 transitions. [2023-08-27 10:13:05,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:13:05,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 493 transitions. [2023-08-27 10:13:05,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.6) internal successors, (493), 5 states have internal predecessors, (493), 0 states have call successors, (0), 0 states 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:13:05,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states 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:13:05,334 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states 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:13:05,334 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 135 flow. Second operand 5 states and 493 transitions. [2023-08-27 10:13:05,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 323 flow [2023-08-27 10:13:05,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 301 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-08-27 10:13:05,336 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 145 flow [2023-08-27 10:13:05,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2023-08-27 10:13:05,337 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2023-08-27 10:13:05,337 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 145 flow [2023-08-27 10:13:05,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.2) internal successors, (461), 5 states have internal predecessors, (461), 0 states have call successors, (0), 0 states 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:13:05,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:13:05,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:13:05,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 10:13:05,338 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:13:05,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:13:05,338 INFO L85 PathProgramCache]: Analyzing trace with hash 244222454, now seen corresponding path program 1 times [2023-08-27 10:13:05,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:13:05,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763448021] [2023-08-27 10:13:05,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:13:05,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:13:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:13:05,400 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:13:05,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:13:05,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763448021] [2023-08-27 10:13:05,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763448021] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:13:05,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:13:05,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:13:05,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716805356] [2023-08-27 10:13:05,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:13:05,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:13:05,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:13:05,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:13:05,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:13:05,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 222 [2023-08-27 10:13:05,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 96.2) internal successors, (481), 5 states have internal predecessors, (481), 0 states have call successors, (0), 0 states 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:13:05,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:13:05,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 222 [2023-08-27 10:13:05,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:13:05,501 INFO L124 PetriNetUnfolderBase]: 357/577 cut-off events. [2023-08-27 10:13:05,502 INFO L125 PetriNetUnfolderBase]: For 236/236 co-relation queries the response was YES. [2023-08-27 10:13:05,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1595 conditions, 577 events. 357/577 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2164 event pairs, 153 based on Foata normal form. 10/584 useless extension candidates. Maximal degree in co-relation 1583. Up to 256 conditions per place. [2023-08-27 10:13:05,503 INFO L140 encePairwiseOnDemand]: 214/222 looper letters, 36 selfloop transitions, 10 changer transitions 5/52 dead transitions. [2023-08-27 10:13:05,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 275 flow [2023-08-27 10:13:05,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:13:05,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:13:05,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 520 transitions. [2023-08-27 10:13:05,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46846846846846846 [2023-08-27 10:13:05,505 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 520 transitions. [2023-08-27 10:13:05,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 520 transitions. [2023-08-27 10:13:05,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:13:05,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 520 transitions. [2023-08-27 10:13:05,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.0) internal successors, (520), 5 states have internal predecessors, (520), 0 states have call successors, (0), 0 states 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:13:05,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states 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:13:05,507 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states 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:13:05,508 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 145 flow. Second operand 5 states and 520 transitions. [2023-08-27 10:13:05,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 275 flow [2023-08-27 10:13:05,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 52 transitions, 257 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-27 10:13:05,509 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 127 flow [2023-08-27 10:13:05,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-08-27 10:13:05,510 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-08-27 10:13:05,510 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 127 flow [2023-08-27 10:13:05,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.2) internal successors, (481), 5 states have internal predecessors, (481), 0 states have call successors, (0), 0 states 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:13:05,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:13:05,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:13:05,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 10:13:05,510 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:13:05,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:13:05,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1381746390, now seen corresponding path program 1 times [2023-08-27 10:13:05,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:13:05,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742666806] [2023-08-27 10:13:05,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:13:05,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:13:05,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:13:05,694 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:13:05,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:13:05,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742666806] [2023-08-27 10:13:05,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742666806] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:13:05,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:13:05,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:13:05,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020135233] [2023-08-27 10:13:05,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:13:05,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:13:05,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:13:05,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:13:05,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:13:05,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 222 [2023-08-27 10:13:05,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 127 flow. Second operand has 5 states, 5 states have (on average 94.2) internal successors, (471), 5 states have internal predecessors, (471), 0 states have call successors, (0), 0 states 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:13:05,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:13:05,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 222 [2023-08-27 10:13:05,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:13:05,816 INFO L124 PetriNetUnfolderBase]: 274/488 cut-off events. [2023-08-27 10:13:05,817 INFO L125 PetriNetUnfolderBase]: For 508/508 co-relation queries the response was YES. [2023-08-27 10:13:05,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 488 events. 274/488 cut-off events. For 508/508 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1846 event pairs, 94 based on Foata normal form. 1/489 useless extension candidates. Maximal degree in co-relation 1470. Up to 178 conditions per place. [2023-08-27 10:13:05,819 INFO L140 encePairwiseOnDemand]: 217/222 looper letters, 38 selfloop transitions, 3 changer transitions 14/55 dead transitions. [2023-08-27 10:13:05,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 55 transitions, 380 flow [2023-08-27 10:13:05,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:13:05,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:13:05,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 492 transitions. [2023-08-27 10:13:05,820 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44324324324324327 [2023-08-27 10:13:05,820 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 492 transitions. [2023-08-27 10:13:05,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 492 transitions. [2023-08-27 10:13:05,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:13:05,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 492 transitions. [2023-08-27 10:13:05,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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:13:05,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states 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:13:05,823 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states 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:13:05,823 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 127 flow. Second operand 5 states and 492 transitions. [2023-08-27 10:13:05,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 55 transitions, 380 flow [2023-08-27 10:13:05,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 55 transitions, 324 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-27 10:13:05,826 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 113 flow [2023-08-27 10:13:05,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2023-08-27 10:13:05,826 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-08-27 10:13:05,826 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 113 flow [2023-08-27 10:13:05,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.2) internal successors, (471), 5 states have internal predecessors, (471), 0 states have call successors, (0), 0 states 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:13:05,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:13:05,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:13:05,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 10:13:05,827 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:13:05,827 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:13:05,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1019346176, now seen corresponding path program 2 times [2023-08-27 10:13:05,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:13:05,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738478333] [2023-08-27 10:13:05,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:13:05,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:13:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:13:07,259 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:13:07,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:13:07,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738478333] [2023-08-27 10:13:07,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738478333] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:13:07,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:13:07,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-27 10:13:07,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710933002] [2023-08-27 10:13:07,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:13:07,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-27 10:13:07,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:13:07,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-27 10:13:07,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-27 10:13:07,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 222 [2023-08-27 10:13:07,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 113 flow. Second operand has 9 states, 9 states have (on average 85.22222222222223) internal successors, (767), 9 states have internal predecessors, (767), 0 states have call successors, (0), 0 states 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:13:07,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:13:07,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 222 [2023-08-27 10:13:07,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:13:07,592 INFO L124 PetriNetUnfolderBase]: 126/275 cut-off events. [2023-08-27 10:13:07,592 INFO L125 PetriNetUnfolderBase]: For 197/197 co-relation queries the response was YES. [2023-08-27 10:13:07,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 859 conditions, 275 events. 126/275 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1067 event pairs, 6 based on Foata normal form. 1/276 useless extension candidates. Maximal degree in co-relation 845. Up to 77 conditions per place. [2023-08-27 10:13:07,594 INFO L140 encePairwiseOnDemand]: 214/222 looper letters, 64 selfloop transitions, 12 changer transitions 18/95 dead transitions. [2023-08-27 10:13:07,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 95 transitions, 602 flow [2023-08-27 10:13:07,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 10:13:07,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 10:13:07,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 986 transitions. [2023-08-27 10:13:07,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4037674037674038 [2023-08-27 10:13:07,596 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 986 transitions. [2023-08-27 10:13:07,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 986 transitions. [2023-08-27 10:13:07,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:13:07,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 986 transitions. [2023-08-27 10:13:07,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 89.63636363636364) internal successors, (986), 11 states have internal predecessors, (986), 0 states have call successors, (0), 0 states 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:13:07,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 222.0) internal successors, (2664), 12 states have internal predecessors, (2664), 0 states have call successors, (0), 0 states 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:13:07,601 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 222.0) internal successors, (2664), 12 states have internal predecessors, (2664), 0 states have call successors, (0), 0 states 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:13:07,601 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 113 flow. Second operand 11 states and 986 transitions. [2023-08-27 10:13:07,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 95 transitions, 602 flow [2023-08-27 10:13:07,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 95 transitions, 563 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-08-27 10:13:07,603 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 179 flow [2023-08-27 10:13:07,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=179, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2023-08-27 10:13:07,605 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2023-08-27 10:13:07,605 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 179 flow [2023-08-27 10:13:07,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 85.22222222222223) internal successors, (767), 9 states have internal predecessors, (767), 0 states have call successors, (0), 0 states 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:13:07,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:13:07,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:13:07,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 10:13:07,606 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:13:07,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:13:07,609 INFO L85 PathProgramCache]: Analyzing trace with hash -384885786, now seen corresponding path program 3 times [2023-08-27 10:13:07,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:13:07,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946270062] [2023-08-27 10:13:07,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:13:07,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:13:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:13:07,767 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:13:07,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:13:07,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946270062] [2023-08-27 10:13:07,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946270062] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:13:07,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:13:07,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:13:07,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482088055] [2023-08-27 10:13:07,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:13:07,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:13:07,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:13:07,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:13:07,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:13:07,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 222 [2023-08-27 10:13:07,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 0 states have call successors, (0), 0 states 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:13:07,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:13:07,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 222 [2023-08-27 10:13:07,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:13:07,887 INFO L124 PetriNetUnfolderBase]: 190/391 cut-off events. [2023-08-27 10:13:07,887 INFO L125 PetriNetUnfolderBase]: For 458/458 co-relation queries the response was YES. [2023-08-27 10:13:07,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1422 conditions, 391 events. 190/391 cut-off events. For 458/458 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1637 event pairs, 47 based on Foata normal form. 2/393 useless extension candidates. Maximal degree in co-relation 1405. Up to 233 conditions per place. [2023-08-27 10:13:07,889 INFO L140 encePairwiseOnDemand]: 214/222 looper letters, 42 selfloop transitions, 10 changer transitions 18/70 dead transitions. [2023-08-27 10:13:07,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 70 transitions, 467 flow [2023-08-27 10:13:07,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:13:07,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:13:07,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 564 transitions. [2023-08-27 10:13:07,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42342342342342343 [2023-08-27 10:13:07,890 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 564 transitions. [2023-08-27 10:13:07,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 564 transitions. [2023-08-27 10:13:07,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:13:07,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 564 transitions. [2023-08-27 10:13:07,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 0 states 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:13:07,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states 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:13:07,894 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states 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:13:07,895 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 179 flow. Second operand 6 states and 564 transitions. [2023-08-27 10:13:07,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 70 transitions, 467 flow [2023-08-27 10:13:07,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 70 transitions, 461 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-27 10:13:07,898 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 221 flow [2023-08-27 10:13:07,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=221, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2023-08-27 10:13:07,899 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places. [2023-08-27 10:13:07,899 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 221 flow [2023-08-27 10:13:07,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 0 states have call successors, (0), 0 states 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:13:07,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:13:07,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:13:07,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 10:13:07,901 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 10:13:07,901 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:13:07,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1524158720, now seen corresponding path program 4 times [2023-08-27 10:13:07,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:13:07,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598661525] [2023-08-27 10:13:07,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:13:07,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:13:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:13:07,960 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 10:13:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:13:08,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 10:13:08,029 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 10:13:08,030 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (17 of 18 remaining) [2023-08-27 10:13:08,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2023-08-27 10:13:08,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-08-27 10:13:08,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (14 of 18 remaining) [2023-08-27 10:13:08,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-08-27 10:13:08,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-08-27 10:13:08,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-08-27 10:13:08,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-08-27 10:13:08,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2023-08-27 10:13:08,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2023-08-27 10:13:08,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2023-08-27 10:13:08,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-08-27 10:13:08,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-08-27 10:13:08,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (4 of 18 remaining) [2023-08-27 10:13:08,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-08-27 10:13:08,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-08-27 10:13:08,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-08-27 10:13:08,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-08-27 10:13:08,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 10:13:08,033 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2023-08-27 10:13:08,037 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 10:13:08,037 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 10:13:08,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 10:13:08 BasicIcfg [2023-08-27 10:13:08,089 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 10:13:08,089 INFO L158 Benchmark]: Toolchain (without parser) took 8629.06ms. Allocated memory was 337.6MB in the beginning and 524.3MB in the end (delta: 186.6MB). Free memory was 293.8MB in the beginning and 280.6MB in the end (delta: 13.2MB). Peak memory consumption was 203.0MB. Max. memory is 16.0GB. [2023-08-27 10:13:08,089 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 337.6MB. Free memory was 315.6MB in the beginning and 315.5MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 10:13:08,089 INFO L158 Benchmark]: CACSL2BoogieTranslator took 450.57ms. Allocated memory is still 337.6MB. Free memory was 293.8MB in the beginning and 269.7MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 10:13:08,089 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.33ms. Allocated memory is still 337.6MB. Free memory was 269.7MB in the beginning and 266.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-27 10:13:08,090 INFO L158 Benchmark]: Boogie Preprocessor took 40.22ms. Allocated memory is still 337.6MB. Free memory was 266.5MB in the beginning and 264.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:13:08,090 INFO L158 Benchmark]: RCFGBuilder took 544.71ms. Allocated memory is still 337.6MB. Free memory was 264.4MB in the beginning and 220.4MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.0GB. [2023-08-27 10:13:08,090 INFO L158 Benchmark]: TraceAbstraction took 7533.42ms. Allocated memory was 337.6MB in the beginning and 524.3MB in the end (delta: 186.6MB). Free memory was 219.3MB in the beginning and 280.6MB in the end (delta: -61.3MB). Peak memory consumption was 129.6MB. Max. memory is 16.0GB. [2023-08-27 10:13:08,091 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 337.6MB. Free memory was 315.6MB in the beginning and 315.5MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 450.57ms. Allocated memory is still 337.6MB. Free memory was 293.8MB in the beginning and 269.7MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 55.33ms. Allocated memory is still 337.6MB. Free memory was 269.7MB in the beginning and 266.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 40.22ms. Allocated memory is still 337.6MB. Free memory was 266.5MB in the beginning and 264.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 544.71ms. Allocated memory is still 337.6MB. Free memory was 264.4MB in the beginning and 220.4MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.0GB. * TraceAbstraction took 7533.42ms. Allocated memory was 337.6MB in the beginning and 524.3MB in the end (delta: 186.6MB). Free memory was 219.3MB in the beginning and 280.6MB in the end (delta: -61.3MB). Peak memory consumption was 129.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 122 PlacesBefore, 40 PlacesAfterwards, 115 TransitionsBefore, 31 TransitionsAfterwards, 2640 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 2 ChoiceCompositions, 104 TotalNumberOfCompositions, 9559 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3878, independent: 3608, independent conditional: 0, independent unconditional: 3608, dependent: 270, dependent conditional: 0, dependent unconditional: 270, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1427, independent: 1377, independent conditional: 0, independent unconditional: 1377, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3878, independent: 2231, independent conditional: 0, independent unconditional: 2231, dependent: 220, dependent conditional: 0, dependent unconditional: 220, unknown: 1427, unknown conditional: 0, unknown unconditional: 1427] , Statistics on independence cache: Total cache size (in pairs): 198, Positive cache size: 174, Positive conditional cache size: 0, Positive unconditional cache size: 174, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p1_EAX = 0; [L718] 0 int __unbuffered_p1_EBX = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff1_thd0; [L732] 0 _Bool y$r_buff1_thd1; [L733] 0 _Bool y$r_buff1_thd2; [L734] 0 _Bool y$r_buff1_thd3; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1740; [L845] FCALL, FORK 0 pthread_create(&t1740, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1740, ((void *)0), P0, ((void *)0))=-3, t1740={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L846] 0 pthread_t t1741; [L847] FCALL, FORK 0 pthread_create(&t1741, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1741, ((void *)0), P1, ((void *)0))=-2, t1740={5:0}, t1741={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L774] 2 y$w_buff1 = y$w_buff0 [L775] 2 y$w_buff0 = 1 [L776] 2 y$w_buff1_used = y$w_buff0_used [L777] 2 y$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L848] 0 pthread_t t1742; [L849] FCALL, FORK 0 pthread_create(&t1742, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1742, ((void *)0), P2, ((void *)0))=-1, t1740={5:0}, t1741={6:0}, t1742={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L786] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 2 y$flush_delayed = weak$$choice2 [L789] 2 y$mem_tmp = y [L790] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L791] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L792] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L793] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L794] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L795] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L796] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L797] 2 __unbuffered_p1_EAX = y [L798] 2 y = y$flush_delayed ? y$mem_tmp : y [L799] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L802] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L819] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L829] EXPR 3 __unbuffered_cnt + 1 [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 3 return 0; [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 y$flush_delayed = weak$$choice2 [L752] 1 y$mem_tmp = y [L753] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L754] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L755] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L756] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L757] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L759] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = y [L761] 1 y = y$flush_delayed ? y$mem_tmp : y [L762] 1 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L805] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L806] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L807] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L808] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L809] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L767] EXPR 1 __unbuffered_cnt + 1 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L812] EXPR 2 __unbuffered_cnt + 1 [L812] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L814] 2 return 0; [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1740={5:0}, t1741={6:0}, t1742={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L862] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L864] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={62:63}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 767]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 812]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 812]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 845]: 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: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 149 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 199 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 199 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 803 IncrementalHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 6 mSDtfsCounter, 803 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=9, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 121 ConstructedInterpolants, 0 QuantifiedInterpolants, 1324 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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:13:08,105 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...