/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 03:52:52,773 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 03:52:52,852 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-27 03:52:52,857 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 03:52:52,857 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 03:52:52,886 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 03:52:52,887 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 03:52:52,887 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 03:52:52,888 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 03:52:52,891 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 03:52:52,891 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 03:52:52,891 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 03:52:52,891 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 03:52:52,892 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 03:52:52,892 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 03:52:52,892 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 03:52:52,892 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 03:52:52,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 03:52:52,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 03:52:52,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 03:52:52,893 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 03:52:52,894 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 03:52:52,894 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 03:52:52,894 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 03:52:52,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 03:52:52,895 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 03:52:52,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 03:52:52,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:52:52,895 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 03:52:52,896 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 03:52:52,896 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 03:52:52,897 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 03:52:52,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 03:52:52,897 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 03:52:52,897 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 03:52:52,897 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 03:52:53,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 03:52:53,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 03:52:53,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 03:52:53,233 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 03:52:53,233 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 03:52:53,234 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2023-08-27 03:52:54,302 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 03:52:54,565 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 03:52:54,565 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2023-08-27 03:52:54,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b690ecc09/3cc99edb1d6a421a8ec654a4245d0b10/FLAG94800d5d3 [2023-08-27 03:52:54,586 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b690ecc09/3cc99edb1d6a421a8ec654a4245d0b10 [2023-08-27 03:52:54,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 03:52:54,589 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 03:52:54,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 03:52:54,590 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 03:52:54,592 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 03:52:54,592 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:52:54" (1/1) ... [2023-08-27 03:52:54,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ecbb7ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:52:54, skipping insertion in model container [2023-08-27 03:52:54,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:52:54" (1/1) ... [2023-08-27 03:52:54,641 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 03:52:55,021 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:52:55,035 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 03:52:55,062 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:52:55,063 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:52:55,101 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:52:55,133 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:52:55,133 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:52:55,140 INFO L206 MainTranslator]: Completed translation [2023-08-27 03:52:55,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:52:55 WrapperNode [2023-08-27 03:52:55,140 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 03:52:55,141 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 03:52:55,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 03:52:55,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 03:52:55,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:52:55" (1/1) ... [2023-08-27 03:52:55,179 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:52:55" (1/1) ... [2023-08-27 03:52:55,213 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 152 [2023-08-27 03:52:55,213 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 03:52:55,214 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 03:52:55,214 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 03:52:55,214 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 03:52:55,221 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:52:55" (1/1) ... [2023-08-27 03:52:55,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:52:55" (1/1) ... [2023-08-27 03:52:55,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:52:55" (1/1) ... [2023-08-27 03:52:55,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:52:55" (1/1) ... [2023-08-27 03:52:55,243 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:52:55" (1/1) ... [2023-08-27 03:52:55,245 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:52:55" (1/1) ... [2023-08-27 03:52:55,247 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:52:55" (1/1) ... [2023-08-27 03:52:55,248 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:52:55" (1/1) ... [2023-08-27 03:52:55,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 03:52:55,267 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 03:52:55,267 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 03:52:55,267 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 03:52:55,267 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:52:55" (1/1) ... [2023-08-27 03:52:55,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:52:55,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 03:52:55,302 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-27 03:52:55,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-27 03:52:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 03:52:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 03:52:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 03:52:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 03:52:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 03:52:55,327 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 03:52:55,328 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 03:52:55,328 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 03:52:55,328 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 03:52:55,328 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 03:52:55,328 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 03:52:55,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 03:52:55,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 03:52:55,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 03:52:55,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 03:52:55,330 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 03:52:55,441 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 03:52:55,443 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 03:52:55,773 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 03:52:55,854 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 03:52:55,855 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 03:52:55,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:52:55 BoogieIcfgContainer [2023-08-27 03:52:55,857 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 03:52:55,858 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 03:52:55,858 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 03:52:55,861 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 03:52:55,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 03:52:54" (1/3) ... [2023-08-27 03:52:55,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8daea0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:52:55, skipping insertion in model container [2023-08-27 03:52:55,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:52:55" (2/3) ... [2023-08-27 03:52:55,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8daea0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:52:55, skipping insertion in model container [2023-08-27 03:52:55,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:52:55" (3/3) ... [2023-08-27 03:52:55,863 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.opt_pso.opt_rmo.opt.i [2023-08-27 03:52:55,876 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 03:52:55,876 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-27 03:52:55,877 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 03:52:55,919 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 03:52:55,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 117 transitions, 249 flow [2023-08-27 03:52:55,995 INFO L124 PetriNetUnfolderBase]: 3/114 cut-off events. [2023-08-27 03:52:55,995 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:52:56,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 3/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-27 03:52:56,000 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 117 transitions, 249 flow [2023-08-27 03:52:56,004 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 114 transitions, 237 flow [2023-08-27 03:52:56,007 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 03:52:56,018 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 114 transitions, 237 flow [2023-08-27 03:52:56,021 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 114 transitions, 237 flow [2023-08-27 03:52:56,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 114 transitions, 237 flow [2023-08-27 03:52:56,058 INFO L124 PetriNetUnfolderBase]: 3/114 cut-off events. [2023-08-27 03:52:56,058 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:52:56,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 3/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-27 03:52:56,062 INFO L119 LiptonReduction]: Number of co-enabled transitions 2762 [2023-08-27 03:53:00,307 INFO L134 LiptonReduction]: Checked pairs total: 10116 [2023-08-27 03:53:00,308 INFO L136 LiptonReduction]: Total number of compositions: 104 [2023-08-27 03:53:00,319 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 03:53:00,324 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;@2822cd0e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 03:53:00,324 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-27 03:53:00,327 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 03:53:00,327 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-08-27 03:53:00,327 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:53:00,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:00,328 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 03:53:00,328 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:53:00,332 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:00,332 INFO L85 PathProgramCache]: Analyzing trace with hash 513184278, now seen corresponding path program 1 times [2023-08-27 03:53:00,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:00,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481152448] [2023-08-27 03:53:00,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:00,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:00,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:53:00,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:00,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481152448] [2023-08-27 03:53:00,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481152448] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:00,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:00,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:53:00,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446183541] [2023-08-27 03:53:00,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:00,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:53:00,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:00,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:53:00,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:53:00,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 221 [2023-08-27 03:53:00,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:00,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:00,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 221 [2023-08-27 03:53:00,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:01,148 INFO L124 PetriNetUnfolderBase]: 1464/2442 cut-off events. [2023-08-27 03:53:01,148 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-08-27 03:53:01,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4659 conditions, 2442 events. 1464/2442 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 14335 event pairs, 192 based on Foata normal form. 0/1914 useless extension candidates. Maximal degree in co-relation 4648. Up to 1813 conditions per place. [2023-08-27 03:53:01,167 INFO L140 encePairwiseOnDemand]: 218/221 looper letters, 34 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-08-27 03:53:01,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 168 flow [2023-08-27 03:53:01,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:53:01,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:53:01,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2023-08-27 03:53:01,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49019607843137253 [2023-08-27 03:53:01,180 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 325 transitions. [2023-08-27 03:53:01,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 325 transitions. [2023-08-27 03:53:01,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:01,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 325 transitions. [2023-08-27 03:53:01,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:01,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:01,191 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:01,192 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 67 flow. Second operand 3 states and 325 transitions. [2023-08-27 03:53:01,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 168 flow [2023-08-27 03:53:01,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 03:53:01,196 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 66 flow [2023-08-27 03:53:01,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2023-08-27 03:53:01,200 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2023-08-27 03:53:01,200 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 66 flow [2023-08-27 03:53:01,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:01,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:01,201 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 03:53:01,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 03:53:01,201 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:53:01,202 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:01,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1272588354, now seen corresponding path program 1 times [2023-08-27 03:53:01,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:01,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811254016] [2023-08-27 03:53:01,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:01,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:01,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:53:01,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:01,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811254016] [2023-08-27 03:53:01,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811254016] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:01,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:01,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:53:01,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874274616] [2023-08-27 03:53:01,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:01,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:53:01,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:01,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:53:01,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:53:01,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 221 [2023-08-27 03:53:01,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:01,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:01,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 221 [2023-08-27 03:53:01,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:01,539 INFO L124 PetriNetUnfolderBase]: 1175/1839 cut-off events. [2023-08-27 03:53:01,540 INFO L125 PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES. [2023-08-27 03:53:01,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3815 conditions, 1839 events. 1175/1839 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9119 event pairs, 367 based on Foata normal form. 0/1370 useless extension candidates. Maximal degree in co-relation 3805. Up to 1383 conditions per place. [2023-08-27 03:53:01,551 INFO L140 encePairwiseOnDemand]: 211/221 looper letters, 38 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2023-08-27 03:53:01,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 45 transitions, 190 flow [2023-08-27 03:53:01,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:53:01,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:53:01,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2023-08-27 03:53:01,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48868778280542985 [2023-08-27 03:53:01,557 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2023-08-27 03:53:01,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2023-08-27 03:53:01,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:01,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2023-08-27 03:53:01,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:01,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:01,562 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:01,562 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 66 flow. Second operand 3 states and 324 transitions. [2023-08-27 03:53:01,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 45 transitions, 190 flow [2023-08-27 03:53:01,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:53:01,566 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 98 flow [2023-08-27 03:53:01,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2023-08-27 03:53:01,567 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2023-08-27 03:53:01,567 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 98 flow [2023-08-27 03:53:01,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:01,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:01,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:53:01,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 03:53:01,575 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:53:01,577 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:01,577 INFO L85 PathProgramCache]: Analyzing trace with hash -250018355, now seen corresponding path program 1 times [2023-08-27 03:53:01,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:01,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698056120] [2023-08-27 03:53:01,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:01,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:02,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:53:02,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:02,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698056120] [2023-08-27 03:53:02,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698056120] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:02,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:02,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:53:02,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922768413] [2023-08-27 03:53:02,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:02,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:53:02,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:02,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:53:02,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:53:02,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 221 [2023-08-27 03:53:02,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:02,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:02,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 221 [2023-08-27 03:53:02,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:02,615 INFO L124 PetriNetUnfolderBase]: 2424/3755 cut-off events. [2023-08-27 03:53:02,616 INFO L125 PetriNetUnfolderBase]: For 361/396 co-relation queries the response was YES. [2023-08-27 03:53:02,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8827 conditions, 3755 events. 2424/3755 cut-off events. For 361/396 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 19507 event pairs, 325 based on Foata normal form. 0/3347 useless extension candidates. Maximal degree in co-relation 8816. Up to 2108 conditions per place. [2023-08-27 03:53:02,664 INFO L140 encePairwiseOnDemand]: 209/221 looper letters, 52 selfloop transitions, 11 changer transitions 0/66 dead transitions. [2023-08-27 03:53:02,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 66 transitions, 329 flow [2023-08-27 03:53:02,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:53:02,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:53:02,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 385 transitions. [2023-08-27 03:53:02,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43552036199095023 [2023-08-27 03:53:02,666 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 385 transitions. [2023-08-27 03:53:02,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 385 transitions. [2023-08-27 03:53:02,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:02,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 385 transitions. [2023-08-27 03:53:02,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:02,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:02,670 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:02,670 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 98 flow. Second operand 4 states and 385 transitions. [2023-08-27 03:53:02,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 66 transitions, 329 flow [2023-08-27 03:53:02,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 66 transitions, 320 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:53:02,673 INFO L231 Difference]: Finished difference. Result has 43 places, 40 transitions, 178 flow [2023-08-27 03:53:02,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=43, PETRI_TRANSITIONS=40} [2023-08-27 03:53:02,674 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2023-08-27 03:53:02,674 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 40 transitions, 178 flow [2023-08-27 03:53:02,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:02,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:02,674 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:53:02,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 03:53:02,675 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:53:02,675 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:02,675 INFO L85 PathProgramCache]: Analyzing trace with hash 839315959, now seen corresponding path program 1 times [2023-08-27 03:53:02,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:02,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013279717] [2023-08-27 03:53:02,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:02,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:53:02,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:02,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013279717] [2023-08-27 03:53:02,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013279717] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:02,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:02,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:53:02,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591592032] [2023-08-27 03:53:02,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:02,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:53:02,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:02,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:53:02,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:53:02,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 221 [2023-08-27 03:53:02,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:02,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:02,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 221 [2023-08-27 03:53:02,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:03,461 INFO L124 PetriNetUnfolderBase]: 3076/4960 cut-off events. [2023-08-27 03:53:03,461 INFO L125 PetriNetUnfolderBase]: For 2986/3026 co-relation queries the response was YES. [2023-08-27 03:53:03,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15550 conditions, 4960 events. 3076/4960 cut-off events. For 2986/3026 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 30081 event pairs, 511 based on Foata normal form. 111/4604 useless extension candidates. Maximal degree in co-relation 15535. Up to 2338 conditions per place. [2023-08-27 03:53:03,494 INFO L140 encePairwiseOnDemand]: 216/221 looper letters, 79 selfloop transitions, 6 changer transitions 0/89 dead transitions. [2023-08-27 03:53:03,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 89 transitions, 570 flow [2023-08-27 03:53:03,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:53:03,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:53:03,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 420 transitions. [2023-08-27 03:53:03,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4751131221719457 [2023-08-27 03:53:03,496 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 420 transitions. [2023-08-27 03:53:03,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 420 transitions. [2023-08-27 03:53:03,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:03,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 420 transitions. [2023-08-27 03:53:03,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:03,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:03,500 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:03,500 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 178 flow. Second operand 4 states and 420 transitions. [2023-08-27 03:53:03,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 89 transitions, 570 flow [2023-08-27 03:53:03,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 89 transitions, 567 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:53:03,505 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 237 flow [2023-08-27 03:53:03,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=237, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2023-08-27 03:53:03,506 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 8 predicate places. [2023-08-27 03:53:03,506 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 237 flow [2023-08-27 03:53:03,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:03,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:03,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:53:03,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 03:53:03,507 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:53:03,508 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:03,508 INFO L85 PathProgramCache]: Analyzing trace with hash 248881743, now seen corresponding path program 1 times [2023-08-27 03:53:03,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:03,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15412995] [2023-08-27 03:53:03,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:03,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:03,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:53:03,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:03,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15412995] [2023-08-27 03:53:03,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15412995] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:03,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:03,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:53:03,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276515193] [2023-08-27 03:53:03,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:03,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:53:03,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:03,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:53:03,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:53:03,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 221 [2023-08-27 03:53:03,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 237 flow. Second operand has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:03,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:03,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 221 [2023-08-27 03:53:03,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:05,526 INFO L124 PetriNetUnfolderBase]: 7038/11269 cut-off events. [2023-08-27 03:53:05,526 INFO L125 PetriNetUnfolderBase]: For 8494/8650 co-relation queries the response was YES. [2023-08-27 03:53:05,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35841 conditions, 11269 events. 7038/11269 cut-off events. For 8494/8650 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 77129 event pairs, 989 based on Foata normal form. 183/10226 useless extension candidates. Maximal degree in co-relation 35823. Up to 4087 conditions per place. [2023-08-27 03:53:05,597 INFO L140 encePairwiseOnDemand]: 209/221 looper letters, 123 selfloop transitions, 43 changer transitions 0/169 dead transitions. [2023-08-27 03:53:05,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 169 transitions, 1124 flow [2023-08-27 03:53:05,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:53:05,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:53:05,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 692 transitions. [2023-08-27 03:53:05,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4473173884938591 [2023-08-27 03:53:05,603 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 692 transitions. [2023-08-27 03:53:05,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 692 transitions. [2023-08-27 03:53:05,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:05,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 692 transitions. [2023-08-27 03:53:05,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:05,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:05,609 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:05,609 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 237 flow. Second operand 7 states and 692 transitions. [2023-08-27 03:53:05,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 169 transitions, 1124 flow [2023-08-27 03:53:05,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 169 transitions, 1119 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:53:05,619 INFO L231 Difference]: Finished difference. Result has 58 places, 82 transitions, 687 flow [2023-08-27 03:53:05,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=687, PETRI_PLACES=58, PETRI_TRANSITIONS=82} [2023-08-27 03:53:05,621 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 19 predicate places. [2023-08-27 03:53:05,621 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 82 transitions, 687 flow [2023-08-27 03:53:05,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.2) internal successors, (421), 5 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:05,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:05,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:53:05,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 03:53:05,622 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:53:05,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:05,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1106728134, now seen corresponding path program 1 times [2023-08-27 03:53:05,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:05,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925370004] [2023-08-27 03:53:05,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:05,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:05,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:53:05,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:05,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925370004] [2023-08-27 03:53:05,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925370004] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:05,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:05,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:53:05,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428517761] [2023-08-27 03:53:05,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:05,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:53:05,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:05,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:53:05,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:53:05,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 221 [2023-08-27 03:53:05,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 82 transitions, 687 flow. Second operand has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:05,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:05,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 221 [2023-08-27 03:53:05,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:06,592 INFO L124 PetriNetUnfolderBase]: 4669/7400 cut-off events. [2023-08-27 03:53:06,592 INFO L125 PetriNetUnfolderBase]: For 23716/24077 co-relation queries the response was YES. [2023-08-27 03:53:06,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32019 conditions, 7400 events. 4669/7400 cut-off events. For 23716/24077 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 49438 event pairs, 599 based on Foata normal form. 302/6823 useless extension candidates. Maximal degree in co-relation 31994. Up to 5116 conditions per place. [2023-08-27 03:53:06,644 INFO L140 encePairwiseOnDemand]: 214/221 looper letters, 113 selfloop transitions, 4 changer transitions 0/130 dead transitions. [2023-08-27 03:53:06,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 130 transitions, 1365 flow [2023-08-27 03:53:06,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:53:06,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:53:06,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 410 transitions. [2023-08-27 03:53:06,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4638009049773756 [2023-08-27 03:53:06,647 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 410 transitions. [2023-08-27 03:53:06,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 410 transitions. [2023-08-27 03:53:06,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:06,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 410 transitions. [2023-08-27 03:53:06,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:06,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:06,650 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:06,650 INFO L175 Difference]: Start difference. First operand has 58 places, 82 transitions, 687 flow. Second operand 4 states and 410 transitions. [2023-08-27 03:53:06,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 130 transitions, 1365 flow [2023-08-27 03:53:06,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 130 transitions, 1361 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-27 03:53:06,673 INFO L231 Difference]: Finished difference. Result has 58 places, 79 transitions, 679 flow [2023-08-27 03:53:06,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=679, PETRI_PLACES=58, PETRI_TRANSITIONS=79} [2023-08-27 03:53:06,675 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 19 predicate places. [2023-08-27 03:53:06,678 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 79 transitions, 679 flow [2023-08-27 03:53:06,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:06,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:06,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:53:06,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 03:53:06,679 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:53:06,679 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:06,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1229362823, now seen corresponding path program 1 times [2023-08-27 03:53:06,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:06,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450387669] [2023-08-27 03:53:06,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:06,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:06,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:53:06,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:06,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450387669] [2023-08-27 03:53:06,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450387669] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:06,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:06,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:53:06,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055168544] [2023-08-27 03:53:06,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:06,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:53:06,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:06,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:53:06,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:53:06,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 221 [2023-08-27 03:53:06,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 79 transitions, 679 flow. Second operand has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:06,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:06,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 221 [2023-08-27 03:53:06,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:07,626 INFO L124 PetriNetUnfolderBase]: 3636/5738 cut-off events. [2023-08-27 03:53:07,627 INFO L125 PetriNetUnfolderBase]: For 19806/20007 co-relation queries the response was YES. [2023-08-27 03:53:07,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26352 conditions, 5738 events. 3636/5738 cut-off events. For 19806/20007 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 37072 event pairs, 361 based on Foata normal form. 166/5755 useless extension candidates. Maximal degree in co-relation 26325. Up to 2806 conditions per place. [2023-08-27 03:53:07,661 INFO L140 encePairwiseOnDemand]: 214/221 looper letters, 150 selfloop transitions, 7 changer transitions 0/170 dead transitions. [2023-08-27 03:53:07,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 170 transitions, 1799 flow [2023-08-27 03:53:07,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:53:07,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:53:07,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2023-08-27 03:53:07,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4807692307692308 [2023-08-27 03:53:07,663 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 425 transitions. [2023-08-27 03:53:07,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 425 transitions. [2023-08-27 03:53:07,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:07,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 425 transitions. [2023-08-27 03:53:07,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:07,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:07,666 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:07,666 INFO L175 Difference]: Start difference. First operand has 58 places, 79 transitions, 679 flow. Second operand 4 states and 425 transitions. [2023-08-27 03:53:07,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 170 transitions, 1799 flow [2023-08-27 03:53:07,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 170 transitions, 1794 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:53:07,682 INFO L231 Difference]: Finished difference. Result has 60 places, 82 transitions, 718 flow [2023-08-27 03:53:07,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=718, PETRI_PLACES=60, PETRI_TRANSITIONS=82} [2023-08-27 03:53:07,683 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 21 predicate places. [2023-08-27 03:53:07,683 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 82 transitions, 718 flow [2023-08-27 03:53:07,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:07,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:07,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:53:07,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 03:53:07,684 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:53:07,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:07,684 INFO L85 PathProgramCache]: Analyzing trace with hash 532176888, now seen corresponding path program 1 times [2023-08-27 03:53:07,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:07,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726322774] [2023-08-27 03:53:07,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:07,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:07,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:53:07,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:07,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726322774] [2023-08-27 03:53:07,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726322774] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:07,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:07,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:53:07,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114697449] [2023-08-27 03:53:07,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:07,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:53:07,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:07,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:53:07,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:53:07,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 221 [2023-08-27 03:53:07,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 82 transitions, 718 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:07,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:07,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 221 [2023-08-27 03:53:07,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:08,466 INFO L124 PetriNetUnfolderBase]: 3894/6107 cut-off events. [2023-08-27 03:53:08,467 INFO L125 PetriNetUnfolderBase]: For 19720/19831 co-relation queries the response was YES. [2023-08-27 03:53:08,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29996 conditions, 6107 events. 3894/6107 cut-off events. For 19720/19831 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 37496 event pairs, 616 based on Foata normal form. 128/6124 useless extension candidates. Maximal degree in co-relation 29968. Up to 4371 conditions per place. [2023-08-27 03:53:08,503 INFO L140 encePairwiseOnDemand]: 218/221 looper letters, 94 selfloop transitions, 5 changer transitions 0/108 dead transitions. [2023-08-27 03:53:08,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 108 transitions, 1154 flow [2023-08-27 03:53:08,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:53:08,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:53:08,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2023-08-27 03:53:08,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4796380090497738 [2023-08-27 03:53:08,505 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 318 transitions. [2023-08-27 03:53:08,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 318 transitions. [2023-08-27 03:53:08,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:08,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 318 transitions. [2023-08-27 03:53:08,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:08,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:08,508 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:08,508 INFO L175 Difference]: Start difference. First operand has 60 places, 82 transitions, 718 flow. Second operand 3 states and 318 transitions. [2023-08-27 03:53:08,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 108 transitions, 1154 flow [2023-08-27 03:53:08,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 108 transitions, 1130 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-27 03:53:08,536 INFO L231 Difference]: Finished difference. Result has 61 places, 80 transitions, 703 flow [2023-08-27 03:53:08,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=703, PETRI_PLACES=61, PETRI_TRANSITIONS=80} [2023-08-27 03:53:08,536 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 22 predicate places. [2023-08-27 03:53:08,537 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 80 transitions, 703 flow [2023-08-27 03:53:08,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:08,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:08,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:53:08,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 03:53:08,537 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:53:08,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:08,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1340527128, now seen corresponding path program 1 times [2023-08-27 03:53:08,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:08,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321968288] [2023-08-27 03:53:08,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:08,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:08,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:53:08,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:08,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321968288] [2023-08-27 03:53:08,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321968288] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:08,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:08,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:53:08,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845321833] [2023-08-27 03:53:08,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:08,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:53:08,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:08,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:53:08,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:53:08,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 221 [2023-08-27 03:53:08,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 80 transitions, 703 flow. Second operand has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:08,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:08,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 221 [2023-08-27 03:53:08,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:09,791 INFO L124 PetriNetUnfolderBase]: 4852/7570 cut-off events. [2023-08-27 03:53:09,791 INFO L125 PetriNetUnfolderBase]: For 21577/21715 co-relation queries the response was YES. [2023-08-27 03:53:09,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35599 conditions, 7570 events. 4852/7570 cut-off events. For 21577/21715 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 47083 event pairs, 1063 based on Foata normal form. 129/7482 useless extension candidates. Maximal degree in co-relation 35570. Up to 6417 conditions per place. [2023-08-27 03:53:09,833 INFO L140 encePairwiseOnDemand]: 215/221 looper letters, 117 selfloop transitions, 19 changer transitions 0/148 dead transitions. [2023-08-27 03:53:09,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 148 transitions, 1551 flow [2023-08-27 03:53:09,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:53:09,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:53:09,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 408 transitions. [2023-08-27 03:53:09,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2023-08-27 03:53:09,835 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 408 transitions. [2023-08-27 03:53:09,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 408 transitions. [2023-08-27 03:53:09,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:09,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 408 transitions. [2023-08-27 03:53:09,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:09,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:09,838 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:09,838 INFO L175 Difference]: Start difference. First operand has 61 places, 80 transitions, 703 flow. Second operand 4 states and 408 transitions. [2023-08-27 03:53:09,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 148 transitions, 1551 flow [2023-08-27 03:53:09,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 148 transitions, 1522 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-27 03:53:09,881 INFO L231 Difference]: Finished difference. Result has 63 places, 96 transitions, 907 flow [2023-08-27 03:53:09,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=907, PETRI_PLACES=63, PETRI_TRANSITIONS=96} [2023-08-27 03:53:09,882 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 24 predicate places. [2023-08-27 03:53:09,883 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 96 transitions, 907 flow [2023-08-27 03:53:09,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.4) internal successors, (462), 5 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:09,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:09,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:53:09,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 03:53:09,883 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:53:09,884 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:09,884 INFO L85 PathProgramCache]: Analyzing trace with hash 418767915, now seen corresponding path program 1 times [2023-08-27 03:53:09,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:09,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183725282] [2023-08-27 03:53:09,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:09,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:10,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:53:10,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:10,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183725282] [2023-08-27 03:53:10,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183725282] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:10,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:10,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:53:10,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577728102] [2023-08-27 03:53:10,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:10,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:53:10,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:10,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:53:10,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:53:10,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 221 [2023-08-27 03:53:10,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 96 transitions, 907 flow. Second operand has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:10,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:10,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 221 [2023-08-27 03:53:10,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:11,478 INFO L124 PetriNetUnfolderBase]: 6362/9619 cut-off events. [2023-08-27 03:53:11,478 INFO L125 PetriNetUnfolderBase]: For 29852/29852 co-relation queries the response was YES. [2023-08-27 03:53:11,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48209 conditions, 9619 events. 6362/9619 cut-off events. For 29852/29852 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 57746 event pairs, 982 based on Foata normal form. 36/9562 useless extension candidates. Maximal degree in co-relation 48179. Up to 5341 conditions per place. [2023-08-27 03:53:11,532 INFO L140 encePairwiseOnDemand]: 210/221 looper letters, 87 selfloop transitions, 50 changer transitions 3/140 dead transitions. [2023-08-27 03:53:11,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 140 transitions, 1525 flow [2023-08-27 03:53:11,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:53:11,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:53:11,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 380 transitions. [2023-08-27 03:53:11,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298642533936652 [2023-08-27 03:53:11,534 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 380 transitions. [2023-08-27 03:53:11,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 380 transitions. [2023-08-27 03:53:11,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:11,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 380 transitions. [2023-08-27 03:53:11,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:11,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:11,537 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:11,537 INFO L175 Difference]: Start difference. First operand has 63 places, 96 transitions, 907 flow. Second operand 4 states and 380 transitions. [2023-08-27 03:53:11,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 140 transitions, 1525 flow [2023-08-27 03:53:11,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 140 transitions, 1525 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 03:53:11,582 INFO L231 Difference]: Finished difference. Result has 68 places, 120 transitions, 1385 flow [2023-08-27 03:53:11,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1385, PETRI_PLACES=68, PETRI_TRANSITIONS=120} [2023-08-27 03:53:11,583 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 29 predicate places. [2023-08-27 03:53:11,583 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 120 transitions, 1385 flow [2023-08-27 03:53:11,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:11,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:11,584 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:53:11,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 03:53:11,584 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:53:11,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:11,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1392817470, now seen corresponding path program 1 times [2023-08-27 03:53:11,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:11,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474781760] [2023-08-27 03:53:11,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:11,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:11,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:11,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:53:11,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:11,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474781760] [2023-08-27 03:53:11,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474781760] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:11,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:11,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:53:11,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112304341] [2023-08-27 03:53:11,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:11,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:53:11,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:11,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:53:11,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:53:11,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 221 [2023-08-27 03:53:11,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 120 transitions, 1385 flow. Second operand has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:11,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:11,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 221 [2023-08-27 03:53:11,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:12,575 INFO L124 PetriNetUnfolderBase]: 3487/5798 cut-off events. [2023-08-27 03:53:12,575 INFO L125 PetriNetUnfolderBase]: For 43309/44443 co-relation queries the response was YES. [2023-08-27 03:53:12,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33205 conditions, 5798 events. 3487/5798 cut-off events. For 43309/44443 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 39719 event pairs, 386 based on Foata normal form. 1448/7093 useless extension candidates. Maximal degree in co-relation 33171. Up to 3591 conditions per place. [2023-08-27 03:53:12,604 INFO L140 encePairwiseOnDemand]: 215/221 looper letters, 218 selfloop transitions, 8 changer transitions 3/254 dead transitions. [2023-08-27 03:53:12,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 254 transitions, 3514 flow [2023-08-27 03:53:12,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:53:12,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:53:12,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2023-08-27 03:53:12,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4606334841628959 [2023-08-27 03:53:12,606 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions. [2023-08-27 03:53:12,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions. [2023-08-27 03:53:12,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:12,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions. [2023-08-27 03:53:12,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:12,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:12,610 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:12,610 INFO L175 Difference]: Start difference. First operand has 68 places, 120 transitions, 1385 flow. Second operand 5 states and 509 transitions. [2023-08-27 03:53:12,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 254 transitions, 3514 flow [2023-08-27 03:53:12,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 254 transitions, 3513 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:53:12,642 INFO L231 Difference]: Finished difference. Result has 74 places, 122 transitions, 1430 flow [2023-08-27 03:53:12,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=1357, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1430, PETRI_PLACES=74, PETRI_TRANSITIONS=122} [2023-08-27 03:53:12,643 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 35 predicate places. [2023-08-27 03:53:12,643 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 122 transitions, 1430 flow [2023-08-27 03:53:12,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:12,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:12,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:53:12,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 03:53:12,643 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:53:12,644 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:12,644 INFO L85 PathProgramCache]: Analyzing trace with hash -103811286, now seen corresponding path program 1 times [2023-08-27 03:53:12,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:12,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617168032] [2023-08-27 03:53:12,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:12,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:12,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:53:12,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:12,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617168032] [2023-08-27 03:53:12,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617168032] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:12,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:12,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:53:12,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252518667] [2023-08-27 03:53:12,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:12,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:53:12,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:12,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:53:12,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:53:12,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 221 [2023-08-27 03:53:12,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 122 transitions, 1430 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:12,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:12,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 221 [2023-08-27 03:53:12,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:13,352 INFO L124 PetriNetUnfolderBase]: 2274/4009 cut-off events. [2023-08-27 03:53:13,352 INFO L125 PetriNetUnfolderBase]: For 36602/37696 co-relation queries the response was YES. [2023-08-27 03:53:13,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24406 conditions, 4009 events. 2274/4009 cut-off events. For 36602/37696 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 27741 event pairs, 145 based on Foata normal form. 1151/4999 useless extension candidates. Maximal degree in co-relation 24368. Up to 1964 conditions per place. [2023-08-27 03:53:13,370 INFO L140 encePairwiseOnDemand]: 215/221 looper letters, 234 selfloop transitions, 15 changer transitions 3/277 dead transitions. [2023-08-27 03:53:13,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 277 transitions, 3883 flow [2023-08-27 03:53:13,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:53:13,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:53:13,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 710 transitions. [2023-08-27 03:53:13,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45895281189398834 [2023-08-27 03:53:13,373 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 710 transitions. [2023-08-27 03:53:13,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 710 transitions. [2023-08-27 03:53:13,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:13,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 710 transitions. [2023-08-27 03:53:13,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.42857142857143) internal successors, (710), 7 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:13,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:13,377 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:13,378 INFO L175 Difference]: Start difference. First operand has 74 places, 122 transitions, 1430 flow. Second operand 7 states and 710 transitions. [2023-08-27 03:53:13,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 277 transitions, 3883 flow [2023-08-27 03:53:13,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 277 transitions, 3872 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:53:13,434 INFO L231 Difference]: Finished difference. Result has 81 places, 118 transitions, 1403 flow [2023-08-27 03:53:13,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=1322, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1403, PETRI_PLACES=81, PETRI_TRANSITIONS=118} [2023-08-27 03:53:13,434 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 42 predicate places. [2023-08-27 03:53:13,434 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 118 transitions, 1403 flow [2023-08-27 03:53:13,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:13,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:13,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:53:13,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 03:53:13,435 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:53:13,435 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:13,435 INFO L85 PathProgramCache]: Analyzing trace with hash 529372003, now seen corresponding path program 1 times [2023-08-27 03:53:13,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:13,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686624376] [2023-08-27 03:53:13,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:13,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:13,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:53:13,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:13,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686624376] [2023-08-27 03:53:13,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686624376] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:13,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:13,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:53:13,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285019044] [2023-08-27 03:53:13,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:13,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:53:13,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:13,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:53:13,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:53:13,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 221 [2023-08-27 03:53:13,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 118 transitions, 1403 flow. Second operand has 6 states, 6 states have (on average 92.66666666666667) internal successors, (556), 6 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:13,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:13,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 221 [2023-08-27 03:53:13,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:14,133 INFO L124 PetriNetUnfolderBase]: 2051/3492 cut-off events. [2023-08-27 03:53:14,133 INFO L125 PetriNetUnfolderBase]: For 33732/34711 co-relation queries the response was YES. [2023-08-27 03:53:14,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22950 conditions, 3492 events. 2051/3492 cut-off events. For 33732/34711 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 23529 event pairs, 62 based on Foata normal form. 798/4259 useless extension candidates. Maximal degree in co-relation 22909. Up to 1786 conditions per place. [2023-08-27 03:53:14,147 INFO L140 encePairwiseOnDemand]: 212/221 looper letters, 102 selfloop transitions, 17 changer transitions 119/251 dead transitions. [2023-08-27 03:53:14,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 251 transitions, 3585 flow [2023-08-27 03:53:14,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 03:53:14,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 03:53:14,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 891 transitions. [2023-08-27 03:53:14,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4479638009049774 [2023-08-27 03:53:14,150 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 891 transitions. [2023-08-27 03:53:14,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 891 transitions. [2023-08-27 03:53:14,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:14,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 891 transitions. [2023-08-27 03:53:14,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.0) internal successors, (891), 9 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:14,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 221.0) internal successors, (2210), 10 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:14,156 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 221.0) internal successors, (2210), 10 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:14,156 INFO L175 Difference]: Start difference. First operand has 81 places, 118 transitions, 1403 flow. Second operand 9 states and 891 transitions. [2023-08-27 03:53:14,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 251 transitions, 3585 flow [2023-08-27 03:53:14,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 251 transitions, 3428 flow, removed 62 selfloop flow, removed 5 redundant places. [2023-08-27 03:53:14,230 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 772 flow [2023-08-27 03:53:14,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=1166, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=772, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2023-08-27 03:53:14,231 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 45 predicate places. [2023-08-27 03:53:14,231 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 772 flow [2023-08-27 03:53:14,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.66666666666667) internal successors, (556), 6 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:14,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:14,231 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 03:53:14,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 03:53:14,231 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:53:14,232 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:14,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1325949748, now seen corresponding path program 1 times [2023-08-27 03:53:14,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:14,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151919147] [2023-08-27 03:53:14,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:14,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:53:14,269 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 03:53:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:53:14,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 03:53:14,322 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 03:53:14,323 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (17 of 18 remaining) [2023-08-27 03:53:14,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2023-08-27 03:53:14,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-08-27 03:53:14,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (14 of 18 remaining) [2023-08-27 03:53:14,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-08-27 03:53:14,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-08-27 03:53:14,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-08-27 03:53:14,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-08-27 03:53:14,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2023-08-27 03:53:14,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2023-08-27 03:53:14,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2023-08-27 03:53:14,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-08-27 03:53:14,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-08-27 03:53:14,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (4 of 18 remaining) [2023-08-27 03:53:14,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-08-27 03:53:14,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-08-27 03:53:14,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-08-27 03:53:14,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-08-27 03:53:14,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 03:53:14,327 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:53:14,331 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 03:53:14,332 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 03:53:14,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 03:53:14 BasicIcfg [2023-08-27 03:53:14,402 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 03:53:14,402 INFO L158 Benchmark]: Toolchain (without parser) took 19813.36ms. Allocated memory was 354.4MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 329.3MB in the beginning and 663.1MB in the end (delta: -333.8MB). Peak memory consumption was 736.3MB. Max. memory is 16.0GB. [2023-08-27 03:53:14,402 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 354.4MB. Free memory was 330.5MB in the beginning and 330.4MB in the end (delta: 169.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:53:14,403 INFO L158 Benchmark]: CACSL2BoogieTranslator took 551.02ms. Allocated memory is still 354.4MB. Free memory was 328.8MB in the beginning and 305.7MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 03:53:14,403 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.01ms. Allocated memory is still 354.4MB. Free memory was 305.7MB in the beginning and 302.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:53:14,403 INFO L158 Benchmark]: Boogie Preprocessor took 52.15ms. Allocated memory is still 354.4MB. Free memory was 302.7MB in the beginning and 301.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:53:14,403 INFO L158 Benchmark]: RCFGBuilder took 590.04ms. Allocated memory is still 354.4MB. Free memory was 301.1MB in the beginning and 311.0MB in the end (delta: -9.9MB). Peak memory consumption was 27.2MB. Max. memory is 16.0GB. [2023-08-27 03:53:14,403 INFO L158 Benchmark]: TraceAbstraction took 18543.72ms. Allocated memory was 354.4MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 311.0MB in the beginning and 663.1MB in the end (delta: -352.1MB). Peak memory consumption was 717.5MB. Max. memory is 16.0GB. [2023-08-27 03:53:14,409 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.11ms. Allocated memory is still 354.4MB. Free memory was 330.5MB in the beginning and 330.4MB in the end (delta: 169.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 551.02ms. Allocated memory is still 354.4MB. Free memory was 328.8MB in the beginning and 305.7MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 72.01ms. Allocated memory is still 354.4MB. Free memory was 305.7MB in the beginning and 302.7MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 52.15ms. Allocated memory is still 354.4MB. Free memory was 302.7MB in the beginning and 301.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 590.04ms. Allocated memory is still 354.4MB. Free memory was 301.1MB in the beginning and 311.0MB in the end (delta: -9.9MB). Peak memory consumption was 27.2MB. Max. memory is 16.0GB. * TraceAbstraction took 18543.72ms. Allocated memory was 354.4MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 311.0MB in the beginning and 663.1MB in the end (delta: -352.1MB). Peak memory consumption was 717.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 121 PlacesBefore, 39 PlacesAfterwards, 114 TransitionsBefore, 29 TransitionsAfterwards, 2762 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 3 ChoiceCompositions, 104 TotalNumberOfCompositions, 10116 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2875, independent: 2588, independent conditional: 0, independent unconditional: 2588, dependent: 287, dependent conditional: 0, dependent unconditional: 287, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1551, independent: 1491, independent conditional: 0, independent unconditional: 1491, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2875, independent: 1097, independent conditional: 0, independent unconditional: 1097, dependent: 227, dependent conditional: 0, dependent unconditional: 227, unknown: 1551, unknown conditional: 0, unknown unconditional: 1551] , Statistics on independence cache: Total cache size (in pairs): 134, Positive cache size: 107, Positive conditional cache size: 0, Positive unconditional cache size: 107, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1876; [L819] FCALL, FORK 0 pthread_create(&t1876, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1876, ((void *)0), P0, ((void *)0))=-3, t1876={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L820] 0 pthread_t t1877; [L821] FCALL, FORK 0 pthread_create(&t1877, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1877, ((void *)0), P1, ((void *)0))=-2, t1876={5:0}, t1877={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L822] 0 pthread_t t1878; [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L823] FCALL, FORK 0 pthread_create(&t1878, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1878, ((void *)0), P2, ((void *)0))=-1, t1876={5:0}, t1877={6:0}, t1878={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L793] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L741] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L754] EXPR 1 __unbuffered_cnt + 1 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L783] EXPR 2 __unbuffered_cnt + 1 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L803] EXPR 3 __unbuffered_cnt + 1 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876={5:0}, t1877={6:0}, t1878={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe004_power.opt_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 754]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 754]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 783]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 783]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 803]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 803]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 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: 18.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 390 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 390 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1008 IncrementalHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 18 mSDtfsCounter, 1008 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1430occurred in iteration=11, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 177 NumberOfCodeBlocks, 177 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 143 ConstructedInterpolants, 0 QuantifiedInterpolants, 879 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-27 03:53:14,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...